`
`
`
`
`
`%
`&
`NS
`Cc
`on
`ou
`Oo
`
`Page 1 of 65
`
`PROVISIONAL APPLICATION FOR PATENT COVER SHEET
`This is a requestforfiling a PROVISIONAL APPLICATION FOR PATENTunder37 CFR 1.53(c)
`Express Mail Label No.: EV785689021US
`INVENTORS
`
`Inventor Name
`
`John M. Harris
`
`_
`Residence
`and either State or Foreign Count
`Chicago, Illinois, United States
`
`Additional inventors are being named onthe
`
`2
`
`separately numbered sheetattached hereto
`
`TITLE OF THE INVENTION (280 characters maximum)
`METHOD AND APPARATUS FOR SPREADING CHANNEL CODE SELECTION
`
`Direct all correspondenceto:
`Customer Number
`
`22917
`
`CORRESPONDENCE ADDRESS
`
`O
`be
`a0 =
`Ai =,
`>& ==S
`oN 0
`NS i39 S=0
`‘
`114
`
`
`
`OR
`
`||| Firm or Individual Name
`
`Address
`
`
`Address
`Cit
`poState|
`Count
`PodTelephone[Fax
`
`ENCLOSED APPLICATION PARTS(checkail that apply
`
`Specification Pages|Numberof Pages [-] CD(s),Number [
`
`
`
`
`
`
`Drawings
`Numberof Sheets
`5
`| Other(specify)
`Ref, - M2
`
`
`
`
`METHOD OF PAYMENTOF FILING FEES FOR THIS PROVISIONAL APPLICATION FOR PATENT
`
`
`[| Applicant claims small entity status. See 37 CFR 1.27.
`
`
`[__] Acheckor moneyorderis enclosed to coverthefiling fees
`
`
` Respectfully submitted,
`
`Application Data Sheet. See 37 CFR 1.76
`
`pages
`
`Filing Fee
`Amount ($
`
`-|Deposit Account Number: 502117. $200.00
`
`Xx The Director is hereby authorized to chargefiling fees or credit any overpaymentto
`
`[_] Paymentby credit card. Form PTO-2038is attached.
`
`
`
`The invention was made by an agencyof the United States Governmentor under a contract with an agency of
`the United States Government.
`
`
`
`No.
`
`[__] Yes, the nameof the U.S. Government agency and the Governmentcontract numberare:
`
`SIGNATURE
`
`TYPED or PRINTED NAM
`
`Jeffrey K. Jacobs
`
`
`
`
`
`TELEPHONE
`
`847-576-5562
`
`Date
`
`March 10, 2006
`
`REGISTRATION NO.
`(if appropriate)
`Docket Number:
`
`44,798
`
`CE15301R
`
`APPLE 1008
`APPLE 1008
`
`Page 1 of 65
`
`
`
`Page 2 of 65
`
`ho
`
`o& ~
`
`i
`
`
`
`
`to the Consolidated Appropriations Act, 2005 (H.R. 4818)
`
`FEE CALCULATION
`
`
`
`
`
`
`Complete if Known
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`ve
` Effective on 12/08/2004
`
`
`Filing Date PO
`2 FEE TRANSMITTAL
`
`a
`For FY 2005
`First NamedInventor
`
`
`
`[ Applicant claims small entity status. See 37 CFR 1.27
`|ExaminerName|Cd
`
`
`Group Art Unit Ds
`
`
`
`
`
`[Toraamounrorpavmenr[($)_|Attorney Docket No. CE15301R
`METHOD OF PAYMENT(checkall that apply)
`[_] Other (please identify):
`|_| None
`|_| Check
`|_| Credit card |_| Money Order
`
`bX Deposit Account Deposit Account Number: 502117 Deposit Account Name: MOTOROLA,INC.
`
`
`For the above-identified deposit account, the Director is hereby authorized to: (checkall that apply)
`x] Charge fee(s) indicated below
`C] Charge fee(s) indicated below, exceptfor thefiling fee
`
`
`Charge any additional fee(s) or underpayments of fee(s)
`(X] Credit any overpayments
`
`
`under 37 CFR 1.16 and 1.17
`
`
`WARNING: Information on this form may becomepublic. Credit card information should not be included onthis form. Provide credit card
`information and authorization on PTO-2038.
`
`
`
`
`1. BASIC FILING, SEARCH, AND EXAMINATION FEES
`EXAMINATION FEES
`FILING FEES
`SEARCH FEES
`
`
`PoCCS Smal Entity |SmallEntity| Small Entity [
`|ApplicationType|Fee($)|Fee($)|Fee(S)|Fee($)|Fee(S)|Fee($)_|Fees Paid (S
`
`[Utility|300ST50S|S00S|0|00s|too]
`
`|Design|200_:—«|Sst00—§s«|Stoo|SCT|ST
`[Plant|200=SéYsst00—§$«|;S300S|]tO]tC|CT
`[ReissueSs|300S|S150|S500|S|||
`
`
`
`
`[Provisionalss|200|100|o|o[oo|0 [$200.00
`
`
`
`Smail Entity
`Fee (S)
`25
`100
`180
`
`
`
`Fee Paid
`
`=
`
`Feet§)
`
`Fee($)
`50
`200
`360
`Multiple Dependent Claims
`
`ee Pa
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`4. OTHER FEE(S)_FeePaid(5)
`
`Non-English Specification, $130 fee (no small entity discount)
`
`——SpeareeneiL
`Other:
`
`
`
` SUBMITTED BY
`Complete (if applicable)
`
`
`
`Jeffrey K. Jacobs
`44,798
`847-576-5562
`YmLeahy—te 1,20
`Signature|f
`
`
`
`
`
`Se
`
`
`
`
`
`
`
`2. EXCESS CLAIM FEES
`Fee Description
`Each claim over 20 or, for Reissues, each claim over 20 and morethan in the original patent
`Each independentclaim over3 or, for Reissues, each independentclaim more than in the original patent
`Multiple dependent claims
`Total Claims
`
`— a, oe
`
`x
`- 20 or HP=
`HP=highest numberoftotal claims padfor, if greater than 20
`
`Extra Clai
`
`EF
`
`Indep. Claim:
`
`xtra Claim
`
`Fee
`
`Fee Paid
`
`
`
`HP=highest numberof independent claims paid for, if greater than 3
`
`3. APPLICATION SIZE FEE:
`If the specification and drawings exceed 100 sheets of paper, the application size fee due is $250 ($125 for small entity) for each additional 50 sheets
`or fraction thereof. See 35 U.S.C. 41(a)(1)(G) and 37 CFR 1.16(s).
`ion thereof
`additional 50 or
`Total
`Extra Sheet
`Number of each
`(round up toa whole number) x
`
`- 100=
`
`/50=
`
`F
`
`Fee Pai
`
`Page 2 of 65
`
`
`
`Page 3 of 65
`
`PROVISIONAL APPLICATION COVER SHEET
`Additional Page
`
`Docket Number: CE15301R
`
`INVENTOR(S)/APPLICANT(S
`
`Inventor Name
`
`Vijay G. Subramanian
`
`Residence
`and either State or Foreign Count
`
`City
`
`Chicago,Illinois, United States
`
`
`
`
`
`WARNING: Information on this form may become public. Credit card information should not be included on this form.
`Provide credit card information and authorization on PTO-2038.
`
`Number2 of 2
`
`
`
`Page 3 of 65
`
`
`
`
`
`
`
`Page 4 of 65
`
`1
`
`CE15301R Harris etal.
`
`METHOD AND APPARATUS FOR SPREADING CHANNEL CODE
`
`SELECTION
`
`Reference(s) to Related Application(s)
`
`The present application claims priority from provisional application,
`
`Serial No. «Prov_Appl_Number», entitled “METHOD AND APPARATUS FOR
`
`10
`
`SPREADING CHANNEL CODE SELECTION,”filed March 10, 2006, whichis
`
`commonly owned and incorporated herein by referencein its entirety.
`
`Field of the Invention
`
`The present
`
`invention relates generally to communications and,
`
`in
`
`particular, to spreading channel code selection in communication systems.
`
`Background of the Invention
`
`15
`
`20
`
`as 3GPP (3rd Generation
`such
`bodies
`standards
`Currently,
`Partnership Project) and 3GPP2 (3rd Generation Partnership Project 2) are
`developing standards specifications for wireless telecommunications systems.
`
`(These http:/Awww.3qpp.org/=andgroups may be contacted via
`
`
`
`
`25
`http:/www.3gpp2.com/,
`respectively.)
`In particular, proposals for new
`
`physical
`
`layer
`
`link descriptions are being developed and submitted for
`
`consideration.
`
`In general, wireless technologies that employ spreading and
`
`two-stage ranging rely on remote units to randomly select a spreading
`channel code to use with their initial ranging signal. The limited number of
`
`30
`
`ranging codes and the frequencyof collisions between units using the same
`
`code for access degrade the performance of user services (greater access
`
`Page 4 of 65
`
`
`
`Page 5 of 65
`
`2
`
`CE15301R Harris et al.
`
`delays, e.g.) and diminish user experience, particularly with time sensitive
`services such as push-to-talk. Accordingly, it would be desirable to have an
`improved method and apparatus for spreading channel code selection
`applicable to these wireless technologies.
`
`Brief Description of the Drawings
`
`FIG.
`
`1
`
`is a depiction of a wireless communication system in
`
`accordance with multiple embodiments of the present invention.
`
`FIG. 2 is a block diagram depiction of the wireless communication
`
`system of FIG. 1,
`
`in accordance with multiple embodiments of the present
`
`invention.
`
`FIG, 3 is a logic flow diagram of functionality performed by a networkin
`
`accordance with multiple embodiments of the present invention.
`
`FIG. 4 is a logic flow diagram of functionality performed by a remote
`unit in accordance with multiple embodiments of the present invention.
`
`20
`
`FIG. 5 is a logic flow diagram of functionality performed by a networkin
`
`accordance with multiple embodiments of the present invention.
`
`25
`
`Specific embodiments of the present invention are disclosed below
`
`with reference to FIGs. 1-5. Both the description and theillustrations have
`been drafted with the intent to enhance understanding. For example,
`the
`dimensions of some of the figure elements may be exaggeratedrelative to
`
`other elements, and well-known elements that are beneficial or even
`
`30
`
`necessary to a commercially successful implementation may not be depicted
`
`so that a less obstructed and a more clear presentation of embodiments may
`be achieved. In addition, unless specifically indicated, the order and grouping
`
`Page 5 of 65
`
`
`
`Page 6 of 65
`
`3
`
`CE15301R Harris et al.
`
`of signaling is not a limitation of other embodiments that may lie within the
`
`scope of the claims
`
`Simplicity and clarity in both illustration and description are sought to
`
`effectively enable a personof skill in the art to make, use, and best practice
`
`the present invention in view of what is already knownin the art. One ofskill
`
`in the art will appreciate that various modifications and changes may be made
`to the specific embodiments described below without departing from the spirit
`and scope of the present invention. Thus, the specification and drawings are
`
`to be regarded asillustrative and exemplary rather than restrictive or all-
`encompassing, and all such modifications to the specific embodiments
`described below are intended to be included within the scope of the present
`
`invention.
`
`15
`
`Detailed Description of Embodiments
`
`Various embodiments are described which may serve to improve
`
`spreading channel code selection in wireless technologies that employ two-
`
`stage ranging. For example, some of the embodiments enable a numberof
`
`20
`
`spreading codes to be reused at each network node, potentially increasing
`
`the numberof codes available to each remote unit and thereby reducing the
`
`collision rate. Rather
`
`than simply selecting a spreading channel code
`
`randomly, remote units,
`
`in some embodiments, select a spreading channel
`
`code based on one or more considerations such as pilot signal strength,
`
`25
`
`remote unit
`
`location, a remote unit mobility level, and a priority class
`
`associated with the remote unit. Depending on the embodiment, network
`
`nodes can partition the spreading codes into groups and then assign link
`
`bandwidth to remote units based on the group associated with the code
`
`selected by that remote unit.
`
`30
`
`The disclosed embodiments can be more fully understood with
`
`reference to FIGs. 1-5.
`
`FIGs.
`
`1 and 2 depict a wireless communication
`
`system 100 in accordance with multiple embodiments of
`
`the present
`
`Page 6 of 65
`
`
`
`Page 7 of 65
`
`ts
`
`CE15301R Harris etal.
`
`invention. At present, standards bodies such as OMA (Open Mobile Alliance),
`3GPP (3rd Generation Partnership Project), 3GPP2 (3rd Generation
`Partnership Project 2) and IEEE (institute of Electrical and Electronics
`Engineers) 802 are developing standards
`specifications
`for wireless
`
`telecommunications
`systems.
`(These groups may be
`contacted via
`http:/www.openmobilealliance.com,
`http://www.3gpp.orq/,
`http://www.3qpp2.com/
`and
`http://www.ieee802.org/,
`respectively.)
`
`Communication system 100 represents a system having an architecture in
`
`accordance with one or more of the 3GPP2 technologies, suitably modified to
`
`10
`
`implement
`
`the present invention. Alternative embodiments of the present
`
`invention may be implemented in communication systems that employ other
`
`or additional technologies such as, but not limited to, those described in the
`3GPP_
`specifications
`and/or
`those described in
`the
`IEEE’s 802.xx
`specifications (e.g., 802.16).
`
`15
`
`Communication system 100 is depicted in a very generalized manner,
`
`shown to comprise network nodes 111 and 112, remote units 101-103, and
`
`network 130. Thoseskilled in the art will recognize that FIGs. 1 and 2 do not
`depict all of the network equipment necessary for system 100 to operate but
`only those system components and logical entities particularly relevant to the
`description of embodiments herein. For example, depending on the
`embodiment, network 130 may represent an IP (internet protocol) networkor,
`
`20
`
`in combination with network nodes 111 and 112, a radio access network
`
`(RAN) or access network (AN). Thus, depending on the embodiment, network
`
`nodes 111 and 112 may comprise base transceiver stations (BTSs), access
`
`25
`
`points (APs), and/or higher order devices such as base stations (BSs) (which
`
`include BTSs and basesite controllers (BSCs)) and WLAN (wireless local
`
`area network) stations (which include APs, AP controllers / switches, and/or
`
`WLAN switches); however, none of these devices are specifically shown in
`
`FIGs. 1 or 2.
`
`30
`
`In FIG. 2,
`
`remote unit 101 and network node 111 are shown
`
`communicating via technology-dependent, wireless interface 150. Remote
`
`units, or user equipment (UEs), may be thought of as mobile stations (MSs);
`
`Page 7 of 65
`
`
`
`Page 8 of 65
`
`5
`
`CE15301R Harris et al.
`
`however, remote units are not necessarily mobile nor able to move.
`In
`addition, remote unit / UE platforms are knownto refer to a wide variety of
`consumerelectronic platforms such as, but not limited to, mobile stations
`
`(MSs), access terminals (ATs), terminal equipment, mobile devices, gaming
`devices, personal computers, personal digital assistants (PDAs). In particular,
`
`remote unit 101
`comprises processing unit 105, and transceiver 107.
`Depending on the embodiment, remote unit 101 may additionally comprise a
`keypad (not shown), a speaker (not shown), a microphone (not shown), and a
`
`display (not shown). Processing units,
`
`transceivers, keypads, speakers,
`
`10
`
`microphones, and displays as used in UEsareall well-knownin the art.
`
`In general, components such as transceivers, keypads, speakers,
`
`microphones, and displays are well-known. For example, processing units are
`
`known to comprise basic components such as, but neither limited to nor
`
`necessarily requiring, microprocessors, microcontrollers, memory devices,
`
`application-specific integrated circuits (ASICs), and/or logic circuitry. Such
`components are typically adapted to implement algorithms and/or protocols
`
`that have been expressed using high-level design languages or descriptions,
`
`expressed using computer
`
`instructions, expressed using signaling flow
`
`diagrams, and/or expressed using logic flow diagrams.
`
`20
`
`Thus, given a high-level description, an algorithm, a logic flow, a
`messaging / signaling flow, and/or a protocol specification, those skilled in the
`art are aware of the many design and development techniques available to
`implement a processing unit that performs the given logic. Therefore, remote
`
`unit 101 represents a known device that has been adapted, in accordance
`
`25
`
`with the description herein, to implement multiple embodiments of the present
`invention.
`.
`
`Furthermore, those skilled in the art will recognize that aspects of the
`
`present
`
`invention may be implemented in and across various physical
`
`components
`and
`none
`are
`necessarily
`limited
`to
`single
`platform
`implementations. For example, the network aspects may be implemented in
`
`30
`
`or across one or more network devices, such as in network node 111 or
`
`across one or more network nodes and/or network 130.
`
`Page 8 of 65
`
`
`
`Page 9 of 65
`
`6
`
`CE15301R Harris etal.
`
`Operation of embodiments in accordance with the present invention
`
`occurs substantially as follows. Processing unit 105 of remote unit 101
`
`receives signaling from network node 111 via wireless interface 150 and
`
`the received signaling is pilot
`In most embodiments,
`transceiver 107.
`information conveyed via a pilot channel of network node 111.
`In wireless
`
`technologies that employ spreading and two-stage ranging, prior art remote
`
`units randomly select a spreading channel code to use with their initial
`
`ranging signal. In contrast, processing unit 105 of remote unit 101 selects a
`
`spreading channel code based on one or more considerations, depending on
`
`10
`
`the particular embodiment. These considerations include the signal strength
`
`of the received signaling, the current location of the remote unit, the current
`
`mobility level of the remote unit, and / or the current priority class associated
`
`with the remote unit. Having selected a spreading channel code, processing
`
`unit 105 then transmits, via transceiver 107 and wireless interface 150, an
`
`initial access signal using the spreading channel code selected. This initial
`
`access signal may take the form of a ranging signal, for example, or other
`
`technology-dependentsignaling required access the network node.
`
`What type of spreading channel codes are selected and used also
`
`varies from one technology to the next. The spreading channel codes may be
`
`20
`
`orthogonal or quasi-orthogonal, although they need not be either, such as the
`
`spreading codes specified in IEEE 802.16e. As another example,
`
`the
`
`spreading channel codes may be based on Chu sequences as describedin
`
`U.S. Provisional Application 60/759,697,
`
`filed January 17, 2006, entitled
`
`“PREAMBLE SEQUENCING FOR RANDOM ACCESS CHANNEL IN A
`
`25
`
`COMMUNICATION SYSTEM,”and hereby incorporated by reference.
`
`In some embodiments, network node 111 partitions the spreading
`
`channel codesthat it makes available to remote units into code groups and
`
`transmits an indication of both the spreading channel codes available for use
`and the code group with which each is associated. This is information may be
`broadcast and received by remote unit 101 via a pilot channel of network
`
`30
`
`node 111. Obviously, there are a great many waysto indicate the spreading
`
`channel codes andtheir associated code groups to remote units. The specific
`
`Page 9 of 65
`
`
`
`Page 10 of 65
`
`7
`
`CE15301R Harms et al.
`
`format of this signaling will, of course, depend upon how muchinformation
`
`the remote units already have regarding the nature and identity of the code
`set used system-wide and usedbythe particular network node itself.
`Thus,
`remote unit 101
`receives
`signaling that
`indicates which
`
`spreading channel codes may be used by the remote unit for accessing
`
`network node 111 and the associated groupings of the codes.
`
`In these
`
`embodiments, then, processing unit 105 determines a particular code group
`
`from which to select a spreading channel code to use. Depending on the
`
`embodiment, remote unit 101 may determine a particular code group based
`
`on one or more considerations such as a received signal strength (the pilot
`signal strength, e.g.) from network node 111, the current location of remote
`
`unit 101,
`
`the current mobility level of remote unit 101, and / or a current
`
`priority class associated with remote unit 101.
`
`This determination may be guided by the remote unit characteristics
`
`that individual code groups are intended to target. For example, one code
`
`group maybe targeted for remote units that are associated with a particular
`
`priority class, i.e. a particular level of service. This could allow codes to be
`
`“set aside” for users who have purchased a premium level service or users
`
`who are involved in responding to emergencies, for example.
`
`20
`
`Code groups could also be targeted for remote units in a particular
`
`area. For example, a code group might target remote units inside (or outside)
`region 125 around network node 111. Or a code group maytarget an area of
`particular interest such as that around a stadium, convention center, highway,
`shopping center, auditorium, conference room, etc. Code groups could also
`
`25
`
`target remote units having a particular level of mobility. For example, one
`
`code group maytarget low-mobility units while another targets high-mobility
`
`units.
`
`30
`
`Another characteristic that individual code groups may be intended to
`target is remote unit received signal strength, this being of signaling from the
`network node such as pilot signaling that is received by the remote unit.
`(Signal strength is used throughout this description to generically refer to the
`various forms of signal measurement that are used such as signal quality
`
`Page 10 of 65
`
`
`
`Page 11 of 65
`
`8
`
`CE15301R Harmis et al.
`
`measurements, measurements for CQI (channel quality indicator), and/or
`
`unique metrics derived from various combinations of both). One example of
`
`code groups targeting remote unit received signal strength would be for
`network node 111 to target one code group for units that have a received
`signal strength above a particular threshold and another code group forunits
`
`that have a received signal strength below the particular threshold.
`In effect,
`then, network node 111 could target one code group for
`coverage region 125 (roughly) and another for the remainder of coverage
`area 121. (Note that a similar effect could be achieved using remote unit
`location, as described above.) Partitioning the spreading channel! codesinto
`
`10
`
`code groups that are targeted for particular coverage regions can enable
`
`greater code reuse than is believed available today. For example,
`the
`spreading channel codes of one or more code groups targeting wireless
`coverage region 125, for instance, can be reused by network nodes with
`
`1S
`
`wireless coverage areas adjacent
`
`to network node 111. Thus,
`
`since
`
`interference is not a problem between coverage regions 125 and 126,
`network nodes 111 and 112 can reuse the spreading channel codestargeted
`for these regions. Potentially, then, for a subset of the spreading channel
`
`codes a 1:1 reuse pattern could be used.
`
`20
`
`Additionally or alternatively, network node 111 may monitor a system
`
`loading level and partition the spreading channel codes into code groups
`based on the current system load. For example, network node 111 may
`partition the spreading channel codes into more code groups when the
`
`system loading level is greater than a loading threshold. Examples of system
`
`loading level indicators that may be used include the number ofcollisions per
`code/code group,
`the number of
`transmissions per code/code group
`(equivalently utilization of codes/code groups), recent changes in the number
`of users attached to the cell in different cell groups (predicting/anticipating a
`significant change in pattern), etc. The benefit sought by considering the level
`of system loading is that by partitioning more code groups and having the
`remote unit selecting the appropriate code group,
`the system can save
`capacity by using information from the remote unit
`indicating how large a
`
`25
`
`30
`
`Page 11 of 65
`
`
`
`Page 12 of 65
`
`9
`
`CE15301R Harris etal.
`
`resource assignment it needs.
`
`In other words,if there are only two groups,
`
`then the network will still end up doing a fair bit of over assignment of
`
`resources for mobiles which are very close to the network node, as the
`
`network may think that they are as far away as halfway out within the cell.
`
`However, by partitioning 10 different groups, then the network can know that
`
`the user who is very near the tower is within the closest 1/10 or so of the
`
`cell/sector and thus can use an even smaller assignment. The downside of
`
`breaking the codes into more groups is that of potentially creating more
`
`collisions within one group while another group is under-utilized. However,
`this can be addressed by dividing the unit among code groupsin different
`
`10
`
`time intervals.
`
`Thus, depending on the embodiment, remote unit 101 may determine
`
`a particular code group based on one or more considerations such as a
`
`received signal strength from network node 111,
`
`the current
`
`location of
`
`remote unit 101, the current mobility level of remote unit 101, and / or a
`
`current priority class associated with remote unit 101. As discussed above,
`
`this determination may be guided by the remote unit characteristics that
`
`individual code groups are intended to target. Network node 111 may also
`
`indicate to remote unit 101, in addition to the codes and the code groupings,
`
`20
`
`what characteristics the code groups are intended to target.
`
`Using this
`
`received information or some pre-defined information
`
`regarding the targeted characteristics of the code groups, remote unit 101
`determines a particular code group from which to select a spreading channel
`
`25
`
`code. In some embodiments, processing unit 105 simply selects a spreading
`channel code randomly from the spreading channel codes associated with the
`determined group. Thus, the selection of a spreading channel code based on
`
`various considerations may be performed by determining a code group,
`based on the particular considerations, and then selecting, perhaps randomly,
`a spreading channel code from the determined code group.
`
`30
`
`A number of examples of remote unit characteristics for which code
`
`groups could be targeted was provided above. Thus,
`
`remote unit 101
`
`considers the applicable characteristics or combination of characteristics that
`
`Page 12 of 65
`
`
`
`Page 13 of 65
`
`10
`
`CE15301R Hams et al.
`
`the available code groups target to determine a code group from which to
`
`select a code. For example, remote unit 101 may determine to select from
`one code group becauseof the remote unit’s current location (per GPS,e.g.)
`or because the user has purchased a premium service level.
`In another
`
`embodiment, remote unit 101 may determine to select from a particular code ~
`
`group becausethe pilot signal strength of network node 111 is greater than a
`
`threshold and because remote unit 101 currently has a low level of mobility.
`
`Another code group may be determined for selection in the case that either
`
`the pilot signal strength is below the threshold or if remote unit 101 has a
`
`10
`
`mobility level above a mobility threshold. This is just one example of the many
`
`possible combinations of characteristics that code groups might target to
`
`effect a partitioning of the spreading codes.
`
`Depending on the embodiment, however, remote units may not be
`
`locked into selecting a spreading channel code from the code group targeted
`
`15
`
`by the applicable remote unit characteristics. For example, remote unit 101
`
`may determine the code group that applies to its current situation, select a
`code to use from that code group, and then determine that the code selected
`
`is being used by another device. In such a case, remote unit 101 may select
`another code from the determined code group or may select a code from
`another code group altogether.
`
`20
`
`Some other embodiment-specific aspects that may be incorporated
`
`into the embodiments already described follow. The spreading channel codes
`that are partitioned into groups, while unique as codes, may share a common
`
`modulation and coding type. Thus, when a remote unit, in this case, selects a
`
`25
`
`spreading channel code, it is not selecting a level of redundancyor a type of
`
`modulation / data rate.
`
`In
`
`addition to selecting a
`
`spreading channel
`
`code,
`
`in
`
`some
`
`embodiments the remote unit will select the spreading channel code and a
`
`time period for using the spreading channel code. In other words, the remote
`
`unit selects a code-time combination (e.g., a code andastart time) from a
`30
`
`group of code-time combinations. Thus, the available code-time combinations
`
`are partitioned into groups just as the codes alone would be, except that the
`
`Page 13 of 65
`
`
`
`Page 14 of 65
`
`11
`
`CE15301R Harrisetal.
`
`same codes may bein different groups but associated with different time
`
`periods for use. Determination of a group of code-time combinations from
`which to select could occur as described herein for code groups.
`After network node 111 receives an initial access signal from remote
`
`unit 101 using the spreading channel code selected by remote unit 101,
`network node 111 may assign an amountof link bandwidth (forward and/or
`
`reverse link bandwidth) to the remote unit based on the code group of the
`spreading channel code used. For example,
`in a case in which the code
`group has been targeted for a level of signal strength of a signal received by
`
`10
`
`the remote unit greater than a threshold and the remote unit uses a spreading
`
`channel code from that code group, the network node may assign a smaller
`
`amount of
`
`link bandwidth to the remote unit
`
`than would be otherwise
`
`assigned. Here, the network node may assumethat the smaller amount of
`
`link bandwidth will be sufficient since the remote unit has signal strength
`
`15
`
`greater than the threshold, as indicated by the spreading channel code the
`
`remote unit used. Potentially then, using this technique, less bandwidth may
`
`be usedin certain situations, improving system capacity.
`
`FIG. 3 is a logic flow diagram of functionality performed by a networkin
`
`accordance with multiple embodiments of the present invention. Logic flow
`
`20
`
`300 begins (301) with the network partitioning (303) a plurality of spreading
`
`channel codesinto a plurality of code groups. The network then transmits
`
`(305) signaling that indicates the code groupings produced by the partitioning
`
`and receives an initial access signal from a remote unit using a spreading
`
`25
`
`channel code from a code groupof the plurality of code groups. Logic flow
`300 then ends(309).
`FIG. 4 is a logic flow diagram of functionality performed by a remote
`
`unit in accordance with multiple embodiments of the present invention. Logic
`
`flow 400 begins (401) when a remote unit receives (403) signaling from a
`
`network node. The remote unit selects (405) a spreading channel code based
`
`30
`
`on at least one characteristic from a group of a signal strength of the received
`signaling, a current location of the remote unit, a current mobility level of the
`
`remote unit, and a current priority class associated with the remote unit. The
`
`Page 14 of 65
`
`
`
`Page 15 of 65
`
`12
`
`CE15301R Harms et al.
`
`remote unit then transmits (407) an initial access signal using the spreading
`
`channel code. Logic flow 400 then ends (409).
`
`FIG.5 is a logic flow diagram of functionality performed by a networkin
`
`accordance with multiple embodiments of the present invention. Logic flow
`
`500 begins (501) with the network partitioning (503) a plurality of spreading
`channel codes into a plurality of code groups. The network then receives
`
`(505) an initial access signal from a remote unit using a spreading channel
`
`code from a code group of the plurality of code groups.
`
`In response, the
`
`network assigns (507) an amountof link bandwidth to the remote unit based
`
`on the code group of the spreading channel code used by the remote unit.
`
`Logic flow 500 then ends (509).
`
`Benefits, other advantages, and solutions to problems have been
`
`described above with regard to specific embodiments of
`
`the present
`
`invention. However, the benefits, advantages, solutions to problems, and any
`
`element(s)
`
`that may cause or
`
`result
`
`in such benefits, advantages, or
`
`solutions, or cause such benefits, advantages, or solutions to become more
`
`pronounced are notto be construed asa critical, required, or essential feature
`
`or element of anyorall the claims.
`
`As used herein and in the appended claims,
`
`the term “comprises,”
`
`20
`
`“comprising,” or any other variation thereof is intended to refer to a non-
`
`exclusive inclusion, such that a process, method, article of manufacture, or
`
`apparatus that comprises a list of elements does not
`include only those
`elements in the list, but may include other elements not expressly listed or
`inherent to such process, method, article of manufacture, or apparatus. The
`
`25
`
`terms a or an, as used herein, are defined as one or more than one. The
`
`term plurality, as used herein, is defined as two or more than two. The term
`
`another, as used herein, is defined as at least a second or more. The terms
`
`including and/or having, as used herein, are defined as comprising (i.e., open
`language). The term coupled, as used herein,
`is defined as connected,
`
`30
`
`although not necessarily directly,
`and not necessarily mechanically.
`Terminology derived from the word “indicating”
`(e.g.,
`“indicates” and
`“indication”) are intended to encompassall the various techniques available
`
`Page 15 of 65
`
`
`
`Page 16 of 65
`
`13
`
`CE15301R Harris etal.
`
`for communicating or referencing the object being indicated. Some, but notall
`
`examples of techniques available for communicating or referencing the object
`
`being indicated include the conveyance of the object being indicated, the
`
`conveyance of an identifier of the object being indicated, the conveyance of
`
`information used to generate the object being indicated, the conveyance of
`
`some part or portion of the object being indicated, the conveyance of some
`
`derivation of the object being indicated, and the conveyance of some symbol
`
`representing the object being indicated. The terms program, computer
`
`program, and computer instructions, as used herein, are defined as a
`
`10
`
`sequence ofinstructions designed for execution on a computer system. This
`
`sequence of instructions may include, but is not limited to, a subroutine, a
`
`function, a procedure, an object method, an object
`
`implementation, an
`
`executable application, an applet, a servlet, a shared library/dynamic load
`
`library, a source code, an object code and/or an assembly code.
`
`15
`
`Whatis claimed is:
`
`SSeeeeee
`
`Page 16 of 65
`
`
`
`Page 17 of 65
`
`14
`
`CE15301R Harris etal.
`
`Claims
`
`1
`
`A method for spreading channel code selecti