Field of the Invention
This invention relates to frame structures for communication systems and more particularly to frame structures for adaptive modulation wireless communication systems.
Description of Related Art
A wireless communication system facilitates two-way communication between a plurality of subscriber units (fixed and portable) and a fixed network infrastructure. Exemplary communication systems include mobile cellular telephone systems, personal communication systems (PCS), and cordless telephones. The key objective of these wireless communication systems is to provide communication channels on demand between the plurality of consumer subscriber units and their respective base stations in order to connect the subscriber unit user with the fixed network infrastructure.
Subscriber units typically communicate through a terminal with the base station using a “duplexing” scheme thus allowing the exchange of information in both directions of connection. Transmissions from the base station to the terminals are commonly referred to as “downlink” transmissions. Transmissions from the terminals to the base station are commonly referred to as “uplink” transmissions. In wireless systems having multiple access schemes a time “frame” is used as the basic information transmission unit.
Depending upon the design criteria of a given system, systems have typically used either time division duplexing (TDD) or frequency division duplexing (FDD) methods to facilitate the exchange of information between the base station and the terminals. In a TDD communication system, the base station and the terminals use the same channel, however, their downlink and uplink transmissions alternate one after the other to prevent interference. In a FDD communication system, the base station and the terminals use different channels for their downlink and uplink transmissions, respectively. Thus, the concern for interference between uplink and downlink transmissions is mitigated in a FDD communication system as compared to a system using TDD. However, the increased cost and complexity in deploying a FDD communication system often outweighs this obvious advantage over a TDD communication system.
In both TDD and FDD systems, each base station and terminal includes a modem configured to modulate an outgoing signal and demodulate an incoming signal. If the modem is configured to modulate and demodulate simultaneously, the modem is a “full-duplex” modem. If the modem is not configured to modulate and demodulate simultaneously, but rather switches between modulating and demodulating, the modem is a “half-duplex” modem.
In an exemplary FDD communication system, each terminal's modem operates simultaneously to transmit and receive information in a full-duplex manner. Such a terminal can continually receive data from the base station. By continually receiving information, the terminal is able to maintain its synchronization with the base station. By maintaining its synchronization, the terminal is less dependent on the base station transmitting control information and preambles to assist the terminal in locating its data within the downlink.
Because a half-duplex terminal does not receive information from the base station when the terminal transmits it uplink to the base station, it may fall out of synchronization with the base station. When this occurs, the terminal may require the base station to downlink additional control information or a preamble to allow the terminal to re-synchronize prior to it receiving downlink data from the base station.
The systems and methods have several features, no single one of which is solely responsible for its desirable attributes. Without limiting the scope as expressed by the claims which follow, its more prominent features will now be discussed briefly. After considering this discussion, and particularly after reading the section entitled “Detailed Description” one will understand how the features of the system and methods provide several advantages over traditional framing techniques.
One aspect is a frequency division duplexing (FDD) wireless communication method for use by a base station, at least one full-duplex terminal, and at least one half-duplex terminal, wherein the base station transmits using a downlink subframe on a first channel and the full-duplex and half-duplex terminals transmit using an uplink subframe on a second channel, wherein the downlink subframe includes a broadcast preamble, a time division multiplex (TDM) portion, and a Time Division Multiple Access (TDMA) portion, and wherein the TDMA portion includes at least one modulation/forward error correction (PHY) mode with an associated preamble, both of which are intended for the at least one half-duplex terminal. The method comprises transmitting a broadcast preamble from a base station to a full-duplex terminal and a half-duplex terminal during a downlink subframe on a first channel, synchronizing the full-duplex terminal and the half-duplex terminal to the base station based on the broadcast preamble, transmitting modulated data from the half-duplex terminal to the base station during an uplink subframe on a second channel, and transmitting modulated data from the base station to the full-duplex terminal during a TDM portion of the downlink subframe on the first channel after the full-duplex terminal is synchronized with the base station. The method further includes transmitting a preamble by the base station during a TDMA portion of the downlink subframe on the first channel, wherein the preamble is transmitted after the half-duplex terminal has transmitted its modulated data to the base station, re-synchronizing the half-duplex terminal with the base station based on the preamble transmitted by the base station on the first channel.
Another aspect is a system for a frequency division duplexing (FDD) wireless communication system including a base station, at least one full-duplex terminal, and at least one half-duplex terminal, wherein the base station transmits using a downlink subframe on a first channel and the full-duplex and half-duplex terminals transmit using an uplink subframe on a second channel, wherein the downlink subframe includes a broadcast preamble, a time division multiplex (TDM) portion, and a Time Division Multiple Access (TDMA) portion, and wherein the TDMA portion includes at least one modulation/forward error correction (PHY) mode with an associated preamble, both of which are intended for the at least one half-duplex terminal. The system comprises at least one half-duplex terminal configured to alternate between transmitting on a first channel and receiving on a second channel, at least one full-duplex terminal configured to transmit on the first channel while receiving on the second channel, and a base station configured to transmit a broadcast preamble to the half-duplex terminal and the full-duplex terminal during a TDM portion of a downlink subframe and to transmit a preamble during a TDMA portion of the downlink subframe, wherein the half-duplex terminal synchronizes with the base station based on the broadcast preamble and re-synchronizes with the base station based on the preamble.
Still another aspect is a method for scheduling modulation/forward error correction (PHY) modes for a frequency division duplex (FDD) communication system which includes a plurality of terminals and a base station, both configured to communicate using adaptive modulations in a downlink subframe and an uplink subframe, with each of the plurality of terminals having an associated preferred downlink PHY mode, D1, D2, . . . DN, wherein D1 is a most robust modulation and DN is a least robust modulation, and wherein each of the plurality of terminals and their associated preferred downlink PHY mode have an associated uplink PHY mode, U1, U2, UN, and wherein U1 is associated with the plurality of terminals that have the preferred downlink PHY mode D1, and wherein UN is associated with the plurality of terminals that have the preferred downlink PHY mode DN, such that a number of downlink map entries does not exceed 2N+1. The method comprises grouping the plurality of terminals based on preferred downlink PHY modes, allocating uplink bandwidth in an uplink subframe such that the plurality of terminals are put in order of their preferred downlink PHY modes, from a second most robust preferred downlink PHY mode and continuing in order of decreasing robustness with a most robust preferred downlink PHY mode last, allocating the plurality of terminals that use a D1 PHY mode to begin at a start of a downlink subframe, and if a time duration for the plurality of terminals that have a DN PHY mode is less than a time duration for the plurality of terminals that are assigned to a UN+1 PHY mode, allocating bandwidth of the downlink subframe to the plurality of terminals that use the DN PHY mode, beginning at a time that a UN PHY mode ends. The method further includes that if the time duration for the plurality of terminals that have the DN PHY mode is greater than or equal to the time duration for the plurality of terminals that are assigned to the UN+1 PHY mode, allocating bandwidth of the downlink subframe to the plurality of terminals that use the DN PHY mode, beginning at an end of a DN−1 PHY mode, if the time duration of the plurality of terminals that have the DN PHY mode is longer in duration than a combined time duration of a U1 PHY mode and gaps that are not aligned with the UN PHY mode, rearranging downlink bandwidth of the downlink subframe to accommodate a remainder of the DN PHY mode such that the remainder is not aligned with the UN PHY mode, and if the time duration of the plurality of terminals that have the DN PHY mode is shorter in duration than the combined time duration of the U1 PHY mode and the gaps that are not aligned with the UN PHY mode, allocating bandwidth of the downlink subframe to the plurality of terminals that use the DN PHY mode, beginning at the end of the DN−1 PHY mode and also interleaved in the gaps in the downlink subframe.
Still other aspects include methods and systems for use in a TDD communication system to support the implementation of smart antennae.
The following detailed description is directed to certain specific embodiments of the invention. However, the invention can be embodied in a multitude of different systems and methods. In this description, reference is made to the drawings wherein like parts are designated with like numerals throughout.
The systems and methods described herein can also be implemented in a Multichannel Multi-point Distribution Service (MMDS) which operates below 10 GHz. In the MMDS, Orthogonal Frequency Division Multiplexing (OFDM) symbols may be transmitted between the base station and terminals as an alternative to QAM modulation. In such a system, the methods and systems are applied to one or more of the OFDM subchannels.
The PHY mode(s) selected for use in the cell 10 is normally determined as a function of the geographical relationship between the BS and the terminal, the rain region, and the implementation or modem complexity of the terminals. However, the selection of a single PHY mode based on the lowest bit per symbol rate modulation scheme and maximum FEC supported by all terminals may not optimize bandwidth utilization within the cell 10. In particular, better environmental conditions, e.g., less distance, between some terminals (such as units 38, 30 for example) and the BS may permit the use of a less robust PHY mode that has an error level below the maximum desirable error level.
Frame 80 includes a plurality of time blocks. The total time duration of the plurality of time blocks in frame 80 can vary. For example, time durations of 0.5 msec, 1 msec, and 2 msec could be used. In this example there are ten time blocks where the first through fifth time blocks are for a downlink subframe 83. The downlink subframe contains downlink data 82(a)-82(n) (from the base station 10 to one or more terminals). The sixth through tenth time blocks form an uplink subframe 85. The uplink subframe contains uplink data 84(a)-84(n) (to the base station 10 from one or more terminals). Data within a single time block is transmitted or received using a single PHY mode.
In this example, each downlink subframe time block has a different PHY mode, e.g. DM1, DM2, DM3, and DM4. The data transmitted using each downlink PHY mode is intended for one or more terminals. The receiving terminal will retrieve data that was transmitted using its preferred PHY mode and/or a more robust PHY mode. Many terminals may be assigned to any one downlink PHY mode where each terminal retrieves its data during the same time block based on an address or identifier. Consequently, a terminal may only retrieve data from a portion of a time block.
Still referring to
The length, or duration, of each time block can vary. The PHY modes used for the data in each time block can also vary for each downlink and uplink time block between frames. Varying the time duration of the uplink and downlink time blocks, PHY modes, is generally useful, since uplink and downlink data amounts are likely to vary. The TDD frame structure may apply adaptive PHY modes only for the downlink and use a different scheme for the uplink. For example, a fixed modulation scheme could be used for the uplink. Conversely, a different scheme (e.g. fixed modulation) can be used on the downlink, while using adaptive PHY modes on the uplink.
A scheduling approach is used to arrange data from terminals within the frame 80. An uplink scheduling approach may be selected independently from the downlink scheduling approach. The uplink/downlink scheduling approaches may be based on physical layer issues, including interference minimization, propagation delays (including round trip delays), etc., as well as modulation use (specific ordering by PHY mode). Alternatively, the uplink/downlink scheduling approaches may be based completely on data traffic requirements and not on physical layer issues.
One downlink scheduling approach arranges the PHY modes such that DM1 (most robust)≦DM2≦DM3≦DM4 (least robust). Thus, the data in the downlink subframe is arranged from the most robust PHY mode to the least robust PHY mode. Each terminal listens to its preferred PHY mode and any PHY modes that are more robust than its preferred PHY mode. The terminals receive all of the data they are capable of receiving, and can keep or discard portions of the data depending on whether the data is intended for them. By using this scheduling approach, each terminal is able to maintain its synchronization with the base station from the start of the downlink subframe, through PHY modes that are more robust than its preferred PHY mode, and finally during its preferred PHY mode.
The uplink scheduling information may be conveyed to the terminals by a map through control data 86. The control data 86 may be located at the start of the downlink subframe 83. The control data 86 can indicate where the PHY mode transitions occur within the frame 80. A typical map is a list of time indicators pointing out transmission location (such as by referencing start and end, or start and length, or offsets relative to a previous transmission). The map can also include terminal identification associating the map entry with a specific terminal. The control data 86 can be encoded using the most robust PHY mode of the system. An exemplary downlink map is discussed below with reference to
Still referring to
The downlink subframe 83 transmits the control data 86 along with downlink data 82 intended for one or more terminals. Downlink data symbols 81 are used for transmitting data to the terminals. The symbols may be grouped by the PHY mode, terminal identification, and user ID. For example, symbols 81 are grouped by PHY mode, DM2. Thus, the symbols 81 destined for terminals that are scheduled to receive during DM2 were modulated using the same PHY mode. Once grouped by PHY modes, each time block is transmitted in a pre-defined modulation sequence using a scheduling approach as previously discussed. For example, DM1 is QAM-4, DM2 is QAM-16, DM3 is QAM-64, and DM4 is QAM-256. In any downlink subframe 83, any one or more of the PHY modes may be absent.
The data transmitted during frame 80 is in the form of symbols 81. Communication systems that operate using the LMDS band map Quadrature Amplitude Modulation (QAM) symbols to each time block of frame 80. Alternatively, communication systems that operate using the MMDS band do the same or may map Orthogonal Frequency Division Multiplexing (OFDM) symbols to each time block of frame 80.
Padding may be added to a MAC message to form an integer multiple of TDUs 1206. For example,
The PI elements 1202 are then modulated using a modulation scheme to form symbols 81. For example, QAM symbols or OFDM symbols could be used. The number of symbols 81 required to transmit the PI elements 1202 may vary with the PHY mode selected. For example, if QAM-4 is used for DM2, each resulting symbol represents two bits. If QAM-64 is used for DM2, each resulting symbol represents six bits. For convenience, multiple symbols can be further mapped to a physical slot (PS) to decrease the granularity of the data allocation boundaries. For example, a 4-symbol physical slot could be used to decrease the number of bits required to express allocation boundaries in maps.
Then, the M-ary QAM modulator converts the FEC blocks into QAM symbols based on the selected bit per symbol rate for each time block. The symbols can then be inserted into the frame 80 using a scheduling technique. Up-converter 49 frequency shifts the packed frame of data to a frequency suitable for transmission between a terminal and base station based on schemes known to those of skill in the art.
Referring now to
In the FDD frame structure 90, the uplink and the downlink operation may or may not be synchronized. For example, a frame start and a frame end, hence frame length, may be identical, or not, depending on the specific implementation. The FDD frame structure may apply adaptive modulation only for the downlink and use a different scheme for the uplink. For example, a fixed modulation scheme could be used for the uplink. Conversely, a different scheme (e.g. fixed modulation) can be used on the downlink, while using adaptive modulation on the uplink.
To prevent a conflict from occurring, the terminal's uplink transmission (Tx) event 110 is preferably not scheduled at the same time as its downlink event 112. However, the terminal may lose synchronization with the base station during its uplink Tx event 110 and be unable to re-synchronize prior to the base station transmitting its downlink event 112. The loss of synchronization may become more problematic in a communication system that includes multiple terminals restricted to half-duplex operation. For example, in a case where all of the terminals in an FDD communication system operate in a half-duplex fashion, time gaps may occur in a frame during a downlink or uplink. Such time gaps may constitute a significant part of that portion of the frame to which such a terminal's use is restricted.
The downlink subframe structure shown in
Each terminal synchronizes and picks up control data 114, including uplink and downlink mapping information, at the beginning of every downlink subframe 94. The uplink map defines when the next uplink Tx event 110 will occur for each terminal in the uplink subframe 92. Similarly, the downlink map is used by terminals to determine when downlink events 112 will occur in the downlink subframe 94. For example, a downlink map entry can indicate when the downlink subframe will transmit data with a specific PHY mode.
Uplink and downlink events can contain data associated with more than one user of the terminal. Higher layer addressing may be applied to determine specific associations of user data. The downlink map entry is not required to contain terminal identification information. Instead, a terminal which ended its uplink transmission and is available for downlink reception can use the downlink map to determine the next event which is relevant for it, that is, the next event that uses its preferred PHY mode, i.e. modulation parameters and FEC, which correspond to its settings. This mapping information will be further explained with reference to
Each downlink subframe 124 can include a frame control header 125 and downlink data 121. The frame control header 125 can include a preamble 126, PHY control information 127, and media access control (MAC) information 128. The preamble 126 is used for synchronizing the terminals with the base station. For example, preamble 126 allows the terminals to synchronize with the base station at the beginning of the downlink subframe 124. The preamble can be transmitted using a robust PHY mode. A robust PHY mode allows terminals that are configured for receiving only robust modulation schemes to demodulate the preamble and synchronize with the base station.
The PHY control information 127 can include a downlink map 123. The downlink map 123 indicates to the terminals where and what modulation changes occur in the downlink data 121. An exemplary downlink map 123 is discussed below with reference to
The MAC control information 128 provides terminals with instructions on transmission protocols for the uplink subframe. These instructions can include an uplink map 129. The uplink map 129 is a map of a subsequent uplink subframe that is to be transmitted by the terminals.
To minimize errors in the mapping process, the base station transmits the downlink map and the uplink map using a robust PHY mode. Moreover, the base station can allocate a minimum number of symbols for the TDM portion 122 to accommodate the time required for the terminals to process and act upon the first downlink map entry. The downlink map 123 is the first information broadcast to the terminals in a downlink subframe to maximize the amount of time between receiving the downlink map and when the first terminal is required to act based on the downlink map. All other control information 125, including the uplink map 129, can come after the broadcast of the downlink map 123.
A full-duplex terminal, and any half-duplex terminal that receives later than it transmits within a frame, can take advantage of the TDM portion 122 of the downlink subframe 121. Thus, the downlink data 124 starts with a TDM portion 122. Additionally, to increase statistical multiplexing gain, it should be noted that full-duplex terminals are also able to re-synchronize with the base station in the TDMA portion 120 to receive data. Accordingly, the downlink subframe 124 is constructed with a TDM portion 122 followed by a TDMA portion 120. The downlink map 123 for a pure TDMA downlink subframe would have the same number of map entries as the TDM/TDMA downlink subframe of
The exemplary downlink map 123 of
Full-duplex terminals and half-duplex terminals that receive before they transmit could both use TDMA. The order of the PHY modes within the downlink subframe 150 could be varied. Each terminal would still receive a broadcast preamble 126 from the base station which would indicate when their preamble 106 would be transmitted by the base station. The use of a smart antenna would increase the gain of the received signal at the terminal. However, some bandwidth would be lost due to the addition of preambles and map entries.
A TDD communication system could also use the design of the TDMA downlink subframe 150 to incorporate a base station smart antenna. In the TDD communication system, only one channel is used for uplinks and downlinks. The terminals do not lose synchronization between the broadcast preamble 126 and the transmission of their data. Thus, if the PHY modes are ordered in the downlink and broadcast to an entire cell without a smart antenna, the terminals are able to maintain their synchronization. By incorporating a smart antenna at the base station, the terminals within the cell will lose synchronization. However, the use of a TDMA downlink subframe 150 and its preambles 106 as described above would allow the terminals to resynchronize with the base station prior to receiving their data.
When building an FDD communication system, full-duplex terminals are more efficiently served by a TDM downlink. Half-duplex terminals, however, are better served by a TDMA downlink. However, in communication systems where both full and half-duplex terminals exist, scheduling the downlink and uplink transmission opportunities for the half-duplex terminals is non-trivial, since these terminals cannot transmit and receive simultaneously. Some half-duplex terminals may be scheduled to receive before they transmit. In this case, the base station can transmit downlink data to such half-duplex terminals in the TDM portion, since these terminals get synchronization from the preamble at the beginning of the downlink subframe. However, some half-duplex terminals are unable to be scheduled to transmit after they receive their data. Such terminals would lose the synchronization as they transmit, because they complete the transmission in the middle of the downlink subframe and hence have no preamble to use to synchronize their receiver to the base station.
One solution is to schedule the downlink data transmissions of these half-duplex terminals in a TDMA portion. This allows the terminals to receive the preamble at the beginning of the TDMA burst for receiver synchronization. Although this approach resolves the problem of half-duplex terminal receiver synchronization, each burst in the TDMA portion requires a DIUC message. The number of DIUC or map entries may grow if the number of TDMA bursts increases, wasting bandwidth for actual data transmission. Furthermore uplink maps are typically built only one frame ahead of time. Therefore, it is not possible to know the size of the downlink data for those half-duplex terminals in order to properly schedule the downlink data reception before transmission.
Scheduling Algorithm
A scheduling algorithm will now be described to allow TDM and TDMA portions of a downlink to co-exist in the same downlink subframe. The algorithm allows maximum flexibility and efficiency for FDD communication systems that must simultaneously support full and half-duplex terminals. The algorithm further allows the TDM of multiple terminals in a TDMA burst to minimize the number of map entries in a downlink map. The algorithm limits the number of downlink map entries to (2×n)+1, where n is the number of PHY modes. The algorithm works for pure TDMA downlinks (see
Algorithm Description
First, all terminals are grouped together by the modulation/FEC (PHY mode) in which they receive downlink data. The number of groups formed will be equal to the number of PHY modes being used for downlink in the communication system. Uplink bandwidth is allocated to the terminals such that the uplink transmission opportunities of terminals belonging to the same group are kept contiguous in time.
Within these groupings, the uplink bandwidth allocated to an individual terminal is contiguous in time. The groups themselves can be ordered in a particular order to maximize the TDM portion of the downlink. To avoid the problem of scheduling the downlink and uplink transmission simultaneously in time for the terminals within the same group, the downlink data of the first group is scheduled first to overlap with the uplink bandwidth of the next group to be allocated. This proceeds until all the downlink data has been allocated.
Notations used in the Scheduling Algorithm
n: the number of downlink (DL) PHY modes (e.g. FEC-type/Modulation combinations) used by system.
Sn: set of DL PHY modes, where PHY mode j, is more robust (comes earlier in the downlink TDM section) than DL PHY mode j+1, jεSn.
Uj: total amount of uplink bandwidth, in symbols (or in time, in an asymmetric FDD system), allocated for all terminals that receive downlink data using DL PHY mode j, where jεSn.
Dj: total amount of downlink bandwidth, in symbols (or in time, in an asymmetric FDD system), allocated for all terminals that receive downlink data using DL PHY mode j, where jεSn.
T: total amount of bandwidth, in symbols (or in time, in an asymmetric FDD system), available on the downlink channel.
uk: total amount of uplink bandwidth, in symbols (or in time, in an asymmetric FDD system), allocated for an individual terminal, k.
dk: total amount of downlink bandwidth, in symbols (or in time, in an asymmetric FDD system), allocated for an individual terminal, k.
System Constraints
The worst case scheduling is the case where all terminals are half-duplex.
For a half duplex terminal k, dk+uk≦T.
There can only be one j, such that Dj+Uj≧T.
Worst case is when
(The link is full, both uplink and downlink).
The following description is shown for the case when n=5. Those skilled in the art will understand that the algorithm may readily be extended to any value of n.
Flow continues to a state 1360 where the terminal group identified as Dj, j=1, is allocated downlink bandwidth at the start of the downlink subframe. Next, at a decision state 1380, the process determines whether D1≧U2. If D1≧U2 then flow continues to a state 1400 were the scheduling algorithm allocates downlink bandwidth for D1 at the start of the downlink subframe. This is shown in
Flow continues to a decision block 1420 to determine whether D1+U1≧T. If D1+U1≧T, the process continues to a state 1440 where D1 is arranged such that an individual terminal's bandwidth does not overlap on the uplink and downlink, even while guaranteeing that the downlink map will not exceed 2n+1. In this case there must be more than one terminal represented by D1.
Returning to decision block 1420, if D1+U1≧T is not true, then the process continues to a state 1460 where the downlink scheduling becomes easier since U2 will not be transmitting while receiving. Subsequent allocations of downlink bandwidth are placed adjacent to the prior allocations. For example, D2 is placed next to D1 in
Returning to decision block 1380, if D1<U2, then the process moves to a state 1480 where the scheduling algorithm allocates downlink bandwidth for D1 at the start of the downlink subframe. This is shown in
Flow continues to a decision block 1500 where a determination is made whether D2<U3. If D2<U3 is not true, flow continues to state 1460 where the downlink scheduling becomes easier since U3 will not be transmitting while receiving. Subsequent allocations of downlink bandwidth are placed adjacent to the prior allocations. For example, D3 is placed next to D2.
Returning to decision block 1500, if D2<U3, flow continues to a state 1520 where the scheduling algorithm allocates downlink bandwidth for D2 at the end of the uplink bandwidth that was allocated for U2. In this case, once the half-duplex terminal assigned to U2 finishes its uplink transmission, it will begin receiving its downlink transmission during D2 from the base station. A gap in the downlink subframe is left between D1 and D2. This is shown in
Next, at decision block 1540, a determination is made whether D3>U4+U5+U1. If D3>U4+U5+U1 is true, the process continues to a state 1560 where D3 is broken into multiple pieces. The pieces are then inserted in the remaining gaps in the downlink subframe. This is shown in
Returning to decision block 1540, if a determination is made that D3>U4+U5+U1 is not true, flow continues to decision block 1580 where a determination is made as to whether D3<U4. If D3<U4 is not true, the process returns to state 1460 where the downlink scheduling becomes easier since U4 will not be transmitting while receiving.
Returning to decision block 1580, if D3<U4, the process moves to a state 1600 where D3 is allocated a portion of the downlink subframe beginning from the end of U3. A gap in the downlink subframe is left between D2 and D3. This is shown in
Next at decision block 1620, a determination is made whether D4<U5. If D4<U5 is not true, the process returns to state 1460 where the scheduling is easier. D4 is placed at the end of its assigned uplink U4, so that D4 will downlink once it finishes receiving its uplink, U4. Subsequent allocations of downlink bandwidth are placed adjacent to the prior allocations. For example, D5 is placed next to D4.
Returning to decision block 1620, if D4<U5, the process continues to a state 1640 where D4 is placed at the end of U4. This is shown in
Returning to decision block 1660, if the last downlink segment D5 is shorter in duration than U1 and all remaining fragments excluding any fragment that is aligned with U5, then the process moves to a state 1700 where D5 is placed at the end of D4 and interleaved in the gaps in the downlink subframe. No subsequent rearrangement is required. The foregoing algorithm ensures that the number of map entries will not exceed 2n+1. However, after employing the algorithm, under many circumstances further rearrangement of the downlink will be possible to further reduce the number of downlink map elements below 2n.
While the above detailed description has shown, described, and pointed out novel features as applied to various embodiments, it will be understood that various omissions, substitutions, and changes in the form and details of the device or process illustrated may be made by those skilled in the art without departing from the spirit. The scope is indicated by the appended claims rather than by the foregoing description. All changes which come within the meaning and range of equivalency of the claims are to be embraced within their scope.
This application is a continuation of U.S. patent application Ser. No. 13/903,712 filed May 28, 2013, which is a continuation of U.S. patent application Ser. No. 13/427,692 filed Mar. 22, 2012, now U.S. Pat. No. 8,462,673, which is a continuation of U.S. patent application Ser. No. 12/035,549 filed Feb. 22, 2008, now U.S. Pat. No. 8,165,046, which is a continuation of U.S. patent application Ser. No. 11/674,548 filed Feb. 13, 2007, now U.S. Pat. No. 7,379,441, which is a divisional of U.S. patent application Ser. No. 09/991,532 filed Nov. 15, 2001, now U.S. Pat. No. 7,197,022, titled “Framing For An Adaptive Modulation Communication System” which claims priority to a U.S. provisional patent application Ser. No. 60/249,065, filed Nov. 15, 2000, titled “Framing For an Adaptive Modulation Communication System,” all of which are hereby incorporated by reference in their entirety.
Number | Name | Date | Kind |
---|---|---|---|
3949404 | Fletcher et al. | Apr 1976 | A |
4495619 | Acampora | Jan 1985 | A |
4931250 | Greszczuk | Jun 1990 | A |
4975906 | Takiyasu et al. | Dec 1990 | A |
5130983 | Heffner | Jul 1992 | A |
5157395 | Del Signore et al. | Oct 1992 | A |
5297144 | Gilbert et al. | Mar 1994 | A |
5402422 | Liu | Mar 1995 | A |
5404374 | Mullins et al. | Apr 1995 | A |
5420851 | Seshadri et al. | May 1995 | A |
5444698 | Kito | Aug 1995 | A |
5457687 | Newman | Oct 1995 | A |
5511082 | How et al. | Apr 1996 | A |
5517503 | Hess | May 1996 | A |
5533004 | Jasper et al. | Jul 1996 | A |
5548541 | Bierman et al. | Aug 1996 | A |
5602868 | Wilson | Feb 1997 | A |
5615212 | Ruszczyk et al. | Mar 1997 | A |
5638371 | Raychaudhuri et al. | Jun 1997 | A |
5638374 | Heath | Jun 1997 | A |
5666358 | Paratore et al. | Sep 1997 | A |
5675573 | Karol et al. | Oct 1997 | A |
5684791 | Raychaudhuri et al. | Nov 1997 | A |
5706428 | Boer et al. | Jan 1998 | A |
5751708 | Eng et al. | May 1998 | A |
5764699 | Needham et al. | Jun 1998 | A |
5768254 | Papadopoulos et al. | Jun 1998 | A |
5774461 | Hyden et al. | Jun 1998 | A |
5809427 | Perreault et al. | Sep 1998 | A |
5818842 | Burwell et al. | Oct 1998 | A |
5828695 | Webb | Oct 1998 | A |
5844906 | Khelghatti et al. | Dec 1998 | A |
5859619 | Wu et al. | Jan 1999 | A |
5859848 | Miura et al. | Jan 1999 | A |
5890055 | Chu et al. | Mar 1999 | A |
5909469 | Frodigh et al. | Jun 1999 | A |
5912920 | Marchok | Jun 1999 | A |
5918171 | Funke et al. | Jun 1999 | A |
5946313 | Allan et al. | Aug 1999 | A |
5963543 | Rostoker et al. | Oct 1999 | A |
5970062 | Bauchot | Oct 1999 | A |
5987034 | Simon et al. | Nov 1999 | A |
6006069 | Langston | Dec 1999 | A |
6011786 | Dent | Jan 2000 | A |
6016311 | Gilbert et al. | Jan 2000 | A |
6016313 | Foster, Jr. et al. | Jan 2000 | A |
6016401 | Rostoker et al. | Jan 2000 | A |
6026133 | Sokoler | Feb 2000 | A |
6031827 | Rikkinen et al. | Feb 2000 | A |
6038455 | Gardner et al. | Mar 2000 | A |
6094421 | Scott | Jul 2000 | A |
6112080 | Anderson et al. | Aug 2000 | A |
6125148 | Frodigh et al. | Sep 2000 | A |
6128293 | Pfeffer | Oct 2000 | A |
6147989 | Esaki et al. | Nov 2000 | A |
6151318 | Woodward et al. | Nov 2000 | A |
6163547 | De Vriendt et al. | Dec 2000 | A |
6167031 | Olofsson et al. | Dec 2000 | A |
6175550 | van Nee | Jan 2001 | B1 |
6188680 | Ohki | Feb 2001 | B1 |
6189041 | Cox et al. | Feb 2001 | B1 |
6201811 | Larsson et al. | Mar 2001 | B1 |
6201813 | Klausmeier et al. | Mar 2001 | B1 |
6208873 | Black et al. | Mar 2001 | B1 |
6233231 | Felix et al. | May 2001 | B1 |
6252865 | Walton et al. | Jun 2001 | B1 |
6330278 | Masters | Dec 2001 | B1 |
6339585 | Hulyalkar et al. | Jan 2002 | B1 |
6351499 | Paulraj et al. | Feb 2002 | B1 |
6359934 | Yoshida | Mar 2002 | B1 |
6366961 | Subbiah et al. | Apr 2002 | B1 |
6370112 | Voelker | Apr 2002 | B1 |
6392994 | Dubuc | May 2002 | B1 |
6400755 | Harris et al. | Jun 2002 | B1 |
6452927 | Rich | Sep 2002 | B1 |
6452964 | Yoshida | Sep 2002 | B1 |
6463107 | Lindoff et al. | Oct 2002 | B1 |
6469991 | Chuah | Oct 2002 | B1 |
6483854 | Klausmeier et al. | Nov 2002 | B1 |
6493342 | Breslow et al. | Dec 2002 | B1 |
6496142 | Iinuma | Dec 2002 | B1 |
6549759 | Arviv et al. | Apr 2003 | B2 |
6567383 | Bohnke | May 2003 | B1 |
6587510 | Minami | Jul 2003 | B1 |
6608841 | Koodli | Aug 2003 | B1 |
6631130 | Roy et al. | Oct 2003 | B1 |
6665292 | Bradshaw et al. | Dec 2003 | B1 |
6665296 | Sturza et al. | Dec 2003 | B1 |
6671328 | Poon et al. | Dec 2003 | B1 |
6674731 | Bradshaw et al. | Jan 2004 | B1 |
6683866 | Stanwood et al. | Jan 2004 | B1 |
6697364 | Kekki et al. | Feb 2004 | B1 |
6701129 | Hashem | Mar 2004 | B1 |
6711176 | Pezeshki-Esfahani | Mar 2004 | B1 |
6721286 | Williams et al. | Apr 2004 | B1 |
6741614 | Porter et al. | May 2004 | B1 |
6747977 | Smith et al. | Jun 2004 | B1 |
6760599 | Uhlik | Jul 2004 | B1 |
6771660 | Bourlas et al. | Aug 2004 | B1 |
6785252 | Zimmerman et al. | Aug 2004 | B1 |
6804251 | Limb et al. | Oct 2004 | B1 |
6862622 | Jorgensen | Mar 2005 | B2 |
6870932 | Jiang | Mar 2005 | B2 |
6907048 | Treadaway et al. | Jun 2005 | B1 |
6918034 | Sengodan et al. | Jul 2005 | B1 |
6925068 | Stanwood et al. | Aug 2005 | B1 |
6931030 | Dogan | Aug 2005 | B1 |
6940823 | Park et al. | Sep 2005 | B1 |
6944672 | Crow et al. | Sep 2005 | B2 |
6963751 | Kordsmeyer et al. | Nov 2005 | B1 |
6967936 | Laroia | Nov 2005 | B1 |
6968554 | Macdonald et al. | Nov 2005 | B1 |
6970941 | Caronni et al. | Nov 2005 | B1 |
7006525 | Jha | Feb 2006 | B1 |
7006526 | Biederman | Feb 2006 | B1 |
7020715 | Venkataraman et al. | Mar 2006 | B2 |
7031281 | Zhang | Apr 2006 | B1 |
7050407 | Frazer et al. | May 2006 | B1 |
7061935 | Roy et al. | Jun 2006 | B1 |
7068639 | Varma et al. | Jun 2006 | B1 |
7085291 | Zhang et al. | Aug 2006 | B2 |
7197022 | Stanwood et al. | Mar 2007 | B2 |
7230931 | Struhsaker | Jun 2007 | B2 |
7260405 | Kim et al. | Aug 2007 | B2 |
7321569 | Takagi et al. | Jan 2008 | B2 |
7433334 | Marjelund et al. | Oct 2008 | B2 |
7443814 | Agarwal et al. | Oct 2008 | B2 |
7471620 | Alazraki et al. | Dec 2008 | B2 |
7551937 | Kim et al. | Jun 2009 | B2 |
7570645 | Agarwal | Aug 2009 | B2 |
7583623 | Zimmerman | Sep 2009 | B2 |
8619719 | Wengerter et al. | Dec 2013 | B2 |
20010015985 | Van Grinsven | Aug 2001 | A1 |
20010048681 | Bilic et al. | Dec 2001 | A1 |
20020016852 | Nishihara | Feb 2002 | A1 |
20020089984 | Jiang | Jul 2002 | A1 |
20020090005 | Jiang | Jul 2002 | A1 |
20020126677 | Hathaway et al. | Sep 2002 | A1 |
20020136170 | Struhsaker | Sep 2002 | A1 |
20030045307 | Arviv et al. | Mar 2003 | A1 |
20030125040 | Walton | Jul 2003 | A1 |
20030169722 | Petrus | Sep 2003 | A1 |
20040132459 | Varma | Jul 2004 | A1 |
20050100120 | Barton | May 2005 | A1 |
20050220110 | Agarwal | Oct 2005 | A1 |
20060062250 | Payne, III | Mar 2006 | A1 |
20060262808 | Lin | Nov 2006 | A1 |
20080081651 | Kuroda | Apr 2008 | A1 |
20110075684 | Zeng et al. | Mar 2011 | A1 |
Number | Date | Country |
---|---|---|
0507384 | Jul 1998 | EP |
0891060 | Jan 1999 | EP |
0845916 | Mar 2005 | EP |
0622924 | Dec 2006 | EP |
0944200 | Jun 2009 | EP |
0720405 | Feb 2011 | EP |
H11266231 | Sep 1999 | JP |
9222162 | Dec 1992 | WO |
9713388 | Apr 1997 | WO |
9810568 | Mar 1998 | WO |
9939532 | Aug 1999 | WO |
9938343 | Sep 1999 | WO |
0001188 | Jan 2000 | WO |
Entry |
---|
IEEE 802.16.1mc-00/21r1 Broadband Wireless Access Working Group, Media Access COntrol Layer Proposal for the 802.16.1 Air Interface Specification, Jul. 7, 2000. |
Wolf et al., “On the Weight Distribution of Linear Block Codes Formed From Convolutional Codes”, IEEE, IEEE Transactions on Communications, vol. 44: Sep. 9, 1996, 4 pages. |
U.S. District Court, Northern District of California, “Amended Complaint for Declaratory Judgement Demand for Jury Trial” filed Sep. 30, 2008 in Case No. 5:08-cv-4555, 20 pages. |
Ulm et al., “Data-Over-Cable Interface Specifications, Radio Frequency Interface Specification”, Hewlett Packard Interim Specification, Doc. Control No. SP-RFII01-970321, published Mar. 21, 1997 by MCNS Holdings, L.P. Section 6, pp. 43-85. |
Ue et al., “Symbol Rate and Modulation Level Controlled Adaptive Modulation/TDMA/TDD for Personal Communication Systems, Proceedings of the Vehicular Technology Conference, U.S.,” New York, IEEE, vol. Conf. 45, Jul. 25, 1995, pp. 306-310. |
Sater et al. “Media Access Control Layer Proposal for the 802.16.1 Air Interface Specification.” IEEE 802.16 Broadband Wireless Access Working Group, Online! Jul. 7, 2000, XP002210334 retrieved from the Internet: <URL: http://wirelessman.org/tgl/mac/contrib/802161mc-00.sub.1321rl.pdf> retrieved Aug. 20, 2002, pp. 69-80. |
Redl, et al., “An Introduction to GSM”, Artech House, Inc., 1995, pp. 84-85 and 95. |
Andersen, et al., “Prediction of Future Fading Based on Past Measurements, Vehicular Technology Conference,” VTC 99, vol. 1, p. 151-155. |
Bender et al., “CDMA/HDR: A Bandwidth Efficient High-Speed Wireless Data Service for Nomadic Users,” Communications Magazine, IEEE, vol. 38, No. 7, Jul. 2000, pp. 70-77. |
Cable Television Laboratories, Inc., “Data-Over-Cable Service Interface Specifications DOCSIS 1.1, Radio Frequency Interface Specification”, 1999-2005. |
Pons et al., “Bit Error Rate Characterisation and Modelling for GSM,” IEEE 1998, pp. 3722-3727. |
Dutton et al., “Asynchronous Transfer Mode (ATM) Technical Overview,” 2.sup.nd Edition, Prentice Hall Oct. 1995, Chap. 3, pp. 21-25. |
Papadopoulos et al., “Reduction of Mixed Co-channel Interference in Microcellular STDD Systems”, Vehicular Technology Conference, 1995 IEEE 45.sup.th, vol. 2, pp. 759-763. |
Office Action issued in U.S. Appl. No. 09/430,379 on Jan. 30, 2003, 10 pages. |
Notice of Allowance for U.S. Appl. No. 09/430,379 issued on Jul. 28, 2003, 3 pages. |
Narlikar et al., “Designing Multihop Wireless Backhand Networks with Delay Guarantees,” Bell labs, 2005 12 pages. |
International Preliminary Examination Report for PCT/US00/29687 dated Dec. 18, 2001, 8 pages. |
International Search Report for PCT/US00/20577 dated Apr. 5, 2001, 5 pages. |
Sampei et al., “Adaptive Modulation/TDMA Scheme for Personal Multi-Media Communication System,” Proceedings of the Global Telecommunications Conference, U.S., New York, IEEE, Nov. 28, 1994, pp. 989-993. |
International Search Report for PCT/US00/29687 dated Mar. 28, 2001, 3 pages. |
International Search Report for PCT/US01/43582 dated Aug. 30, 2002, 3 pages. |
Jain, P., “On the Impact of Channel and Channel Quality Estimation on Adaptive Modulation,” Dec. 2002, 92 pages. |
Torrance et al., “Upper Bound Performance of Adaptive Modulation in a Slow Rayleigh Fading Channel,” IEEE Electronics Letters vol. 32, p. 718-719, Apr. 1996. |
Shannon, C.E., “A Mathematical Theory of Communication”, Bell System Technical Journal, pp. 379-423 (Part 1), 623-656 (Part 2), Jul. 1948. |
Lee, L.H. Charles, “Convolutional Coding, Fundamentals and Applications”, Artech House, Inc., 1997, p. 11-51. |
Lin et al., “Error Control Coding, Fundamentals and Applications”, Prentice-Hall Computer Applications in Electrical Engineering Series, 1993, pp. 315-349. |
Matsuoka et al. “Adaptive Modulation System with Variable Coding Rate Concatenated Code for High Quality Multi-Media Communication Systems.” Apr. 28, 1996. IEEE. pp. 487-491. |
Number | Date | Country | |
---|---|---|---|
20150365927 A1 | Dec 2015 | US |
Number | Date | Country | |
---|---|---|---|
60249065 | Nov 2000 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 09991532 | Nov 2001 | US |
Child | 11674548 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13903712 | May 2013 | US |
Child | 14835471 | US | |
Parent | 13427692 | Mar 2012 | US |
Child | 13903712 | US | |
Parent | 12035549 | Feb 2008 | US |
Child | 13427692 | US | |
Parent | 11674548 | Feb 2007 | US |
Child | 12035549 | US |