The present invention relates generally to a system and method for wireless communications, and more particularly to a system and method for assigning communications resources in a wireless communications system.
In orthogonal frequency division multiplexing (OFDM) and orthogonal frequency division multiple access (OFDMA) communications systems, time-frequency resources may be shared among a number of mobile stations (MS). A base station (BS) may assign the time-frequency resources to an MS using an assignment message, which may be transmitted as part of a control channel. Ideally, information regarding an assignment of the time-frequency resources to an MS may be transmitted to the MS using as little control channel overhead (for example, fewest bits of information) as possible, while maintaining as much assignment flexibility as possible.
In a commonly used technique to minimize control channel overhead, the BS may transmit the time-frequency resource assignment in the form of an index to a channel tree. The channel tree may include channel tree nodes, wherein each channel tree node may correspond to a specific portion of the time-frequency resources of the OFDMA communications system. In general, the structure of the channel tree may dictate the permissible assignments of the time-frequency resources. For example, if there are eight time-frequency resources that may be assigned and if the channel tree has the structure of a binary tree, then an assignment may be transmitted using four bits of information.
In an alternate approach to assigning the time-frequency resources, the BS may transmit a bitmap to the MS, wherein each bit of the bitmap may represent a time-frequency resource that may be assigned and the value of the bit may represent the time-frequency resources assigned to the MS. For example, if there are eight time-frequency resources that may be assigned, then an assignment may be transmitted using eight bits of information, with one bit per time-frequency resource. Additionally, if a bit in the eight-bit sequence has a value of one (1), then a corresponding time-frequency resource may be assigned to the MS, while if a bit has a value of zero (0), then a corresponding time-frequency resource may not be assigned to the MS.
These and other problems are generally solved or circumvented, and technical advantages are generally achieved, by embodiments of a system and a method for assigning resources in a wireless communications system.
In accordance with an embodiment, a method for operating a base station of a wireless communications system is provided. The method includes receiving a resource request for radio resources for a mobile station, and in response to a determining that the base station will service the resource request, assigning radio resources based on the resource request, and transmitting an indicator of the assigned radio resources to the mobile station. The assigning makes use of a channel tree comprised of two non-orthogonal sets of mappings between nodes of the channel tree and radio resources, with each node corresponding to at least one radio resource. The method also includes in response to a determining that the base station will not service the resource request, returning to a normal mode of operations.
In accordance with another embodiment, a method for operating a base station of a wireless communications system is provided. The method includes receiving a resource request for radio resources for a mobile station, and in response to a determining that the base station will service the resource request, assigning radio resources based on the resource request, and transmitting an indicator of the assigned radio resources to the mobile station. The assigning makes use of an annular channel tree comprised of an outermost ring having one or more nodes corresponding to allocatable radio resources, at least two rings each having a same number of nodes as the outermost ring, and at least one combining ring having a node that combines nodes from an outer ring in a circularly adjacent manner. The method also includes in response to a determining that the base station will not service the resource request, returning to a normal mode of operations.
In accordance with another embodiment, a method for operating a base station of a wireless communications system is provided. The method includes receiving a resource request for radio resources for a mobile station, and in response to a determining that the base station will service the resource request, determining possible allocatable radio resources based on the resource request, assigning radio resources from the possible allocatable radio resources, updating radio resources information regarding the assigned radio resources, transmitting an indicator of the assigned radio resources to the mobile station. The allocatable radio resources may be based on a channel tree comprised of two non-orthogonal sets of mappings between nodes of the channel tree and radio resources, an annular channel tree comprised of a set of mappings between nodes of the annular channel tree and radio resources, or a multilevel channel tree comprised of a set of mappings between nodes of the multilevel channel tree and radio resources with an allocation specified by a first index corresponding to a node in a first portion of the multilevel channel tree and a second index corresponding to a number of nodes a specified number of levels below the node. The method also includes in response to a determining that the base station will not service the resource request, returning to a normal mode of operations.
In accordance with another embodiment, an electronic device is provided. The electronic device includes a base station that coordinates communications of a mobile station associated with the base station, and a scheduler coupled to the base station. The communications are coordinated using resource requests transmitted to the base station. The scheduler determines allocatable radio resources based on a resource request, assigns radio resources, and updates assigned radio resources. The allocatable radio resources may be based on a channel tree comprised of two non-orthogonal sets of mappings between nodes of the channel tree and radio resources, an annular channel tree comprised of a set of mappings between nodes of the annular channel tree and radio resources, or a multilevel channel tree comprised of a set of mappings between nodes of the multilevel channel tree and radio resources with an allocation specified by a first index corresponding to a node in a first portion of the multilevel channel tree and a second index corresponding to a number of nodes a specified number of levels below the node.
In accordance with another embodiment, a method for operating a base station of a wireless communications system is provided. The method includes receiving a resource request for radio resources for a mobile station, and in response to a determining that the base station will service the resource request, assigning radio resources based on the resource request, and transmitting an indicator of the assigned radio resources to the mobile station. The assigning makes use of a multilevel channel tree comprised of a set of mappings between nodes of the multilevel channel tree and radio resources, with each node corresponding to at least one radio resource, the multilevel channel tree specifiable by a first index corresponding to a node in a first portion of the multilevel channel tree and a second index corresponding to a number of nodes a specified number of levels below the node, wherein the number of levels is dependent on a length of the second index. The method also includes in response to a determining that the base station will not service the resource request, returning to a normal mode of operations.
An advantage of an embodiment is that a higher degree of assignment flexibility may be achieved without incurring significantly increased control channel overhead.
A further advantage of an embodiment is that control channel overhead is kept in check while providing increased assignment flexibility.
The foregoing has outlined rather broadly the features and technical advantages of the present invention in order that the detailed description of the embodiments that follow may be better understood. Additional features and advantages of the embodiments will be described hereinafter which form the subject of the claims of the invention. It should be appreciated by those skilled in the art that the conception and specific embodiments disclosed may be readily utilized as a basis for modifying or designing other structures or processes for carrying out the same purposes of the present invention. It should also be realized by those skilled in the art that such equivalent constructions do not depart from the spirit and scope of the invention as set forth in the appended claims.
For a more complete understanding of the embodiments, and the advantages thereof, reference is now made to the following descriptions taken in conjunction with the accompanying drawings, in which:
The making and using of the embodiments are discussed in detail below. It should be appreciated, however, that the present invention provides many applicable inventive concepts that can be embodied in a wide variety of specific contexts. The specific embodiments discussed are merely illustrative of specific ways to make and use the invention, and do not limit the scope of the invention.
The embodiments will be described in a specific context, namely an OFDMA wireless communications system. The invention may also be applied, however, to other wireless communications systems, wherein there is a need to transmit resource assignment information, such as code division multiple access (CDMA), time division multiple access (TDMA), and frequency division multiple access (FDMA) wireless communications systems.
With reference now to
Exemplary wireless communications systems include Evolved Universal Terrestrial Radio Access (E-UTRA) networks, Ultra Mobile Broadband (UMB) networks, IEEE 802.16 compliant networks, and other OFDMA based networks. For example, the wireless communications network 100 may be a frequency division multiple access (FDMA) network where time-frequency resources may be divided into frequency intervals over time, a time division multiple access (TDMA) network where time-frequency resources may be divided into time intervals over frequency, a code division multiple access (CDMA) network where time-frequency resources may be divided into orthogonal or pseudo-orthogonal codes over time-frequency intervals, or a combination thereof.
The time domain resources (shown in a horizontal (X) axis) may be divided into two portions, denoted as a downlink (DL) and an uplink (UL). The DL may be used by a BS to transmit information to MS and the UL may be used by MS to transmit information to the BS. The DL and the UL may be further divided into a number of OFDM symbols, such as OFDM symbol 320. As shown in
A first OFDM symbol 321 of the DL may be assigned for use as a preamble, which may be used for timing and frequency synchronization by MS. A second OFDM symbol 322 and a third OFDM symbol 323 may be used to transmit control information. A last OFDM symbol 324 of the DL may be used as a guard period to help prevent interference between the DL and the UL.
Shown in a vertical (Y) axis are frequency domain resources. As shown in
As shown in
As shown in
After making an assignment, the scheduler 140 may transmit to the MS an indication (or indicator) of the assignment. As shown in
Each channel tree node may be referred to by its channel tree index or more generally, channel identifier (channel ID). For example, channel tree node 810 may be referred to by its channel tree index of zero (0), while channel tree base node 820 may be referred to by its channel tree index of 14. In some OFDMA communications systems, the channel tree index may correspond to a spreading code, such as spreading codes used in a CDMA OFDMA communications system.
In general, each channel tree base node, such as channel tree base node 820, may correspond to a set of radio resources. A channel tree base node may map to time slots, frequencies, codes, and so forth. The use of a tree structure may help ensure that any assignment of time-frequency resources may be represented as a series of channel tree base nodes. For example, an assignment of channel tree node 3840 may be equivalent to an assignment of channel tree base nodes 7842 and 8843.
Each channel tree node of a channel tree may correspond to a physical time-frequency resource(s). For example, in an OFDMA communications system with 384 useable subcarriers, indexed 0 to 383, with a first channel tree configuration, channel tree node 0 may correspond to subcarriers with indices 0 to 383, channel tree node 1 may correspond to subcarriers with indices 0 to 191 and channel tree node 2 may correspond to subcarriers with indices 192 to 383. While with a second channel tree configuration, channel node 0 may correspond to subcarriers with indices 0 to 383, channel tree node 1 may correspond to subcarriers with indices 0, 2, 4, . . . , 382 and channel tree node 2 may correspond to subcarriers with indices 1, 3, 4, . . . , 383. The mapping of tree channel nodes (logical time-frequency resources) to physical time-frequency resources may change with time and may be different in different zones (sectors). As long as both the BS and the MS is aware of the mapping, any mapping may be possible. The mapping may be stored at the BS and the MS, transmitted to the MS by the BS, determined at the MS based on parameters received from the BS, and so forth. In the IEEE 802.16 standard, the mappings may be referred to as subcarrier permutations.
The second mapping of channel tree base nodes to channel tree nodes (as shown in the list 1120) may be non-orthogonal to the first mapping (as shown in the channel tree 1110). In general, the second mapping may be non-orthogonal to the first mapping if none of the mappings in the second mapping may be represented by a single mapping in the first mapping. The second mapping of channel tree base nodes to channel tree nodes in the second mapping in the list 1120 may have the same number of channel tree nodes as in the first mapping of channel tree base nodes to channel tree nodes. In general, a number of bits used to represent the second mapping of channel tree base nodes to channel tree nodes may be equal to a number of bits used to represent the first mapping of channel tree base nodes to channel tree nodes. Therefore, a number of bits used to represent a combination of the first mapping and the second mapping may only be one more than the number of bits used to represent either the first mapping or the second mapping. For example, as shown in
The structure of the channel tree 1150 may be circular in nature for the rings 1160 and 1165. As illustration, channel tree node 22 of the ring 1160 may correspond to channel tree base node 23 (a lowest numbered channel tree base node) and channel tree base node 30 (a highest numbered channel tree base node). Similarly, channel tree node 14 of the ring 1165 may correspond to channel tree nodes 15 and 22. In general, in a channel tree having an annular tree structure, at least one ring of the channel tree may have a channel tree node that corresponds to channel tree nodes from a next larger ring that are adjacent in a circular manner. For example, channel tree nodes 23 and 30 are not linearly adjacent but are circularly adjacent.
As shown in
In general, a binary annular channel tree, such as the channel tree 1150, may be described using mathematical expressions below:
A number of annular tree base nodes=X,
A number of radix two channel tree nodes=Y.
Y=2ceil(log
A total number of nodes=Z.
Z=4Y−1.
Mappings of channel tree nodes in a binary annular channel tree may be expressed mathematically as:
Assigned channel tree node identifier=w,
If 2Y≦w≦3Y−1 and y=w−2Y, then
w maps to three (3) channel tree base nodes:
{first base node y,
second base node (y+1)mod Y,
third base node (y+2)mod Y}. (1)
If Y≦w≦2Y−1 and y=w−Y, then
w maps to two (2) channel tree base nodes:
{first base node y,
second base node (y+1)mod Y} (2)
If 3Y≦w, then
Step one: node w maps to nodes {Z1,Z2, . . . , Zn} according to binary tree rules, 2Y≦each entry Zi<3Y, i=1 . . . n,
Step two: nodes {Z1,Z2, . . . , Zn} map to channel tree base nodes according to rule (1) above excluding repeated base nodes. (3)
If w<Y, node w maps back to base node w. (4)
As shown in
In order to represent all of the channel tree nodes of the channel tree 1150, five bits may be needed. This may be one bit more than the four bits needed to represent a channel tree, such as the channel tree 800, having the same number of channel tree base nodes. The addition of an additional bit may slightly increase control channel overhead but yield a considerable increase in the flexibility of the assignment of time-frequency resources.
The second mapping of channel tree base nodes to channel tree nodes (as shown in the list 1220) may be non-orthogonal to the first mapping (as shown in the channel tree 1210). The list 1220 includes channel tree nodes 31 through 37 with each channel tree node corresponding to two channel tree base nodes, channel tree nodes 38 through 46 with each channel tree node corresponding to four channel tree base nodes, channel tree nodes 47 through 53 with each channel tree node corresponding to eight channel tree base nodes. The list 1220 also includes channel tree node 54, 55, 56, and 57, which correspond to 7, 6, 5, and 3 channel tree base nodes, respectively. As shown in
A second part may be a bitmap that may be used to address channel tree nodes a specified number of levels beneath the channel tree node specified in the first part, shown in
For example, if the first part of an assignment is three bits long and the second part of the assignment is four bits long, then if the first part of an assignment specifies channel tree node 41430, then the second part of the assignment may specify an assignment for channel tree nodes in grouping 1435. Similarly, if the first part of an assignment specifies channel tree node 21440, then the second part of the assignment may specify an assignment for channel tree nodes in grouping 1445. In general, if the channel tree is of degree K, then with a bitmap of length J, the bitmap (the second part) may be used to specify assignments for nodes LogKJ levels below the channel tree node specified in the first part.
Depending on the length (number of bits) of the bitmap, the lower portion 1420 may encompass different portions of the channel tree 1400. In general, the lower portion 1420 may encompass levels of a channel tree log2J levels below a highest level of the channel tree, where J is the number of bits in the bitmap. Typically, the lower portion 1420 may begin log2J levels below the parent node of the channel tree. For example, if the bitmap is four bits long, then the lower portion 1420 may encompass portions of the channel tree two levels below the highest level of the channel tree and below. As shown in
After making the assignments of the first part and the second part, a BS may transmit the first part and the second part to a MS. At the MS, the MS may use the first part and the second part to decode its time-frequency resource assignment.
It may be possible to change the length of the first part and/or the second part over time to allow a BS to trade-off resource assignment granularity for control channel overhead. For example, if the BS determines that control channel overhead has increased above a threshold, then the BS may elect to shorten the length of the bitmap (the second part) to reduce control channel overhead. The reverse may also be true, wherein the BS may elect to obtain additional control over the granularity of the time-frequency resource assignments by lengthening the length of the bitmap. Lengthening or shortening the length of the second part may have an impact on the length of the first part. It may be possible to increase the length of the second part to a point wherein the bitmap is as long as the number of channel tree base nodes. Alternatively, it may be possible to eliminate the bitmap entirely by shortening it to a length zero (0) sequence.
As shown in
In another embodiment, different channel tree structures may be used to support different types of service, even within a single region. For example, file transfer protocol (FTP) traffic may use a channel tree structure similar to
The assignment message 1610 may also contain an 8-bit channel identifier field 1613, where the channel identifier (also referred to as a channel tree index) may correspond to one of the nodes from a channel tree. The assignment message 1610 may further include a multiple input multiple output (MIMO) field 1615. The MIMO field 1615 may be used to indicate a type of MIMO used by the BS. Additionally, the MIMO field 615 may indicate precoding scheme, antenna configuration, and so forth. Furthermore, the assignment message 1610 may include a four-bit field indicating a modulation and coding field 1616. The modulating and coding field 1616 may provide information regarding the modulating and coding used by the BS. Techniques other than the assignment message 1610 may be used to transmit some or all of the information to the MS. Depending on an embodiment, not all of the discussed parameters may be used, and some parameters may omitted based on values of other parameters.
The sequence of events 1650 may begin when the BS receives a time-frequency resource request (block 1655). As discussed above, the time-frequency resource request may have been received directly from a MS, retrieval of a stored time-frequency resource request, a response to a scheduled request for time-frequency resources, receives data to deliver to the MS, and so forth. The BS may determine if it will service the time-frequency resource request (block 1657). The BS may determine if it will service the time-frequency resource request based on factors including time-frequency resources available for allocation, amount of time-frequency resources requested, MS priority, service type priority, MS communications link quality, and so on. If the BS determines that it will not service the time-frequency resource request, then the sequence of events 1650 may terminate and the BS may return to normal operations.
If the BS determines that it will service the time-frequency resource request, then the BS may make the time-frequency resource assignment (block 1659). The BS may make the time-frequency resource assignment using a scheduler, such as the scheduler 140 (
An indicator of the time-frequency resource assignment (for example, the channel tree index representing the time-frequency resource assignment) may then be transmitted to the MS over a control channel (block 1661). A copy of the channel tree may be stored at the MS or the MS may otherwise have access to the channel tree, so the indicator may be sufficient to convey the time-frequency resource assignment. After transmitting the indicator, the BS may transmit to the MS or the BS may receive from the MS using the assigned time-frequency resources (block 1663). The sequence of events 1650 may then terminate and the BS may return to normal operations.
After determining the set of possible allocatable resources, a member of the set may then be selected and assigned to the resource request (block 1674). The selected member may be a mapping that provides a sufficient amount of time-frequency resources to satisfy the resource request, a mapping that provides a smallest amount of time-frequency resources to satisfy the resource request, a first mapping of the set, and so forth. With the member selected and assigned, an update of allocatable resources may be performed (block 1676). For example, the update of allocatable resources may include marking the time-frequency resources associated with the member as having been assigned and may no longer be available for subsequent assignments (until the assignment completes). With the update complete, the making a resource request assignment may terminate.
The determining of the time-frequency resource assignment for the MS may be based on factors including: MS priority, service type, service priority, bandwidth request amount, available time-frequency resources, communications link quality, amount of bandwidth already assigned to MS, amount of additional bandwidth to be assigned to MS, MS wait time, and so forth. The above listed factors, as well as other factors, may be considered in the determining of the time-frequency resource assignment for the MS. Based on a consideration of various factors, the BS may assign some, all, or none of the MS's request, force the MS to wait, and so on. If the BS makes an assignment of the time-frequency resources, then the BS may transmit an indication of a channel tree index of a channel tree node corresponding to the time-frequency resource assignment to the MS using a control channel (block 1720).
After receiving the channel tree index, the MS may determine a time-frequency resource assignment corresponding to the channel tree index (block 1820). The MS may be able to determine the time-frequency resource assignment by determining a channel tree node corresponding to the channel tree index and from the channel tree node, the MS may be able to determine the time-frequency resources assigned to it. The channel tree may be comprised of one or more channel tree base nodes and a number of channel tree nodes, and the channel tree has two non-orthogonal mappings of channel tree base nodes to channel tree nodes. The MS may need to have knowledge of a channel tree used by the BS as it made its time-frequency resource assignment. This may be accomplished by having a copy of the channel tree stored at the MS. Alternatively, the MS may have a number of channel trees stored and the channel tree used by the BS in its time-frequency resource assignment may be indicated by one or more of the following factors: traffic type, region permutation, and so forth. After determining the time-frequency resource assignment (block 1820), the MS may receive a packet from the BS or transmit a packet to the BS using physical time-frequency resources that correspond to logical time-frequency resources associated with the channel tree node assigned to the MS (block 1830).
The MS may then process the bitmap received from the BS (block 2030). The MS may determine channel tree nodes specified to be active by the bitmap received from the BS. The channel tree nodes may be at a number of levels below the channel tree node corresponding to the channel tree index, wherein the number of levels may be dependent on a length of the bitmap. The MS may then determine an assignment of time-frequency resources as made by the BS in the form of the channel tree index and the bitmap (block 2040). After determining the time-frequency resource assignment (block 2040), the MS may receive a packet from the BS or transmit a packet to the BS using physical time-frequency resources that correspond to logical time-frequency resources associated with the channel tree node assigned to the MS (block 2050).
The BS 110 may include a processor 2305 that may be used to process signals to be transmitted and/or signals received. The processor 2305 may also be used to execute applications, etc. For example, the processor 2305 may execute applications that may be needed to coordinate transmissions by MS in communications with the BS 110. This may help maximize radio resource sharing while minimizing transmission collisions, errors, and so on. Depending on embodiment, the processor 2305 may be implemented as several different processors, such as a digital baseband processor and/or a general purpose processor. The processor 2305 may store data, information, applications, and so forth, in a memory 2310. The processor 2305 may provide data to be transmitted to a transmitter 2315 that may process the data for transmission, which may include encoding, spreading, mixing, filtering, interleaving, and so forth. The data processed for transmission may then be provided to a front-end unit 2320, which may include filters, duplexers, transmit/receive switches, signal amplifiers, and so forth. An antenna (or antennas) 2325 may then transmit the data over-the-air.
In addition to transmitting the data, the antenna 2325 may also receive data. Depending on embodiment, separate antennas may be used for transmission and reception, or the antenna 2325 may be shared. Received data detected by the antenna 2325 may be provided to the front-end unit 2320 where it may be filtered, amplified, and so on. A receiver 2330 may then be provided the received signal, wherein the receiver 2330 may process the received signal to produce data usable by the processor 2305. The receiver 2330 may be used to perform operations such as error detection and correction, filtering, despreading, down-conversion, and so forth.
The scheduler 140 may also include a resource selector unit 2410. The resource selector unit 2410 may select a channel tree node corresponding to one or more channel tree base nodes that fulfill the time-frequency resource request. The resource selector unit 2410 may select the channel tree node from information provided by the resource manager 2405. The resource selector unit 2410 may use techniques to help attain performance goals, such as reduce fragmentation of the time-frequency resources, maximize time-frequency resource utilization, utilization of available bandwidth, maximize a number of MS time-frequency resource requests, minimize time-frequency resource request wait time, and so forth. Attaining some of the above listed goals may make it not possible to attain some of the other listed goals. The resource selector unit 2410 may have the capability of selecting which goals to maximize.
The scheduler 140 may also include a channel tree update unit 2415. The channel tree update unit 2415 may be used to update the state of the channel tree based on assignments of time-frequency resources made by the resource selector unit 2410. For example, if the resource selector unit 2410 assigns a channel tree node, then the channel tree update unit 2415 may mark the channel tree node as being assigned, thereby preventing the resource manager 2405 from selecting the channel tree node as a possible assignment to satisfy a time-frequency resource request.
The resource manager 2405, the resource selector 2410, and the channel tree update unit 2415 may be coupled to a memory 2420. The memory 2420 may be used to store the channel tree, possible assignments that satisfy a time-frequency resource request, current time-frequency resource assignments, current time-frequency resource assignment expiration times, additional channel trees that may be used by the BS, and so forth.
Although the embodiments and their advantages have been described in detail, it should be understood that various changes, substitutions and alterations can be made herein without departing from the spirit and scope of the invention as defined by the appended claims. Moreover, the scope of the present application is not intended to be limited to the particular embodiments of the process, machine, manufacture, composition of matter, means, methods and steps described in the specification. As one of ordinary skill in the art will readily appreciate from the disclosure of the present invention, processes, machines, manufacture, compositions of matter, means, methods, or steps, presently existing or later to be developed, that perform substantially the same function or achieve substantially the same result as the corresponding embodiments described herein may be utilized according to the present invention. Accordingly, the appended claims are intended to include within their scope such processes, machines, manufacture, compositions of matter, means, methods, or steps.
This application claims the benefit of U.S. Provisional Application No. 60/955,183, filed Aug. 10, 2007, entitled “Method and Apparatus for Flexibly Assigning Resources in a Wireless System,” which application is hereby incorporated herein by reference. This application is related to the following co-assigned patent application: Ser. No. 12/135,599, filed Jun. 6, 2008, entitled “Method and Apparatus for Assigning Resources in a Wireless System,” which application is hereby incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
6351459 | Kondo | Feb 2002 | B1 |
6377572 | Dolan et al. | Apr 2002 | B1 |
6404325 | Heinrich et al. | Jun 2002 | B1 |
6597919 | Kumar et al. | Jul 2003 | B1 |
6907246 | Xu et al. | Jun 2005 | B2 |
7116240 | Hyde | Oct 2006 | B2 |
7215251 | Hyde | May 2007 | B2 |
7706323 | Stopler et al. | Apr 2010 | B2 |
20020082021 | Chen et al. | Jun 2002 | A1 |
20030221012 | Herrmann et al. | Nov 2003 | A1 |
20040145454 | Powell et al. | Jul 2004 | A1 |
20050201269 | Shim et al. | Sep 2005 | A1 |
20050233754 | Beale | Oct 2005 | A1 |
20050281228 | Oh et al. | Dec 2005 | A1 |
20060039274 | Park et al. | Feb 2006 | A1 |
20060109865 | Park et al. | May 2006 | A1 |
20060133312 | Harrison Teague et al. | Jun 2006 | A1 |
20060209754 | Ji et al. | Sep 2006 | A1 |
20060293076 | Julian et al. | Dec 2006 | A1 |
20070058523 | Cho et al. | Mar 2007 | A1 |
20070060178 | Gorokhov et al. | Mar 2007 | A1 |
20070076670 | Kuchibhotla et al. | Apr 2007 | A1 |
20070097910 | Ji et al. | May 2007 | A1 |
20070129708 | Edwards et al. | Jun 2007 | A1 |
20070206561 | Son et al. | Sep 2007 | A1 |
20070217370 | Soong et al. | Sep 2007 | A1 |
20070230412 | McBeath et al. | Oct 2007 | A1 |
20070274288 | Smith et al. | Nov 2007 | A1 |
20070275728 | Lohr et al. | Nov 2007 | A1 |
20070286066 | Zhang et al. | Dec 2007 | A1 |
20070291708 | Rao | Dec 2007 | A1 |
20080004029 | Moilanen | Jan 2008 | A1 |
20080025247 | McBeath et al. | Jan 2008 | A1 |
20080025337 | Smith et al. | Jan 2008 | A1 |
20080034274 | Song et al. | Feb 2008 | A1 |
20080037496 | Smith et al. | Feb 2008 | A1 |
20080062936 | He et al. | Mar 2008 | A1 |
20080062944 | Smith et al. | Mar 2008 | A1 |
20080080422 | Frederiksen et al. | Apr 2008 | A1 |
20080080423 | Kolding et al. | Apr 2008 | A1 |
20080084843 | Gorokhov et al. | Apr 2008 | A1 |
20080146241 | Das et al. | Jun 2008 | A1 |
20080192847 | Classon et al. | Aug 2008 | A1 |
20080240034 | Gollamudi | Oct 2008 | A1 |
20080268785 | McCoy | Oct 2008 | A1 |
20080310363 | McBeath | Dec 2008 | A1 |
20090022098 | Novak et al. | Jan 2009 | A1 |
20090029710 | Ochiai et al. | Jan 2009 | A1 |
20090047912 | Lee et al. | Feb 2009 | A1 |
20090070650 | Bourlas et al. | Mar 2009 | A1 |
20090075667 | Bourlas | Mar 2009 | A1 |
Number | Date | Country |
---|---|---|
1219306 | Jun 1999 | CN |
1360446 | Jul 2002 | CN |
1115899 | Jul 2003 | CN |
1536794 | Oct 2004 | CN |
1728695 | Feb 2006 | CN |
1780188 | May 2006 | CN |
1968452 | May 2007 | CN |
1968453 | May 2007 | CN |
101031130 | Sep 2007 | CN |
101102142 | Jan 2008 | CN |
1 786 220 | May 2007 | EP |
WO 9837706 | Aug 1998 | WO |
WO 2006001658 | Jan 2006 | WO |
WO 2006096887 | Sep 2006 | WO |
WO 2008099577 | Sep 2006 | WO |
WO 2006113873 | Oct 2006 | WO |
WO 2006137708 | Dec 2006 | WO |
WO 2007033997 | Mar 2007 | WO |
WO 2009067955 | Jun 2009 | WO |
Entry |
---|
“Medium Access Control Layer for Ultra Mobile Broadband (UMB) Air Interface Specification,” 3rd Generation Partnership Project 2, 3GPP2 C.S0084-002-0, Version 2.0, Aug. 2007, 314 pages, Third Generation Partnership Project 2 (3GPP2), Arlington, VA. |
McBeath, S., et al., “Efficient Signaling for VoIP in OFDMA,” 2007 Wireless Communications and Networking Conference, Mar. 11-15, 2007, 6 pages, IEEE. |
McBeath, S., et al., “Efficient Bitmap Signaling fo VoIP in OFDMA,” 2007 Vehicular Technology Conference, Sep. 30-Oct. 3, 2007, 5 pages, IEEE. |
Bourlas, Y., et al., “Persistent Allocation Updated Procedures,” IEEE 802.16 Broadband Wireless Access Working Group, IEEE P802.16Rev2/D4, Apr. 19, 2008, pp. 1-50, IEEE. |
Written Opinion of the International Searching Authority, App. No. PCT/CN2008/071325, Date of mailing: Sep. 18, 2008, 5 pages. |
Written Opinion of the International Searching Authority, App. No. PCT/CN2008/071317, Date of mailing: Sep. 18, 2008, 4 pages. |
First Chinese Office Action, Chinese Application No. 200880001172.3, Dated: Jul. 1, 2010, 6 pages. |
Second Chinese Office Action, Chinese Application No. 200880001172.3, Dated: Feb. 28, 2011, 9 pages. |
Third Chinese Office Action, Chinese Application No. 200880001172.3, Jun. 15, 2011, 9 pages. |
“Text Proposal for Downlink OFDMA Resource Allocation and Mapping Rules for Distributed Mode Users in E-UTRA, with Discussion on Control Information,” 3GPP TSG RAN WG1 #45, R1-061149, May 8-12, 2006, pp. 1-8. |
Classon, B.K., et al., U.S. Appl. No. 60/888,833, filed Feb. 8, 2007, the specification and drawings, 40 pages. |
“Technical Specification Group Radio Access Network; Physical Layer Aspects for Evolved UTRA (Release 7),” 3rd Generation Project, 3GPP TR 25.814, V1.3.1, May 2006, pp. 6-11. |
International Search Report and Written Opinion received in PCT Application No. PCT/CN2008/071316, mailed Sep. 25, 2008, 13 pages. |
First Chinese Office Action and Translation received in Chinese Patent Application No. 200880100578.7, mailed Mar. 16, 2012, 22 pages. |
First Chinese Office Action and Partial Translation received in Chinese Application No. 200880001601.7, mailed Apr. 25, 2012, 11 pages. |
“Part 16: Air Interface for Fixed Broadband Wireless Access Systems,” Air Interface for Fixed Broadband Wireless Access Systems, IEEE P802, 16-REVd.D5, May 2004, pp. 7-12. |
Written Opinion of the International Searching Authority, received in PCT Application No. PCT/CN2008/071943, mailed Nov. 20, 2008, 5 pages. |
Written Opinion of the International Searching Authority, received in PCT Application No. PCT/CN2008/073221, mailed Mar. 5, 2009, 3 pages. |
International Search Report of the International Searching Authority received in PCT Application No. PCT/CN2008/073221, mailed Mar. 5, 2009, 2 pages. |
Second Office Action with partial English translation received in Chinese Application No. 200880100578.7, mailed Dec. 5, 2012, 29 pages. |
Third Chinese Office Action with Partial English translation received in Chinese Application No. 200880100578.7 mailed May 3, 2013, 17 pages. |
Number | Date | Country | |
---|---|---|---|
20090042581 A1 | Feb 2009 | US |
Number | Date | Country | |
---|---|---|---|
60955183 | Aug 2007 | US |