1. 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.
2. Description of Related Art
A wireless communication system facilitates two-way communication between a plurality of customer premises equipment (“CPE”) and a network infrastructure. Exemplary systems include mobile cellular telephone systems, personal communication systems (PCS), and cordless telephones. The objective of these wireless communication systems is to provide communication channels on demand between the users connected to a CPE and a base station in order to connect the user of a CPE with a network infrastructure (usually a wired-line system). In multiple access wireless schemes, the basic transmission unit is commonly frames of time. The frames are commonly divided into a plurality of time slots. The time slots of the frames may hold different kinds of data including control data and user information or data. In order to manage the use of the time slots of a frame, the time slots may be assigned or allocated to one or more CPEs. In this case, a CPE receiving or having an allocation of time slots may parse the allocation of the slots between one or more users associated with the CPE. CPEs typically communicate with a base station using a “duplexing” scheme that allows for the exchange of information in both directions of connection. In this scheme, the time slots of each frame may be allocated to data being transmitted from a base station to CPEs and to data being transmitted from CPEs to a base station.
Transmissions from a base station to a CPE are commonly referred to as “downlink” transmissions. Transmissions from a CPE to a base station are commonly referred to as “uplink” transmissions. Prior art wireless communication systems typically employ time division duplexing (TDD) to facilitate the exchange of information between base stations and CPEs where TDD is well known in the art. In TDD systems, duplexing of transmissions between a base station and associated CPEs is performed in the time domain. Further, the CPEs typically communicate with their associated base station with signals having a specific pre-defined radio frequency. In TDD systems, the bandwidth or channel of the signal is time-divided into frames having repetitive time periods or time “slots”. The time slots are employed for uplink and downlink transmissions between the base station and associated CPEs.
When a wireless system is implemented in a region, the region is commonly divided into cells with a base station located within each cell. Each base station in a cell of the wireless system ideally provides communication between CPEs located in the cell. The size or configuration of a cell is generally determined as a function of the physical location of the base station, the location of buildings and other physical obstructions within the cell. The maximum bit per symbol rate modulation scheme that may be employed with a cell may be limited due to channel interference and the implementation or modem complexity of CPEs within the cell. Channel interference may occur between adjacent time slots assigned to different CPEs within a cell due to distortion of signals between the base station in the cell and the CPEs. The signals are commonly distorted by destructive multi-path replication of the signals (where the signals are reflected off physical objects in the cell). In addition, the signals are commonly distorted by atmospheric conditions (such as rain). Thus, in order to have duplex communications between all CPEs associated with a base station in a cell, a modulation scheme having a bit per symbol rate that enables communication between all CPEs associated with the base station is selected.
It is noted, however, that the channel interference between CPEs and a base station varies for each CPE, e.g., as a function of the physical barriers between the base station and the CPE. Consequently, the maximum bit per symbol rate modulation scheme (i.e., having acceptable error rates given the channel interference) that may be used to communicate between each CPE and the base station may vary. In addition, the implementation or modem complexity of the CPEs associated with the base station may also vary where some CPEs may be able to support higher bit per symbol rate modulation schemes than others associated with the base station. Accordingly, the selection of one low bit per symbol rate modulation scheme for all CPEs where some CPEs may support a higher bit per symbol rate modulation in a cell may not maximize bandwidth utilization. The use of different or variable bit per symbol rate modulation schemes for different CPEs associated with a cell may increase bandwidth utilization. Unfortunately, variable bit per symbol rate modulation is not used for communication between base stations and associated CPEs due to its complexity. In particular, variable bit per symbol rate modulation schemes normally require complex CPE demodulators where some CPEs may already have limited implementation or modem complexity. The need thus exists for frame structures and frame construction techniques that enable variable bit per symbol rate modulation for CPEs and base stations within a cell that does not increase the complexity of CPEs. The present invention provides such a frame structure and frame construction techniques.
The present invention includes a method that orders or assigns downlink time slots based on the complexity of the modulation data to be stored in the downlink time slots. Preferably, the downlink time slots are sorted from the least complex modulation scheme to the most complex modulation scheme. In one embodiment, the method assigns portions of at least two downlink time slots to at least two receiving units where the modulation scheme employed by the at least two units may vary. The method first determines the complexity of the modulation scheme employed by the at least two units. Then the method assigns portions of the at least two time slots to the at least two units based on the complexity of the modulation scheme they employ. As noted, ideally, portions of the at least two downlink time slots are assigned from the least complex modulation scheme to the most complex modulation scheme. In other embodiments, the method may first order the at least two units as a function of the complexity of the modulation scheme they employ. Then this method may assign portions of the at least two time slots based on the order of the at least two units.
The method may further order uplink time slots of a frame based on the complexity of the modulation data to be stored in the uplink time slots. Preferably, the uplink time slots are also sorted from the least complex modulation scheme to the most complex modulation scheme. In one embodiment, the method assigns at least two uplink time slots to at least two transmitting units where the modulation scheme employed by the at least two transmitting units may vary. The method first determines the complexity of the modulation scheme employed by the at least two transmitting units. Then the method assigns the at least two time slots to the at least two transmitting units based on the complexity of the modulation scheme they employ. As noted, ideally, the at least two uplink time slots are assigned from the least complex modulation scheme to the most complex modulation scheme. In other embodiments, the method may first order the at least two transmitting units as a function of the complexity of the modulation scheme they employ. Then this method may assign the at least two uplink time slots based on the order of the at least two transmitting units.
The present invention also includes a method that orders downlink time slots based on the bit per symbol rate of the modulation scheme employed to generate the data to be stored in the downlink time slots. Preferably, the downlink time slots are sorted from the lowest bit per symbol rate modulation scheme to the highest bit per symbol rate modulation scheme. In one embodiment, the method assigns portions of at least two downlink time slots to at least two receiving units where the bit per symbol rate modulation scheme employed by the at least two units may vary. The method first determines the bit per symbol rate of the modulation schemes employed by the at least two units. Then the method assigns portions of the at least two time slots to the at least two units based on the bit per symbol rate modulation schemes they employ. As noted, ideally, portions of the at least two downlink time slots are assigned from the lowest bit per symbol rate to the highest bit per symbol rate. In other embodiments, the method may first order portions of the at least two units as a function of the bit per symbol rate of the modulation schemes they employ. Then this method may assign portions of the at least two time slots based on the order of the at least two units.
The method may further order uplink time slots of a frame based on the bit per symbol rate of the modulation scheme employed to generate the data to be stored in the uplink time slots. Preferably, the uplink time slots are also sorted from the lowest bit per symbol rate to the highest bit per symbol rate. In one embodiment, the method assigns at least two uplink time slots to at least two transmitting units where the bit per symbol rate of the modulation scheme employed by the at least two transmitting units may vary. The method first determines the bit per symbol rate of the modulation scheme employed by the at least two transmitting units. Then the method assigns the at least two time slots to the at least two transmitting units based on the bit per symbol rate of the modulation scheme they employ. As noted, ideally, the at least two uplink time slots are assigned from the lowest bit per symbol rate modulation scheme to the highest bit per symbol rate modulation scheme. In other embodiments, the method may first order the at least two transmitting units as a function of the bit per symbol rate modulation scheme they employ. Then this method may assign the at least two uplink time slots based on the order of the at least two transmitting units.
The present invention also includes a method of determining the encoding Ld bits of data into a frame. The frame has a time length T and the frame is transmitted at a baud rate R. The method first determines the maximum fixed bit per symbol rate of modulation for the Ld bits of data. Then the method adds x error code bits where (R*T*Bi)/(Ld+x) is an integer where Bi is the bit per symbol rate of the modulation scheme employed. It is noted that x may have a minimum value based on a minimum block error rate. Further, the x error code bits may be Reed-Solomon encoded error bits. In other embodiments, the method may determine the maximum bit per symbol rate, Bi of modulation scheme for the Ld bits of data. Then the method may add x error code bits where (R*T*Bi)/(Ld+x) is an integer.
In a further embodiment, the method first selects a convolution ratio where the selected convolution ratio adds y convolution bits to the Ld bits of data after the convolution encoding of the Ld bits of data. Then the method adds x error code bits where (R*T*Bi)/(Ld+x+y) is an integer. It is noted that in this method the convolution ratio may be modified so that (R*T*Bi)/(Ld+x+y) is an integer. In addition, the number of x error bits may be selected so that (R*T*Bi)/(Ld+x+y) is an integer.
The present invention also includes a method for determining the modulation scheme of a frame having a plurality of downlink time slots where one of the plurality of downlink slots contains control information. In this method the modulation scheme employed to generate the modulated data for the plurality of downlink time slots may vary for each of the plurality of downlink slots. In addition, the frame may be transmitted to a plurality of units where each of the plurality of units may support a modulation scheme having a maximum complexity. This method first determines the lowest modulation complexity supported by each of the plurality of units. Then the method sets the modulation complexity of the downlink slot of the plurality of downlink slots that contains control information to the determined lowest modulation complexity.
In this method, the downlink slot of the plurality of downlink slots that contains control information may be the first downlink slot in time order of the plurality of downlink slots. In addition, the method may also determine the complexity of the modulation scheme employed to generate the modulated data for at least two units of the plurality of units. Then the method may assign at least two time slots of the plurality of time slots to the at least two units based on the complexity of the modulation scheme employed to generate the modulated data for the at least two units. The assignment to the at least two units may be from the least complex modulation scheme to the most complex modulation scheme.
The present invention also includes a method for setting the values of weights of finite impulse response filter. In this case, the filter receives symbols having variable modulation rates and stores a plurality of the symbols where each stored symbol has a corresponding weight. The method first determines when a first symbol is received having a modulation rate different than the last stored symbol. Then the method changes the value of the weight that corresponds to the first symbol based on the modulation rate of the first symbol. The method may further include receiving a second symbol having a modulation rate the same as the modulation rate of said first symbol. Followed by changing the value of the weight that corresponds to the first symbol based on the modulation rate of the first symbol. More generally, the method changes the value of the weights that correspond to the first symbol based on the modulation rate of the first symbol as the first symbol propagates through the filter.
The details of the preferred and alternative embodiments of the present invention are set forth in the accompanying drawings and the description below. Once the details of the invention are known, numerous additional innovations and changes will become obvious to one skilled in the art.
Like reference numbers and designations in the various drawings indicate like elements.
Throughout this description, the preferred embodiment and examples shown should be considered as exemplars, rather than as limitations on the present invention.
The present invention includes an improved frame structure and a process of generating a frame structure for use in wireless communication systems employing adaptive modulation. Adaptive modulation includes varying the bit per symbol rate modulation scheme or modulation complexity of signals transmitted between a CPE and a base station as a function of channel interference of the signals or implementation or modem complexity of the CPE.
As described above, the maximum bit per symbol rate modulation scheme or technique or most complex modulation scheme selected for use in the cell 10 is normally determined as a function of the channel interference between CPEs and the implementation or modem complexity of the CPEs. As also described above, the selection of a single maximum bit per symbol rate modulation technique based on the lowest bit per symbol rate modulation scheme supported by all CPEs may not optimize bandwidth utilization within the cell 10. In particular, lower channel interference between some CPEs (such as units 38, 30 for example), may permit the use of a higher bit modulation technique or more complex modulation scheme that has an error level below the maximum desirable error level. Adaptive bit-rate modulation or variable bit-rate modulation between different CPEs, however, usually requires complex transmitters and receivers in the CPEs where the CPEs may already have limited implementation or modem complexity.
As noted above, the frame structure is divided into a plurality of downlink and uplink slots. Each downlink time slots may be used to store data to be received by a number of users where a user identifies their data by an address or other label. Uplink time slots are commonly assigned to individual users for transmission of data from the user to another user or system via the base station. To maximize bandwidth utilization and minimize modulator complexity in the base station and associates CPEs, the present invention simplifies the configuration of data to inserted into the time slots. Briefly, data blocks are ideally parsed into an integer number of time slots. This process is described in detail below with reference to
In addition, the uplink slots have a modulation bit per symbol rate of UM1, UM2, UM3, and UM4 where the four uplink time slots are commonly assigned to four CPEs where the CPEs will insert data in these slots based on their respective assignment. It is noted that in some embodiments a CPE may be assigned more than one uplink slot. Further, downlink control information may be located at the start of the downlink time slots and an unreserved time slot may be located at the beginning of the uplink time slots. It is obviously desirable that any CPE associated a cell be able to retrieve data located in the downlink control information time slot regardless of the CPE's location within the cell. In addition, each CPE should be able to insert data into the unreserved uplink time slot.
As described above, in an adaptive bit per symbol rate modulation system the modulation scheme may vary for each CPE and thus for each downlink and uplink time slot. In order to minimize the complexity of CPEs and base stations employed in such a system and reduce the number modulation scheme transitions within a frame, the present invention requires that DM1≦DM2≦DM3≦DM4 and UM1≦UM2≦UM3≦UM4. Thus, ideally, the data in the time slots is arranged from the least complex modulation scheme to the most complex modulation scheme. As noted, this technique reduces the number of modulation transitions, which may simplify the implementation of a base station using this frame structure 80. Note this also enables the base station and CPEs to train on the least complex data, which may lower error rates.
Further, ideally the downlink control information is ideally encoded using the least complex modulation scheme of the system and the information placed in the unreserved uplink time slot is also encoded using the least complex modulation scheme of the system. This ensures that every CPE associated with the cell will be able to receive or encode information within desirable error levels. Ideally, the control information indicates where the modulation transitions occur within the frame. An exemplary process 90 of assigning time slots of frame 80 as shown in
As shown in
In a preferred embodiment, Binary Phase Shift Keying (“BPSK”) modulation may be selected for the least complex modulation scheme. In BPSK, the bit per symbol rate, BI of the modulation scheme is one, i.e., each symbol represents one bit. BI could also be called the modulation scheme efficiency, i.e., how efficient the scheme encodes data. A Quadrature Amplitude Modulation (QAM) of four may be used for an intermediate modulation scheme. In QAM 4, the bit per symbol rate, BI of the modulation scheme is two, i.e., each symbol represents two bits. Higher quadrature amplitude modulations may be used for more complex modulation schemes, e.g., QAM 64 where the bit per symbol rate, BI of the modulation scheme is six, i.e., each symbol represents six bits. The modulation complexity or bit per symbol rate modulation scheme may be modified from frame to frame or remain constant for a plurality of frames for a particular CPE. Further, a CPE may select or indicate a desired modulation complexity or scheme.
Upon determination of the modulation complexity or bit per symbol rate modulation scheme to be used to encode data for each of the CPEs, in step 96 the CPEs are sorted in ascending order based on the selected modulation complexity or bit per symbol rate modulation scheme, i.e., from the lowest bit per symbol rate modulation scheme to the highest bit per symbol rate modulation scheme or least complex modulation scheme to the most complex modulation scheme. Finally, the time slots of a frame are allocated or assigned to the CPEs in their sorted order from the lowest bit per symbol rate modulation scheme to the highest bit per symbol rate modulation scheme or from the least complex modulation scheme to the most complex modulation scheme. As noted above, frames are constructed using this process to reduce the complexity of base stations and CPEs that insert or retrieve data therefrom. It is noted that even though modulation schemes may vary from CPE to CPE, the number of symbols to be transmitted in bursts is usually fixed to a predetermined number n×S for all CPEs regardless of their modulation scheme.
It is desirable to simplify the configuration of time slots given fixed bursts of a group of symbols n×S and variable modulation schemes. It is noted that the modulation of L bits generates a fixed number of symbols S where S=(L/B1) and B1 is the bits per symbol rate of the modulation scheme. To simplify time slot usage and bandwidth management, (L/B1) or S is ideally an integer multiple of length of the time slot Ts times the baud rate R of the frame. Thus, ideally L bits fit into an integer number of time slots Ts based on the modulation scheme. Note each frame has a fixed number of time slots where the length of the frame (and thus the number of time slots) is determined a function of a maximum desirable delay TD between signal transmissions and the baud rate R (symbols transmitted per second) of the system. Accordingly for each frame the number of symbols transmitted is equal to TD*R. It is desirable that the number of symbols n×S or (L/B1) is an integer multiple of the number of symbols transmitted per frame. Thus, it is desirable that the ratio (TD*R)/(L/B1) is an integer. When the ratio (TD*R)/(L/B1) is an integer then a fixed number of bursts of n×S symbols may be transmitted in each frame. This may simplify frame usage and bandwidth management.
In most systems, the L bits of data represent an encoded signal that includes overhead or Forward Error Correction (“FEC”) information where only LD of the L bits are pure data to be transmitted to a unit or base station. In these systems the number of data bits LD to be transmitted in a burst may be fixed, e.g., 256, 512, or 1024 bits. The FEC information commonly includes convolutional encoding bits and block codes including error correction encoding bits such as Reed-Solomon (RS(n,k)) data. In other embodiments, the convolutionally encoded data may also be interleaved prior to error encoding. Given that TD, R, and S are fixed due to system constraints and B1 is selected as a function of channel interference and modem or implementation complexity, L is ideally modified to simplify the time slot configuration or the bandwidth management of a frame. As noted, LD may also be fixed in a system. In such a system L would be determined for each possible modulation scheme of the system.
As shown in
At step 72, the value of the ratio Z of (TD*R)/(L/BI) is determined. The baud rate R is fixed, the delay TD was determined at step 62, B1 is determined at step 64, and L is determined as function of the parameters selected at steps 66 and 68. When it is determined at step 74 that the ratio Z is not integer, a different convolutional ratio (at step 66) or the error code level (at step 68) may be selected. In a preferred embodiment, the selection of the convolutional ratio and the error code level is varied as a function of the fractional remainder of the ratio Z, i.e., a convergence algorithm may be employed. As noted above, in some embodiments the convolution ratio is fixed to 1. In such embodiments, only the error code or block code level is modified. In order to ensure that the ratio Z is an integer, the number of bits used to generate the block code of data may be greater than necessary to meet the minimum BER. When at step 74, the ratio Z is determined to be an integer, then the process is complete and the block of L bits is optimized or simplified for the modulation scheme or bit per symbol rate B1.
A transmitter 40 and receiver 50 that may employed to transmit and receive frames of data in accordance with the present invention is presented with reference to
Then, the M-ary modulator converts the L bits of data into the n×S symbols based on the selected bit per symbol rate B1. Due to the selection of the convolution ratio and error code level, the n×S symbols can be inserted into an integer number of times slots of a frame. The frame constructor 48 ideally inserts the n×S symbols into time slots of a frame based on the process presented with reference to
The receiver 50 shown in
The techniques and systems presented above may be modified while still falling within the scope of the appended claims. For example, symbol shaping may also be employed in a preferred embodiment to avoid spectrum spillage due to possible abrupt changes in modulation schemes in a frame as described above. Symbol shaping is commonly accomplished by filtering the n×S symbols via a Finite Impulse Response (“FIR”) filter where an exemplary prior art FIR filter 60 is shown in
It is noted that different modulation schemes, such as different QAM schemes (QAM-4, QAM-16, QAM-64) employ different “alphabets” to represent the x symbols of the scheme. For example, QAM-4 has four different symbols, QAM-16 has sixteen different symbols and QAM-64 has sixty-four different symbols. In addition, different modulation schemes may have different gains that are applied to the symbols for transmission due to varying back-off requirements. In prior art variable modulation systems when the modulation scheme changes, the memory of the FIR filter is not normally reset while the weights W0 to Wk are instantly changed to weights optimized for the modulation scheme or symbols of the scheme to prevent spectrum spillage.
This solution is not ideal, however, because the weights are then not optimized for the symbols in the memory (taps 62) of the filter that correspond to the previous modulation scheme or rate. One solution is to employ one set of weights for all modulation schemes. This solution is also not ideal, however, since the FIR filter is then not optimized for the alphabet of symbols for each modulation scheme. To prevent spectrum spillage and optimize the FIR filter 60, the present invention changes the filter taps sequentially with each new symbol from the new modulation scheme as shown in
Accordingly, it is to be understood that the invention is not to be limited by the specific illustrated embodiment, but only by the scope of the appended claims.
This application is a continuation of U.S. patent application Ser. No. 12/395,347, filed Feb. 27, 2009; which is a continuation of U.S. application Ser. No. 10/962,957 filed Oct. 12, 2004, now issued as U.S. Pat. No. 7,519,023 issued on Apr. 14, 2009; which is a divisional of U.S. application Ser. No. 09/365,917 filed Aug. 3, 1999, now issued as U.S. Pat. No. 6,804,211 issued on Oct. 12, 2004, all of which are incorporated herein 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, III | Jul 1992 | A |
5157395 | Del Signore et al. | Oct 1992 | A |
5297144 | Gilbert et al. | Mar 1994 | A |
5402422 | Liu et al. | 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 et al. | 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 |
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 |
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 |
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 |
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 |
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 | Oct 2008 | B2 |
7471620 | Alazraki et al. | Dec 2008 | B2 |
7551937 | Kim et al. | Jun 2009 | B2 |
7570645 | Agarwal | Aug 2009 | B2 |
7583623 | Zimmerman et al. | Sep 2009 | B2 |
8619719 | Wengerter et al. | Dec 2013 | B2 |
20010015985 | Van Grinsven et al. | Aug 2001 | A1 |
20010048681 | Bilic et al. | Dec 2001 | A1 |
20020016852 | Nishihara | Feb 2002 | A1 |
20020089984 | Jiang | Jul 2002 | A1 |
20020090005 | Jiang et al. | Jul 2002 | A1 |
20020126677 | Hathaway et al. | Sep 2002 | A1 |
20030169722 | Petrus et al. | Sep 2003 | A1 |
20040132459 | Varma et al. | Jul 2004 | A1 |
20050100120 | Barton et al. | May 2005 | A1 |
20050220110 | Agarwal | Oct 2005 | A1 |
20060062250 | Payne | Mar 2006 | A1 |
20060262808 | Lin et al. | Nov 2006 | A1 |
20080081651 | Kuroda et al. | Apr 2008 | A1 |
20110075684 | Zeng et al. | Mar 2011 | A1 |
Number | Date | Country |
---|---|---|
0507384 | Mar 1992 | EP |
0622924 | Nov 1994 | EP |
0720405 | Jul 1996 | EP |
0845916 | Dec 1997 | EP |
0891060 | Jun 1998 | EP |
0944200 | Sep 1999 | EP |
11-266231 | Sep 1999 | JP |
WO9713388 | Apr 1997 | WO |
WO 9810568 | Mar 1998 | WO |
WO 9938343 | Jul 1999 | WO |
WO 9939532 | Aug 1999 | WO |
WO 0001188 | Jan 2000 | WO |
WO9222162 | Dec 2002 | WO |
Entry |
---|
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. |
Toyoki 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. |
Dutton et al., “Asynchronous Transfer Mode (ATM) Technical Overview,” 2.sup.nd Edition, Prentice Hall Oct. 1995, Chap. 3, pp. 21-25. |
International Search Report for PCT/US00/29687 dated Mar. 28, 2001, 3 pages. |
International Preliminary Examination Report for PCT/US00/29687 dated Dec. 18, 2001, 8 pages. |
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. |
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. |
Jain, P., “On the Impact of Channel and Channel Quality Estimation on Adaptive Modulation,” Dec. 2002, 92 pages. |
Andersen, et al., “Prediction of Future Fading Based on Past Measurements, Vehicular Technology Conference,” VTC 99, vol. 1, p. 151-155. |
Narlikar et al., “Designing Multihop Wireless Backhand Networks with Delay Guarantees,” Bell labs, 2005 12 pages. |
U.S. District Court, Northern District of California, “Amended Complaint for Declaratory Judgment Demand for Jury Trial” filed Sep. 30, 2008 in Case No. 5:08-cv-4555, 20 pages. |
Lin et al., “Error Control Coding, Fundamentals and Applications”, Prentice-Hall Computer Applications in Electrical Engineering Series., 1993, pp. 315-349. |
Lee, L.H. Charles, “Convolutional Coding, Fundamentals and Applications”, Artech House, Inc., 1997, p. 11-51. |
Redl, et al., “An Introduction to GSM”, Artech House, Inc., 1995, pp. 84-85 and 95. |
Shannon, C.E., “A Mathematical Theory of Communication”, Bell System Technical Journal, pp. 379-423 (Part 1), 623-656 (Part 2), Jul. 1948. |
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. |
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. |
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. |
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. |
Cable Television Laboratories, Inc., “Data-Over-Cable Service Interface Specifications Radio Frequency Interface Specification”, SP-RFlv1.1-101-990311, 1999-2005, 320 pages. |
International Search Report for PCT/US01/43582 dated Aug. 30, 2002, 3 pages. |
International Search Report for PCT/US00/20577 dated Apr. 5, 2001, 5 pages. |
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. |
Pons et al. “Bit Error Rate Characterisation and Modelling for GSM.” IEEE 1998, pp. 3722-3727. |
Torrance et al. “Upper bound performance of adaptive modulation in a slow Rayleigh fading channel.” IEEE Electronics Letters. 32(8):718-719, Apr. 11, 1996. |
Number | Date | Country | |
---|---|---|---|
20100323733 A1 | Dec 2010 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 09365917 | Aug 1999 | US |
Child | 10962957 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 12395347 | Feb 2009 | US |
Child | 12870620 | US | |
Parent | 10962957 | Oct 2004 | US |
Child | 12395347 | US |