(12) United States Patent
`Ahn et al.
`
`(10) Patent No.:
`(45) Date of Patent:
`
`US 7,551,625 B2
`Jun. 23, 2009
`
`US007551625B2
`
`(54) METHOD OF SCHEDULING ANUPLINK
`PACKET TRANSMISSION CHANNEL INA
`MOBILE COMMUNICATION SYSTEM
`
`75
`s E. Song
`(75) Inventors: A. su
`; Seung Hwan Won,
`im, Seou
`Gyeonggi-do (KR)
`
`(73) Assignee: LG Electronics Inc., Seoul (KR)
`-
`(*) Notice:
`Subject to any disclaimer, the term of this
`patent is extended or adjusted under 35
`U.S.C. 154(b) by 701 days.
`
`(21) Appl. No.: 11/097,011
`
`(22) Filed:
`
`Mar. 31, 2005
`O
`O
`Prior Publication Data
`US 2005/022O116A1
`Oct. 6, 2005
`
`(65)
`
`1/2008 Love et al. .................. 455,522
`7,321,780 B2 *
`7.343,487 B2 * 3/2008 Lindqvist et al...
`... 713,162
`7,397,790 B2 * 7/2008 Zeira et al. ........
`... 370,352
`2003/0013451 A1* 1/2003 Walton ......
`... 455,447
`2003/0105809 A1* 6/2003 Yoshii et al. ................ TO9,203
`2003/0228865 A1* 12/2003 Terry ................
`... 455,422.1
`2004/0042435 A1
`3/2004 Soomro et al. .............. 370,338
`2004f00711 15 A1
`4/2004 Earnshaw et al. ........... 370/335
`2005.0025 100 A1* 2, 2005 Lee et al. .......
`... 370,335
`2005/0207359 A1* 9/2005 Hwang et al. .....
`... 370,278
`2007/0011334 A1* 1/2007 Higgins et al. .............. 709,227
`FOREIGN PATENT DOCUMENTS
`1328759
`12/2001
`1379600
`11, 2002
`WO99/41918
`8, 1999
`
`CN
`CN
`WO
`
`OTHER PUBLICATIONS
`Siemens: "Node B controlled rate scheduling by fast UE transmission
`power limitation”, R1-030791, TSG-RAN WG1#33 online), Aug.
`25, 2003.
`Motorola, et al: "Node B controlled Time and Rate Scheduling”.
`R1-030592, TSG-RAW WG1 #32 online, May 19, 2003.
`* cited by examiner
`Primary Examiner Thong HVu
`(74) Attorney, Agent, or Firm—McKenna Long & Aldridge
`LLP
`
`Foreign Application Priority Data
`(30)
`Apr. 2, 2004
`(KR) ...................... 10-2004-0022960
`(51) Int. Cl
`we
`(2006.01)
`H04L 2/28
`(52) U.S. Cl. .................................... 370/395.4; 370/278
`(58) Field of Classification Search ................. 370/395,
`370/338,346,335; 709/227
`See application file for complete search history.
`References Cited
`U.S. PATENT DOCUMENTS
`
`(56)
`
`ABSTRACT
`(57)
`A method of scheduling an uplink packet transmission chan
`nel in a mobile communication system is disclosed. The
`method of scheduling includes determining a scope of user
`equipments (UES) to be applied to a scheduling assignment
`for Scheduling the uplink packet transmission channel, and
`transmitting the scheduling assignment to the user equip
`5,526,357 A : 6/1996 Jandrell ...................... 370,346
`33 A ck
`S. al - - -
`- - - - 2.i ments included in the determined scope, wherein the sched
`6.452,915 B1* 9/2002 R
`370,338
`uling assignment includes an identifier for identifying the
`6,654,377 B1
`1/2003 ENaket al...370,395.4
`Scope of the user equipments and scheduling contents for
`6oos347 B2B
`/2006 Bodineral...I. 455,4563
`carrying information applicable to the scheduling assign
`7,013,143 B2 * 3/2006 Love et al. .................. 455,450
`ment.
`7.209,749 B2 * 4/2007 Kwak et al. .............. 455,452.2
`7,236,738 B2 * 6/2007 Settle ........................ 455,301
`
`42 Claims, 3 Drawing Sheets
`
`
`
`Determine
`RoT walue
`
`S31
`
`S38
`
`
`
`Group of
`UES
`
`Cradlepoint, Inc., et al., Ex. 1001
`Page 1 of 9
`
`

`

`U.S. Patent
`
`Jun. 23, 2009
`
`Sheet 1 of 3
`
`US 7,551,625 B2
`
`QUIQ
`
`
`
`QUI!!
`
`
`
`
`
`
`
`
`
`... ZWS IWS UWS I–UWS ... [[B-WS ... T9–VS . . . QVS QVS IVS
`
`
`
`
`
`
`
`
`
`?E-L-L-I-J · [-] · [-] · [-|-|-||-||0
`
`Cradlepoint, Inc., et al., Ex. 1001
`Page 2 of 9
`
`

`

`U.S. Patent
`
`Jun. 23, 2009
`
`Sheet 2 of 3
`
`US 7,551,625 B2
`
`FIG. 2
`
`SA
`
`an
`
`SA-all
`
`7-SA
`
`SA-Node B2
`SAS sa’
`(27 S.
`SAry S.K - SA SA-G2
`X
`SSX SA
`
`x,
`
`Y -
`
`-1
`
`w
`
`ra
`
`UEn
`
`SA
`M
`
`N
`
`UEn-1
`
`Cradlepoint, Inc., et al., Ex. 1001
`Page 3 of 9
`
`

`

`U.S. Patent
`
`Jun. 23, 2009
`
`Sheet 3 of 3
`
`US 7,551,625 B2
`
`FIG. 3
`
`
`
`Cradlepoint, Inc., et al., Ex. 1001
`Page 4 of 9
`
`

`

`US 7,551,625 B2
`
`1.
`METHOD OF SCHEDULING ANUPLINK
`PACKET TRANSMISSION CHANNEL INA
`MOBILE COMMUNICATION SYSTEM
`
`This application claims the benefit of Korean Application
`No. P2004-22960, filed on Apr. 2, 2004, which is hereby
`incorporated by reference.
`
`BACKGROUND OF THE INVENTION
`
`10
`
`15
`
`25
`
`35
`
`1. Field of the Invention
`The present invention relates to a method of scheduling in
`wireless packet communication system, and more particu
`larly, to a method of scheduling uplink packets in wireless
`communication system. Although the present invention is
`Suitable for a wide Scope of applications, it is particularly
`Suitable for transmitting scheduling information to specified
`groups of subscribers or to all subscribers.
`2. Discussion of the Related Art
`With increasing demand in speed and size of uplink trans
`mission, methods of high-speed packet communication dur
`ing the uplink from a mobile device to a base station are
`widely being discussed. E-DCH (Enhanceduplink Dedicated
`CHannel) of 3GPP WCDMA (3" Generation Partnership
`Project, Wideband Code Division Multiple Access) is an
`example of one of the methods being discussed.
`The E-DCH incorporates existing methods such as uplink
`packet scheduling from Node B (base station) in the 3GPP
`WCDMA uplink DCH (Dedicated CHannel) and HARQ
`(Hybrid Automatic Retransmission reCuest) in the Physical
`30
`Layer (PHY) to increase the efficiency of uplink transmis
`sion. Through efficient construction of scheduling assign
`ment from Node B, the system processing rate is increased.
`Node B controlled scheduling is one of the methods that is
`applicable to the existing 3GPP WCDMA E-DCH. Accord
`ing to current discussions on standards, techniques such as
`Time Division Multiplex (TDM), Code Division Multiplex
`(CDM), or time and code division multiplex can be used to
`transmit Node B scheduling assignment (Similar to High
`Speed Downlink Packet Access (USDPA)). If any of the three
`techniques are used, scheduling assignment transmitted to
`each user equipment (UE) contains at least UE classification
`identification (UEID) and the contents of scheduling assign
`ment.
`Each UE inspects the downlink channel which is used to
`transmit scheduling assignment via UE ID. If the UE ascer
`tains that the scheduling assignment transmitted as a part of
`UEID is correctly addressed, the UE acquires the contents of
`the scheduling assignment. According to the scheduling
`assignment, the UE starts, terminates, or holds transmission.
`Since the scheduling assignment is transmitted from Node B
`to each UE, a Substantial amount of time is required to trans
`mit the same scheduling assignment to a specified group of
`UES or to all the UES.
`As discussed above, scheduling assignments are indepen
`dently transmitted using time division, code division, or time
`code division techniques to each UE. Consequently, a prob
`lem arises in transmitting scheduling assignments to a
`specified group(s) of UEs or to all the UEs in the PHY. In
`addition, transmitting using Such techniques to individual UE
`60
`causes traffic congestion due to Sudden increase in uplink
`traffic in the PHY and cannot be dealt with quickly.
`
`40
`
`45
`
`50
`
`55
`
`SUMMARY OF THE INVENTION
`
`Accordingly, the present invention is directed to a method
`of Scheduling an uplink packet transmission channel in a
`
`65
`
`2
`mobile communication system that Substantially obviates one
`or more problems due to limitations and disadvantages of the
`related art.
`An object of the present invention is to provide a method of
`scheduling an uplink packet transmission channel in a base
`station of a mobile communication system.
`Another object of the present invention is to provide a
`method scheduling an uplink packet transmission channel to
`efficiently deal with communication traffic congestion prob
`lems.
`A further object of the present invention is to provide a
`method of scheduling an uplink packet transmission channel
`to transmit scheduling assignment, not only to individual user
`equipments, but also to a group of user equipments and/or to
`all user equipments.
`Additional advantages, objects, and features of the inven
`tion will be set forth in part in the description which follows
`and in part will become apparent to those having ordinary
`skill in the art upon examination of the following or may be
`learned from practice of the invention. The objectives and
`other advantages of the invention may be realized and
`attained by the structure particularly pointed out in the written
`description and claims hereofas well as the appended draw
`ings.
`To achieve these objects and other advantages and inaccor
`dance with the purpose of the invention, as embodied and
`broadly described herein, a method of scheduling an uplink
`packet transmission channel in a base station is provided. In
`the method of scheduling an uplink packet transmission chan
`nel, a scope of user equipments (UES) of a scheduling assign
`ment for Scheduling the uplink packet transmission channel is
`determined. Furthermore, the scheduling assignment to user
`equipments included in the determined scope is transmitted.
`Also, the scheduling assignment includes an user equipment
`identifier which identifies the scope of the user equipments,
`and Scheduling contents for carrying information applicable
`to the scheduling assignment.
`In another aspect of the present invention, a method of
`scheduling an uplink packet transmission channel in an user
`equipment (UE) is provided. In the method of Scheduling an
`uplink packet transmission, The UE receives a scheduling
`assignment transmitted from a base station. Also, the sched
`uling assignment includes an user equipment identifier which
`identifies a scope of user equipments for the scheduling
`assignment. In addition, the scheduling assignment includes
`scheduling contents for carrying information applicable to
`the scheduling assignment and for transmitting packets
`through the uplink packet transmission channel according to
`the scheduling assignment.
`It is to be understood that both the foregoing general
`description and the following detailed description of the
`present invention are exemplary and explanatory and are
`intended to provide further explanation of the invention as
`claimed.
`
`BRIEF DESCRIPTION OF THE DRAWINGS
`
`The accompanying drawings, which are included to pro
`vide a further understanding of the invention and are incor
`porated in and constitute a part of this application, illustrate
`embodiment(s) of the invention and together with the descrip
`tion serve to explain the principle of the invention. In the
`drawings;
`FIG. 1 shows scheduling assignment channels allocated
`along a timeline;
`FIG. 2 illustrates grouped scheduling assignment chan
`nels; and
`
`Cradlepoint, Inc., et al., Ex. 1001
`Page 5 of 9
`
`

`

`US 7,551,625 B2
`
`3
`FIG.3 is a flowchart for determining a method of transmit
`ting a scheduling assignment.
`
`DETAILED DESCRIPTION OF THE INVENTION
`
`10
`
`15
`
`25
`
`Reference will now be made in detail to the preferred
`embodiments of the present invention, examples of which are
`illustrated in the accompanying drawings. Wherever pos
`sible, the same reference numbers will be used throughout the
`drawings to refer to the same or like parts.
`Although the preferred embodiment of the present inven
`tion relates to an E-DCH, the present invention can be applied
`to Voluntary wireless packet communication system.
`An Enhanced Absolute Grant Channel (E-AGCH) is a
`downlink channel used by a base station (Node B) to send a
`scheduling command to an user equipment (UE). In other
`words, Node B transmits a command as to how much trans
`mission power or a level of data rate transmission an UE is
`permitted to transmit. This is also known as uplink scheduling
`assignment or scheduling assignment.
`Under E-AGCH, each frame of the downlink transmission
`from Node B of scheduling assignment includes UE identifier
`(UEID) and scheduling content. The UEID is used to identify
`the receiving UE of the scheduling assignment for an uplink
`packet transmission.
`The scheduling content includes various information Such
`as Scheduled power, duration, and priority. The scheduled
`power, also referred to as rate, defines a maximum amount of
`power that can be allotted for transmission of the uplink
`packet transmission. Furthermore, duration refers to how
`30
`long the scheduling assignment remains effective in each UE
`while priority refers to a certain limitation assigned to the
`uplink packet transmission. For example, if Node B transmits
`a scheduling assignment to UE1 with priority of C, where the
`order of alphabet starting with A indicating the highest prior
`ity of transmission, UE1 transmits when it is its time to
`transmit. In other words, UE1 transmits when it is time for
`UEs having priority C to transmit. Each scheduling assign
`ment can also include any combination of information Such as
`UE ID, scheduled power, and priority or UE ID, scheduled
`power, and duration.
`In E-AGCH, scheduling assignment(s) can be transmitted
`from Node B via shared channel(s) to an UE, group(s) of UEs,
`or all the UES. The transmitted Scheduling assignment is then
`shared by all the UEs. In E-AGCH, the UEs of the shared
`channel receive and decode the transmitted Scheduling
`assignment. After receipt and decoding of the scheduling
`assignment by the UEs of the shared channel, based on the UE
`ID included in a transmission packet of the scheduled assign
`ment, the scheduled assignment is followed by the UE(s)
`whose ID corresponds to the ID(s) of the transmission. For
`example, assuming there are four UEs (UE1-UE4), Node B
`transmits via a shared channel a scheduling assignment,
`which applies only to UE1, to all four UEs. All four UEs
`receive, decode, and identify to which UE(s) the transmission
`is directed. In the transmission, in the packet of the scheduling
`assignment would contain an UEID that corresponds only to
`the ID of UE1. Therefore, the scheduling assignment would
`be followed only by UE1 and not by any other UEs. This
`example could also apply to groups of UES.
`In addition, under E-AGCH, each UE can have more than
`one UE identifier. Here, each UE can have an identifier for a
`scheduling assignment directed to the corresponding UE, and
`another identifier for a scheduling assignment forwarded by
`another UE which received the initial scheduling assignment
`from Node B. In other words, an UE identifier for following
`a scheduling assignment transmitted from Node B as well as
`
`50
`
`35
`
`40
`
`45
`
`55
`
`60
`
`65
`
`4
`another UE identifier for following a scheduling assignment
`forwarded by another UE in the shared channel. Such for
`warding of Scheduling assignment can reduce and minimize
`transmission in the channel between Node B and UE(s). A
`number of identifiers an UE can possess is not limited to two
`identifiers as explained above but can have many more for
`various purposes.
`For example, continuing from the previous example, after
`the UEs receive and decodes the scheduling assignment trans
`mitted from Node B which is directed to UE4, the UE4 is
`further instructed to transmit the scheduling assignment to all
`UEs in the shared channel, i.e., UE1, UE2, UE3, and UE4.
`This time, the scheduling assignment is not from Node B but
`from another UE which received the initial assignment. Upon
`receipt of the scheduling assignment from UE4, all the UEs in
`the shared channel would receive and decode the assignment,
`as did with the assignment from Node B. Here, the scheduling
`assignment has identified UE1, UE2, and UE4 to follow. By
`having another UE identifier in each UE, Node B can direct
`the scheduling assignment intended for multiple UEs to a
`single UE and have that UE further transmit to other intended
`UES So as to minimize transmission of the same scheduling
`assignment.
`Under Enhance Relative Grant Access Channel
`(E-RGCH), unlike E-AGCH, Node B has a pre-allocated
`channel of transmission, and the scheduling assignment is
`transmitted accordingly. In E-RGCH, the scheduling assign
`ment is comprised of at least 1 bit, and ID is not transmitted as
`part of the transmission packet information. Subsequently,
`the UE receiving the scheduling assignment via the pre-allo
`cated channel reads and follows the assignment. For example,
`assuming there are four UEs (UE1-UE4), Node B transmits a
`scheduling assignment, which applies only to UE1, to only
`UE1. Because the transmission channels are pre-allocated,
`transmissions to the remaining UEs are not made.
`In addition, E-RGCH is not limited to transmitting sched
`uling assignment to a single UE at a time. Under E-RGCH, it
`is possible to pre-allocate a plurality of channels to transmit a
`same scheduling assignment to a plurality of UES. For
`example, continuing from the previous example, if Node B
`has pre-allocated channels 1 and 2 which apply to UE1 and
`UE2, respectively, to transmit the same scheduling assign
`ment, the same scheduling assignment would then be trans
`mitted only to UE 1 and UE2 and not to other UEs (UE3 and
`UE4). Only UE1 and UE2 would receive and follow the
`scheduling assignment.
`As discussed above, the differences between E-AGCH and
`E-RGCH is clear. Under E-AGCH, a scheduling assignment
`is received by all UEs in a shared channel regardless to which
`UE the scheduling assignment is directed. However, the
`scheduling assignment would apply only to the UEs having
`the IDs corresponding to the IDS designated in the scheduling
`assignment. Under E-RGCH, the transmission channel(s) are
`pre-allocated by Node B, and only the UE(s) of the pre
`allocated channel(s) would receive the scheduling assign
`ment(s). The UE(s) not having been pre-allocated by Node B
`would not receive the scheduling assignment(s).
`An embodiment of the present invention will be further
`explained with respect to E-AGCH. Node B utilizes various
`transmission techniques such as code division, time division,
`and code-time division methods to transmit scheduling
`assignment to UES via scheduling assignment channels (Ch
`1-Ch-n). The scheduling assignment includes contents and
`UEIDs of each UE, UE IDs of specified group(s), oran UE
`ID that applies to all the UEs uniformly. More specifically,
`scheduling content refers to the command transmitted from
`Node B to UEs which include information such as packet
`
`Cradlepoint, Inc., et al., Ex. 1001
`Page 6 of 9
`
`

`

`US 7,551,625 B2
`
`10
`
`15
`
`30
`
`35
`
`5
`transmission power (Tx Power), Transmit Format Combina
`tion (TFC), packet transmission time. As explained above,
`UEID is an identifier used to identify an UE or a group of UEs
`for transmitting scheduling assignment.
`The operation of Node B in determining the scheduling
`assignment for UE(s) is as follows. At each transmit time
`interval (TTI), Node B determines the status of the uplink
`packet transmission channel. To accomplish this, various
`techniques can be employed Such as Signal-to-Noise Ratio
`(SNR), Signal-to-Interference-plus-Noise Ratio (SINR) and
`Rise over Thermal noise (RoT). For example, RoT can be
`used to determine the uplink channel status. Here, Node B
`determines the RoT value based on the status of the uplink
`channel. The determined RoT value is then compared to at
`least one critical value. A critical value is set in a manner not
`to exceed a maximum RoT value permitted in the communi
`cation system. Based on whether the determined RoT value
`exceeds the critical value, Node B determines whether to
`transmit Scheduling assignment to each UE, group(s) of UEs,
`or all the UEs. Although one critical value was used in the
`above example, a plurality of critical values can be used to
`determine the method of transmitting scheduling
`assignment(s). Moreover, as discussed above, a method of
`determining the uplink channel status is not limited to using
`RoT, and other methods can be used.
`In FIG. 3, an example having two critical values (RoT,
`25
`RoT, except RoT,>RoT) are used to further explain
`scheduling assignment. The first step (S31) begins by first
`determining RoT value at every TTI of scheduling assign
`ment. The RoT value can be defined by calculating the power
`of receiving signals over thermal noise in the base station.
`After the RoT value is determined, the determined RoT value
`is compared with the RoT value (S32). Usually, the RoT
`value corresponds to noise/interference, hence when the
`noise/interference is low, the RoT value becomes large since
`the thermal noise compared to the power of receiving signal is
`small. On the contrary, if the noise/interference is high, the
`RoT value becomes small since the thermal noise compared
`to the power of receiving signal is large.
`If the determined RoT value is larger or equal than the
`RoT value (RoT2RoT, ), which denotes low noise/inter
`ference, a scheduling assignment is transmitted to each UE
`40
`(S33). When the transmission of scheduling assignment is
`made, the UEID is used to define the receiving UE, and the
`scheduling contents are used to transmit command for the UE
`to follow.
`If the determined RoT value is larger than RoT value, the
`determined RoT value is then compared to the RoT value.
`Since it was determined in the previous step that the deter
`mined RoT value is larger than RoT, Node B determines if
`the determined RoT value is smaller than or equal to the value
`of RoT (RoTsRoT<RoT) (S34). If so, the determined
`RoT value is Smaller than RoT, value but larger or equal to
`than RoT
`value. In Such a case, the scheduling
`assignment(s) is/are transmitted to a group or groups of UEs,
`containing the UEID and the scheduling contents (S35). The
`UE group IDs allow the UEs of the group to identify a sched
`uling assignment directed to them as a group. The UE group
`IDS can be pre-established using various techniques between
`Node B and the UES.
`If the determined RoT value is smaller than RoT
`(RoT<RoT), which denotes high interference, therefore
`the low RoT value, the same scheduling assignment, includ
`ing scheduling contents and an UEID, is transmitted to all the
`UEs (S36). Using RoT value is one of many methods of
`determining the status of the uplink packet transmission
`channel. As mentioned above, other techniques such as SNR
`and SINR can also be used.
`65
`FIG. 1 shows a numerous scheduling assignment channels
`during different time frames per each channel. Here, each
`
`50
`
`6
`channel can transmit individual scheduling assignment as
`well as different sets of groups of scheduling assignments and
`the all the scheduling assignments grouped as one. In other
`words, different types of scheduling assignments are trans
`mitted at different times.
`As presented in FIG. 1, Ch-1-Ch-n are, for example,
`orthogonal variable spreading factor (OVSF) code channels.
`In particular, n represents number of UEs capable of perform
`ing simultaneous decoding operation. Furthermore, SAi
`(i-1-n) represents scheduling assignment transmitted to i'
`UE, SA-Gi (i-1-k) represents scheduling assignment trans
`mitted to i' group of UEs, and SA-all represents scheduling
`assignment transmitted to all the UES.
`FIG. 2 shows transmitting scheduling assignments to UES
`as multiple groups or as a group consisting all the UES. As
`discussed above, based on the noise/interference of the uplink
`packet transmission channel as determined by Node B, the
`scheduling assignment commands the uplink packet trans
`mission.
`As shown in FIG. 2, Node B can transmit scheduling
`assignments to n number of UEs in groups as indicated by
`SA-G1 and SA-G2. At the same time, Scheduling assign
`ments can be transmitted to all UEs simultaneously as indi
`cated by SA-all. In transmitting scheduling assignments, spe
`cific UEID(s) directed for specific group(s) of UEs or for all
`UEs are transmitted along with Scheduling contents.
`It is possible to transmit Scheduling assignment to all the
`UES using a separate or different channel than the channels
`used to transmit scheduling assignments to each UEs sepa
`rately or to specific groups of UES.
`It is also possible to include in the scheduling assignmenta
`command which grants or denies packet transmission. In
`other words, Node B determines either to grant or deny packet
`transmission depending on the status of channels. Subse
`quently, traffic congestion in the channels and shortage of
`resources can be alleviated, promoting efficiency of the entire
`system.
`It will be apparent to those skilled in the art that various
`modifications and variations can be made in the present
`invention without departing from the spirit or scope of the
`inventions. Thus, it is intended that the present invention
`covers the modifications and variations of this invention pro
`vided they come within the scope of the appended claims and
`their equivalents.
`
`45
`
`55
`
`60
`
`What is claimed is:
`1. A method of scheduling an uplink packet transmission
`channel in a base station, the method comprising:
`transmitting a scheduling assignment in an Enhanced
`Absolute Grant Channel (E-AGCH), wherein the con
`tents of the scheduling assignment comprise an identi
`fier associated with a plurality of UE, and,
`receiving an uplink data packets on an Enhanced Uplink
`Dedicated Channel (E-DCH) according to the contents
`of the scheduling assignment.
`2. The method of claim 1, wherein the scheduling assign
`ment contents further comprise information related to the the
`transmission of the uplink data packets and wherein two
`identifiers are allocated to at least one UE.
`3. The method of claim 2, wherein the status of the E-DCH
`is determined as a function of a Rise over Thermal (RoT)
`value.
`4. The method of claim 3, wherein the RoT value is com
`pared to at least one pre-selected value.
`5. The method of claim 4, wherein the scheduling assign
`ment is transmitted to each of the plurality of UE if the RoT
`value is greater than or equal to the pre-selected value.
`
`Cradlepoint, Inc., et al., Ex. 1001
`Page 7 of 9
`
`

`

`US 7,551,625 B2
`
`5
`
`10
`
`15
`
`25
`
`35
`
`7
`6. The method of claim 4, wherein the scheduling assign
`ment is transmitted to each of the plurality of UE if the RoT
`value is less than the pre-selected value and greater than or
`equal to a second pre-selected value.
`7. The method of claim 4, wherein the scheduling assign
`ment is transmitted to each of the plurality of UE if the RoT
`value is less than the pre-selected value.
`8. The method of claim 7, wherein the scheduling contents
`include a priority transmission command for the E-DCH.
`9. The method of claim 2, wherein the scheduling contents
`include a scheduled power command for assigning a specified
`amount of power for the E-DCH.
`10. The method of claim 2, wherein the scheduling con
`tents include a duration command for determining a length of
`period the scheduling assignment remains effective.
`11. The method of claim 1, further comprising:
`determining the status of the E-DCH; and
`determining whether the scheduling assignment is associ
`ated with each of the plurality of UE according to the
`status of the E-DCH.
`12. The method of claim 1, wherein the scheduling assign
`ment includes a command granting or denying transmission
`in the E-DCH.
`13. The method of claim 1, whereintransmitting the sched
`uling assignment comprises:
`transmitting the scheduling assignment to the plurality of
`UE via a shared channel in the E-AGCH, wherein the
`Scheduling assignment is received and decoded by each
`of the plurality of UE.
`14. The method of claim 1 further comprising:
`30
`transmitting a scheduling assignment to a specific UE
`according to a pre-allocated transmission channel in an
`Enhanced Relative Grant Channel, wherein the specific
`UE corresponds with the pre-allocated transmission
`channel.
`15. The method of claim 14, wherein the scheduling
`assignment can be transmitted to a plurality of UE according
`to a corresponding plurality of pre-allocated transmission
`channels.
`16. A method of scheduling an uplink packet transmission
`channel for user equipment (UE), the method comprising:
`receiving a scheduling assignment in an Enhanced Abso
`lute Grant Channel (E-AGCH), wherein the scheduling
`assignment comprises an identifier for a plurality of UE:
`acquiring the contents of the scheduling assignment; and,
`transmitting an uplink data packet on an Enhanced Uplink
`Dedicated Channel (E-DCH) according to the contents
`of the scheduling assignment.
`17. The method of claim 16, wherein one or two identifiers
`are allocated to each UE.
`18. The method of claim 16, wherein the scheduling con
`tents include a scheduled power command for assigning a
`specified amount of powerfor the uplink packet transmission.
`19. The method of claim 16, wherein the scheduling con
`tents include a duration command for determining a length of
`period the scheduling assignment remains effective.
`20. The method of claim 16, wherein the scheduling con
`tents include a transmission priority command for the
`E-DCH.
`21. The method of claim 16, wherein the scheduling
`assignment includes a command granting or denying trans
`mission in the E-DCH.
`22. The method of claim 16, wherein each UE of a shared
`channel in the E-AGCH has at least one UE identifier.
`23. A method of scheduling an uplink packet transmission
`65
`channel in a mobile communication system, the method com
`prising:
`
`50
`
`40
`
`45
`
`55
`
`60
`
`8
`a base station transmitting a scheduling assignment in an
`Enhanced Absolute Grant Channel (E-AGCH) for
`scheduling an Enhanced Uplink Dedicated Channel
`(E-DCH):
`a plurality of user equipment (UE) receiving the scheduling
`assignment, wherein the content of the scheduling
`assignment includes an identifier associated with each of
`the plurality of UE, and transmitting packets through the
`E-DCH according to the scheduling assignment.
`24. The method of claim 23, wherein the scheduling
`assignment comprises scheduling contents relating to the the
`E-DCH and one or two identifiers allocated to each UE.
`25. The method of claim 24, wherein the scheduling con
`tents include a scheduled power command for assigning a
`specified amount of power for the E-DCH.
`26. The method of claim 24, wherein the scheduling con
`tents include a duration command for determining a length of
`period the scheduling assignment remains effective.
`27. The method of claim 24, wherein the scheduling con
`tents include a transmission priority command associated
`with the E-DCH.
`28. The method of claim 23, further comprising:
`determining the status of the E-DCH; and
`determining whether the scheduling assignment is associ
`ated with each of the plurality of UE according to the
`status of the E-DCH.
`29. The method of claim 23, wherein the status of the
`E-DCH is based on a Rise over Thermal (RoT) value.
`30. The method of claim 29, wherein the RoT value is
`compared to at least one pre-selected value.
`31. The method of claim 30, wherein the scheduling
`assignment is transmitted to each UE if the RoT value is
`greater than or equal to the pre-selected value.
`32. The method of claim 30, wherein the scheduling
`assignment is transmitted to each UE if the RoT value is less
`than the pre-selected value but greater than or equal to a
`second pre-selected value.
`33. The method of claim 30, wherein the same scheduling
`assignment is transmitted to each UE if the RoT value is less
`than the pre-selected value.
`34. The method of claim 23, wherein the scheduling
`assignment includes a command granting or denying trans
`mission for the E-DCH.
`35. The method of claim 23, wherein transmitting the
`scheduling assignment comprises:
`transmitting the scheduling assignment to the plurality of
`UE via a shared channel in the E-AGCH, and wherein
`the scheduling assignment is received and decoded by
`each UE.
`36. The method of claim 23 further comprising:
`transmitting the scheduling assignment to a specific UE
`according to a pre-allocated transmission channel in an
`Enhanced Relative Grant Channel, wherein the specific
`UE corresponds with the pre-allocated transmission
`channel.
`37. The method of claim 36, wherein the scheduling
`assignment can be transmitted to a plurality of UE according
`to corresponding plurality of pre-allocated transmission
`channels.
`38. The method of claim 23, wherein at least one UE
`identifier applies to a plurality of UE of a shared channel in an
`Enhanced Absolute Grant Channel.
`39. A method of scheduling a plurality of uplink packet
`transmission channels for a corresponding plurality of user
`equipment (UE), the method comprising:
`receiving a scheduling assignment in an Enhanced Abso
`lute Grant Channel (E-AGCH), wherein the content of
`
`Cradlepoint, Inc., et