The present Application for Patent is a Continuation Application and claims priority to Patent Application entitled “MC-CDMA Multiplexing in an Orthogonal Uplink”, Ser. No. 11/022,145, filed Dec. 22, 2004.
The present Application is related to the following co-pending U.S. Patent Applications:
“Fast Frequency Hopping With a Code Division Multiplexed Pilot in an OFDMA System,” patent application Ser. No. 10/726,944, filed Dec. 3, 2003, now U.S. Pat. No. 7,177,297;
“Fast Frequency Hopping With a Code Division Multiplexed Pilot in an OFDMA System,” Patent Application No. 60/470,107 filed on May 12, 2003, expired, assigned to the assignee hereof, and expressly incorporated by reference herein.
1. Field
The present invention relates generally to communication, and more specifically to techniques for supporting multi-carrier code division multiple access (MC-CDMA) in an orthogonal uplink of a wireless communication system.
2. Background
In a frequency hopping spread spectrum (FHSS) communication system, data is transmitted on different frequency subbands or sub-carriers in different time intervals, which are also referred to as “hop periods”. These frequency subbands may be provided by orthogonal frequency division multiplexing (OFDM), other multi-carrier modulation techniques, or some other constructs. With FHSS, the data transmission hops from subband to subband in a pseudo-random manner. This hopping provides frequency diversity and allows the data transmission to better withstand deleterious path effects such as narrow-band interference, jamming, fading, and so on.
An OFDMA system utilizes OFDM and can support multiple users simultaneously. For a frequency hopping OFDMA system, data for each user is transmitted using a specific frequency hopping (FH) sequence assigned to the user. The FH sequence indicates the specific subband to use for data transmission in each hop period. Multiple data transmissions for multiple users may be sent simultaneously using different FH sequences. These FH sequences are defined to be orthogonal to one another so that only one data transmission uses each subband in each hop period. By using orthogonal FH sequences, intra-cell interference is avoided, and the multiple data transmissions do not interfere with one another while enjoying the benefits of frequency diversity.
Techniques are provided herein to support MC-CDMA multiplexing in an orthogonal uplink of a wireless communication system.
In an aspect, a method of wireless multi-carrier communications, comprises dividing sub-carriers on an uplink into non-overlapping groups, allocating at least one time-frequency block, each time-frequency block having a hopping duration and a non-overlapped group, assigning a different set of orthogonal codes to each user, spreading symbols of each user over the allocated at least one time-frequency block, wherein the symbols of each user are spread using the different set of orthogonal codes assigned to each user, mapping each symbol to a modulation symbol in the at least one time-frequency block, generating an orthogonal waveform based on the mapped symbols; and transmitting the orthogonal waveform.
In an aspect, the orthogonal waveform generated is an orthogonal frequency division multiple (OFDM) waveform. In another aspect, the orthogonal waveform generated is an orthogonal frequency division multiple access (OFDMA) waveform.
In an aspect, an apparatus for wireless multi-carrier communications comprises means for dividing sub-carriers on an uplink into non-overlapping groups, means for allocating at least one time-frequency block, each time-frequency block having a hopping duration and a non-overlapped group, means for assigning a different set of orthogonal codes to each user, means for spreading symbols of each user over the allocated at least one time-frequency block, wherein the symbols of each user are spread using the different set of orthogonal codes assigned to each user, means for mapping each symbol to a modulation symbol in the at least one time-frequency block, means for generating an orthogonal waveform based on the mapped symbols, and means for transmitting the orthogonal waveform.
In yet another aspect, a computer readable media embodying a method for wireless multi-carrier communications comprises dividing sub-carriers on an uplink into non-overlapping groups, allocating at least one time-frequency block, each time-frequency block having a hopping duration and a non-overlapped group, assigning a different set of orthogonal codes to each user, spreading symbols of each user over the allocated at least one time-frequency block, wherein the symbols of each user are spread using the different set of orthogonal codes assigned to each user, mapping each symbol to a modulation symbol in the at least one time-frequency block, generating an orthogonal waveform based on the mapped symbols, and transmitting the orthogonal waveform.
In still yet another aspect, an apparatus for wireless multi-carrier communications comprises a controller, a processor, and a transmitter. The controller is operative to divide sub-carriers on an uplink into non-overlapping groups, allocate at least one time-frequency block, each time-frequency block having a hopping duration and a non-overlapped group, and assign a different set of orthogonal codes to each user. The processor is operative to spread symbols of each user over the allocated at least one time-frequency block, wherein the symbols of each user are spread using the different set of orthogonal codes assigned to each user and map each symbol to a modulation symbol in the at least one time-frequency block. The transmitter is operative to generate an orthogonal waveform based on the mapped symbols, and transmit the orthogonal waveform.
In an aspect, a receiver in a wireless multi-carrier communications system comprises an antenna for receiving an orthogonal waveform, a demodulator for demodulating the orthogonal waveform, thereby creating spread symbols, a processor for determining a time-frequency block from the spread symbols, and a de-spreader for despreading the spread symbols in the time-frequency block using an orthogonal code for a user.
Various aspects and embodiments of the invention are described in further detail below.
The features, nature, and advantages of the present invention will become more apparent from the detailed description set forth below when taken in conjunction with the drawings in which like reference characters identify correspondingly throughout and wherein:
The word “exemplary” is used herein to mean “serving as an example, instance, or illustration.” Any embodiment or design described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other embodiments or designs.
An OFDMA system may be deployed with multiple cells, where a cell typically refers to a base station and/or its coverage area. A data transmission on a given subband in one cell acts as interference to another data transmission on the same subband in a neighboring cell. To randomize inter-cell interference, the FH sequences for each cell are typically defined to be pseudo-random with respect to the FH sequences for neighboring cells. By using pseudo-random FH sequences, interference diversity is achieved, and the data transmission for a user in a given cell would observe, over a sufficiently long time period, the average interference from the data transmissions for other users in other cells.
The inter-cell interference can vary significantly from subband to subband at any given moment. To account for the variation in interference across the subbands, a margin is typically used in the selection of a data rate for a data transmission. A large margin is normally needed to achieve a low packet error rate (PER) for the data transmission if the variability in interference is large. The large margin results in a greater reduction in the data rate for the data transmission, which limits system capacity.
Frequency hopping can average the inter-cell interference and reduce the required margin. Increasing the frequency hopping rate results in better interference averaging and decreases the required margin. Fast frequency hopping rate is especially beneficial for certain types of transmissions that encode data across multiple frequency hops and which cannot use other techniques, such as automatic request for retransmission (ARQ), to mitigate the deleterious effects of interference.
Multi-Carrier Code Division Multiple Access (MC-CDMA) system with an FH-OFDMA uplink is a communication system based on a combination of CDMA scheme and orthogonal frequency division multiplexing (OFDM) signaling. MC-CDMA is an effective transmission technique on the downlink, as the orthogonality between multiplexed signals can still be preserved even after going through a multi-path channel (assuming accurate time and frequency synchronization between users and a base station), thereby allowing reliable separation of the multiplexed signals at the receiver.
On the other hand, MC-CDMA hasn't been as successful as a multiple-access technique on the uplink. The uplink transmission is inherently different from the downlink transmission in that transmitted signals from different users are affected by different channels. Due to the nature of multiplexing and sensitivity to channel estimation error of MC-CDMA, a disproportionate amount of system resource must be set aside for channel estimation in order for this technique to work on the uplink. Furthermore, synchronization on the uplink is a more complex problem since users see different channels, Doppler shifts, and are often at different distances from the base station.
However, a careful application of MC-CDMA as a multiplexing technique in the context of an FH-OFDMA uplink can result in significant resource utilization improvement, especially in terms of bandwidth utilization for low-spectral efficiency transmission.
In FH-OFDMA a user on the uplink is assigned a subset of sub-carriers and hops over time. Hopping helps improve frequency diversity and interference averaging over time. In an embodiment, sub-carriers on the uplink are divided into non-overlapping groups and each group hops independently. Since channels from consecutive sub-carriers (within a group) are expected to be highly correlated, their channels can be estimated using common pilot symbols, which leads to a significant saving on the pilot overhead (compared to a deployment with random sub-carrier hopping). Furthermore, FH-OFDMA employs a closed-loop uplink time-control mechanism to ensure that all uplink signals arrive within a small time window (i.e., within a cyclic prefix duration), which helps facilitate inter-symbol interference (ISI) and inter-carrier interference (ICI) mitigation.
In an embodiment, FH-OFDMA supports MC-CDMA multiplexing either across different users or across different signals from the same user.
The example assumes 8-carrier group hopping over 8 OFDM symbols. As such, there are 64 modulation symbols in each time-frequency block 106. Hop duration 102 and carrier association 108 are shown for a time-frequency block.
In an embodiment, the time and frequency are contiguous in a time-frequency block. A time-frequency block is a contiguous allocation of OFDM symbols and subcarriers. Alternatively, frequency is not contiguous in a time-frequency block, but frequencies that are part of the same time-frequency block are orthogonal to each other.
Each user is assigned a different set of orthogonal codes to be used in spreading respective data (or pilot) symbols over the allocated time-frequency block. Examples of orthogonal codes include Walsh codes and Gold codes, which are both known in the art.
After spreading, each symbol is mapped to one of the modulation symbols in the assigned time-frequency block. A corresponding OFDMA waveform is then generated based on these symbols (following standard OFDMA waveform generation technique). As can be seen, multiple users are sharing the same time-frequency allocation—a marked distinction from the traditional FH-OFDMA where users are assigned different sets of time-frequency allocation to ensure orthogonality. With proper choices of number of sub-carriers in a group and hop duration, respective channels of different users appear to be constant over certain time-frequency allocation, thereby allowing users to be separated based on the unique spreading signatures/codes assigned to different users.
MC-CDMA signals from different users are multiplexed over the same time-frequency allocation. A respective channel from each user is expected to be constant over each time-frequency allocation, thereby allowing separation at the receiver.
This technique is particularly effective in multiplexing low-spectral efficiency transmissions from different users (e.g., pilot symbols, ACK/NACK symbols, etc.) over the same time-frequency allocation on the uplink. Furthermore, this technique can also be used to help alleviate link budget constraint in certain scenarios.
As an example, a one-bit transmission (e.g., a pilot or ACK/NACK symbol) on the uplink is considered. In order to meet the performance requirement, a certain amount of received SNR must be achieved. A user can either transmit the bit over one transmission at a very high power or transmit at a lower power over several transmissions (e.g., through repetition). The former technique results in high bandwidth efficiency (i.e., only one transmission is required) but may suffer from link budget constraint and, worse yet, from poor performance due to lack of frequency/interference diversity. The alternative approach is to transmit this one bit over several transmissions. To improve frequency/interference diversity each transmission may take place over different frequency and/or time instants. This approach will likely result in more reliable detection at the receiver, but this is at the expense of larger bandwidth overhead and possibly longer transmission time. Longer transmission time of an ACK/NACK bit results in less processing time at the transmitter, especially in a system where H-ARQ is used.
A compromise is to use a transmission technique that is able to garner sufficient amount of frequency/interference diversity while still using reasonable amount of bandwidth. A structure with consecutive carrier group hopping considered previously can be used. In this setting, a user transmits the one-bit quantity over multiple time-frequency blocks in order collect frequency/interference diversity. Furthermore, multiple users are orthogonally multiplexed over a particular time-frequency block to minimize the overall bandwidth consumption. To see this latter point, consider a scenario where a user transmits the one-bit quantity over M transmissions. Assume that N transmissions fall within a particular time-frequency block (i.e., a user transmits over a total of M/N blocks). As such, a user requires N modulation symbols from each block. Assuming that there are a total of K modulation symbols per time-frequency block, each block can then support at most K/N users. Clearly, if the channel remains fairly constant (in both time and frequency) over each time-frequency block, one can readily apply the MC-CDMA multiplexing technique. Towards that end, each user is assigned one of the orthogonal code sequences to modulate a respective data symbol. Orthogonally-spread symbols are then put on appropriate sub-carriers from which an OFDM waveform can be generated.
By assigning an orthogonal code sequence to each user, up to K users can be multiplexed in each time-frequency block while still being able to collect the same amount of energy (after despreading). In addition, since each user is now transmitting over the entire time-frequency block, a saving on the link budget is an immediate byproduct. The link budget saving comes primarily from the fact that each user is transmitting over a longer duration.
This transmission technique can also be generalized to work in a setting where users are transmitting more than just one bit each. In particular, it is always possible to modify the transmission of each user such that multiple users can be multiplexed over each time-frequency block (i.e., through a deliberate spreading). The true bandwidth saving, however, really comes when repetition code (which is a form of spreading) is inherent to the transmission.
In an FH-OFDMA setting, a repetition code is also useful as a means to alleviate link budget constraint. For instance, due to a link budget limitation a user may not be able to meet the received SNR requirement when transmitting a coded symbol over one transmission. One way of getting around this is to transmit each coded symbol over multiple transmissions, each with lower power, at different time instants (i.e., through repetitions). Clearly, by applying the proposed user multiplexing technique, the desired result can be achieved while limiting the bandwidth overhead to a minimum.
Within terminal 220x, an encoder/interleaver 212 receives traffic data from a data source 210 and possibly control data and other data from a controller 240. Encoder/interleaver 212 formats, encodes, and interleaves the received data to provide coded data. A modulator 214 then modulates the coded data in accordance with one or more modulation schemes (e.g., QPSK, M-PSK, M-QAM, and so on) to provide modulation symbols (or simply, “data symbols”). Each modulation symbol is a complex value for a specific point in a signal constellation for the modulation scheme used for that modulation symbol.
An OFDM modulator 220 performs frequency hopping and OFDM processing for the data symbols. Within OFDM modulator 220, a TX FH processor 222 receives the data symbols and provides these data symbols on the proper subbands determined by an FH sequence for a traffic channel assigned to terminal 220x. This FH sequence indicates the specific subband to use in each hop period and is provided by controller 240. The TX FH processor 222 provides data symbols. The data symbols dynamically hop from subband to subband in a pseudo-random manner determined by the FH sequence. For each OFDM symbol period, TX FH processor 222 provides N “transmit” symbols for the N subbands. These N transmit symbols are composed of one data symbol for the subband used for data transmission (if data is being transmitted) and a signal value of zero for each subband not used for data transmission.
An inverse fast Fourier transform (IFFT) unit 224 receives the N transmit symbols for each OFDM symbol period. IFFT unit 224 then transforms the N transmit symbols to the time domain using an N-point inverse FFT to obtain a “transformed” symbol that contains N time-domain “data” chips. Each data chip is a complex value to be transmitted in one chip period. (The chip rate is related to the overall bandwidth of the system.) A cyclic prefix generator 226 receives the N data chips for each transformed symbol and repeats a portion of the transformed symbol to form an OFDM symbol that contains N+Cp data chips, where Cp is the number of data chips being repeated. The repeated portion is often referred to as a cyclic prefix and is used to combat inter-symbol interference (ISI) caused by frequency selective fading. An OFDM symbol period corresponds to the duration of one OFDM symbol, which is N+Cp chip periods. Cyclic prefix generator 226 provides a stream of data chips for a stream of OFDM symbols.
A transmit (TX) pilot processor 230 receives the stream of data chips and at least one pilot symbol. TX pilot processor 230 generates a narrowband pilot. TX pilot processor 230 provides a stream of “transmit” chips. A transmitter unit (TMTR) 232 processes the stream of transmit chips to obtain a modulated signal, which is transmitted from an antenna 234 to the base station.
The modulated signal transmitted by terminal 220x is received by an antenna 252. The received signal from antenna 252 is provided to and processed by a receiver unit (RCVR) 254 to provide samples. Receiver unit 254 may further perform sample rate conversion (from the receiver sampling rate to the chip rate), frequency/phase correction, and other pre-processing on the samples. Receiver unit 254 provides a stream of “received” chips.
A receive (RX) pilot processor 260 receives and processes the stream of received chips to recover the narrowband pilot and the data chips transmitted by terminal 220x. Several designs for RX pilot processor 260 are described below. RX pilot processor 260 provides a stream of received data chips to an OFDM demodulator 270 and channel gain estimates to a digital signal processor (DSP) 262. DSP 262 processes the channel gain estimates to obtain channel response estimates used for data demodulation, as described below.
Within OFDM demodulator 270, a cyclic prefix removal unit 272 receives the stream of received data chips and removes the cyclic prefix appended to each received OFDM symbol to obtain a received transformed symbol. An FFT unit 274 then transforms each received transformed symbol to the frequency domain using an N-point FFT to obtain N received symbols for the N subbands. An RX FH processor 276 obtains the N received symbols for each OFDM symbol period and provides the received symbol from the proper subband as the received data symbol for that OFDM symbol period. The specific subband from which to obtain the received data symbol in each OFDM symbol period is determined by the FH sequence for the traffic channel assigned to terminal 220x. This FH sequence is provided by a controller 290. Since the data transmission by terminal 220x dynamically hops from subband to subband, RX FH processor 276 operates in unison with TX FH processor 222 in terminal 220x and provides the received data symbols from the proper subbands. The FH sequence used by RX FH processor 276 at base station 210x is the same as the FH sequence used by TX FH processor 222 at terminal 220x. Moreover, the FH sequences at base station 210x and terminal 220x are synchronized. RX FH processor 276 provides a stream of received data symbols to a demodulator 280.
Demodulator 280 receives and coherently demodulates the received data symbols with the channel response estimates from DSP 262 to obtain recovered data symbols. The channel response estimates are for the subbands used for data transmission. Demodulator 280 further demaps the recovered data symbols to obtain demodulated data. A deinterleaver/decoder 282 then deinterleaves and decodes the demodulated data to provide decoded data, which may be provided to a data sink 284 for storage. In general, the processing by the units in base station 210x is complementary to the processing performed by the corresponding units in terminal 420x.
Controllers 240 and 290 direct operation at terminal 220x and base station 210x, respectively. Memory units 242 and 292 provide storage for program codes and data used by controllers 240 and 290, respectively. Controllers 240 and 290 may also perform pilot-related processing. For example, controllers 240 and 290 may determine the time intervals when a narrowband pilot for terminal 220x should be transmitted and received, respectively.
For clarity,
The techniques described herein may be used for a frequency hopping OFDMA system as well as other wireless multi-carrier communication systems. For example, these techniques may be used for systems that employ other multi-carrier modulation techniques such as discrete multi-tone (DMT).
The techniques described herein may be used for efficient narrowband uplink pilot transmissions in a Time Division Duplexing (TDD) deployment. The saving is in both system bandwidth and link budget for each user. For example, given three users, each transmitting a symbol over three time slots, each user transmits its symbol at ⅓ transmission power over three time slots.
The techniques described herein may be implemented by various means at the transmitter and the receiver. The pilot and data processing at the transmitter and receiver may be performed in hardware, software, or a combination thereof. For a hardware implementation, the processing units (e.g., TX pilot processor 230, RX pilot processor 260, DSP 222, and so on) may be implemented within one or more application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), field programmable gate arrays (FPGAs), processors, controllers, micro-controllers, microprocessors, other electronic units designed to perform the functions described herein, or a combination thereof.
For a software implementation, the pilot and data processing at the transmitter and receiver may be implemented with modules (e.g., procedures, functions, and so on) that perform the functions described herein. The software codes may be stored in memory units (e.g., memory units 242 and 292 in
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Number | Name | Date | Kind |
---|---|---|---|
4346473 | Davis | Aug 1982 | A |
4617657 | Drynan et al. | Oct 1986 | A |
4850036 | Smith | Jul 1989 | A |
5282222 | Fattouche et al. | Jan 1994 | A |
5408496 | Ritz et al. | Apr 1995 | A |
5416780 | Patel | May 1995 | A |
5511233 | Otten | Apr 1996 | A |
5519130 | Byrom et al. | May 1996 | A |
5519730 | Jasper et al. | May 1996 | A |
5694389 | Seki et al. | Dec 1997 | A |
5732351 | Olds et al. | Mar 1998 | A |
5822700 | Hult et al. | Oct 1998 | A |
5867478 | Baum et al. | Feb 1999 | A |
5889759 | McGibney | Mar 1999 | A |
5920547 | Werth | Jul 1999 | A |
5995494 | Horikawa | Nov 1999 | A |
6005852 | Kokko et al. | Dec 1999 | A |
6021124 | Haartsen | Feb 2000 | A |
6052377 | Ohmi et al. | Apr 2000 | A |
6097711 | Okawa et al. | Aug 2000 | A |
6104926 | Hogg et al. | Aug 2000 | A |
6105064 | Davis et al. | Aug 2000 | A |
6134434 | Krishnamurthi et al. | Oct 2000 | A |
6141550 | Ayabe et al. | Oct 2000 | A |
6157839 | Cerwall et al. | Dec 2000 | A |
6172971 | Kim | Jan 2001 | B1 |
6173016 | Suzuki | Jan 2001 | B1 |
6188717 | Kaiser et al. | Feb 2001 | B1 |
6222828 | Ohlson et al. | Apr 2001 | B1 |
6263205 | Yamaura et al. | Jul 2001 | B1 |
6285665 | Chuah | Sep 2001 | B1 |
6333937 | Ryan | Dec 2001 | B1 |
6347091 | Wallentin et al. | Feb 2002 | B1 |
6367045 | Khan et al. | Apr 2002 | B1 |
6369758 | Zhang | Apr 2002 | B1 |
6377587 | Grivna | Apr 2002 | B1 |
6377809 | Rezaiifar et al. | Apr 2002 | B1 |
6430412 | Hogg et al. | Aug 2002 | B1 |
6430724 | Laneman et al. | Aug 2002 | B1 |
6447210 | Coombs | Sep 2002 | B1 |
6449245 | Ikeda et al. | Sep 2002 | B1 |
6466591 | See et al. | Oct 2002 | B1 |
6473393 | Ariyavisitakul et al. | Oct 2002 | B1 |
6473467 | Wallace et al. | Oct 2002 | B1 |
6477210 | Chuang et al. | Nov 2002 | B2 |
6487235 | Hoole | Nov 2002 | B2 |
6487252 | Kleider et al. | Nov 2002 | B1 |
6505253 | Chiu et al. | Jan 2003 | B1 |
6515997 | Feltner et al. | Feb 2003 | B1 |
6522886 | Youngs et al. | Feb 2003 | B1 |
6532227 | Leppisaari et al. | Mar 2003 | B1 |
6532256 | Miller | Mar 2003 | B2 |
6535715 | Dapper et al. | Mar 2003 | B2 |
6545997 | Bohnke et al. | Apr 2003 | B1 |
6549561 | Crawford | Apr 2003 | B2 |
6563858 | Fakatselis et al. | May 2003 | B1 |
6567374 | Bohnke et al. | May 2003 | B1 |
6567397 | Campana, Jr. et al. | May 2003 | B1 |
6594320 | Sayeed | Jul 2003 | B1 |
6597680 | Lindskog et al. | Jul 2003 | B1 |
6597745 | Dowling | Jul 2003 | B1 |
6597918 | Kim | Jul 2003 | B1 |
6601207 | Vanttinen | Jul 2003 | B1 |
6603801 | Andren et al. | Aug 2003 | B1 |
6618454 | Agrawal et al. | Sep 2003 | B1 |
6633616 | Crawford | Oct 2003 | B2 |
6636568 | Kadous | Oct 2003 | B2 |
6643281 | Ryan | Nov 2003 | B1 |
6654429 | Li | Nov 2003 | B1 |
6658619 | Chen | Dec 2003 | B1 |
6661832 | Sindhushayana et al. | Dec 2003 | B1 |
6665309 | Hsu et al. | Dec 2003 | B2 |
6674792 | Sugita | Jan 2004 | B1 |
6697347 | Ostman et al. | Feb 2004 | B2 |
6700865 | Yamamoto et al. | Mar 2004 | B1 |
6724813 | Jamal et al. | Apr 2004 | B1 |
6731614 | Ohlson et al. | May 2004 | B1 |
6741634 | Kim et al. | May 2004 | B1 |
6751187 | Walton et al. | Jun 2004 | B2 |
6801564 | Rouphael et al. | Oct 2004 | B2 |
6813478 | Glazko et al. | Nov 2004 | B2 |
6876694 | Komatsu | Apr 2005 | B2 |
6878694 | Doshi et al. | Apr 2005 | B2 |
6885645 | Ryan et al. | Apr 2005 | B2 |
6888805 | Bender et al. | May 2005 | B2 |
6907246 | Xu et al. | Jun 2005 | B2 |
6909761 | Kloos et al. | Jun 2005 | B2 |
6928062 | Krishnan et al. | Aug 2005 | B2 |
6928065 | Logalbo et al. | Aug 2005 | B2 |
6975647 | Neale et al. | Dec 2005 | B2 |
6977974 | Geraniotis et al. | Dec 2005 | B1 |
6990142 | Chappaz | Jan 2006 | B2 |
6996195 | Kadous | Feb 2006 | B2 |
6996401 | Agin | Feb 2006 | B2 |
7009960 | Ho | Mar 2006 | B2 |
7020110 | Walton et al. | Mar 2006 | B2 |
7027429 | Laroia et al. | Apr 2006 | B2 |
7027523 | Jalali et al. | Apr 2006 | B2 |
7039001 | Krishnan et al. | May 2006 | B2 |
7039004 | Sun et al. | May 2006 | B2 |
7042429 | Miyazawa et al. | May 2006 | B2 |
7042857 | Krishnan et al. | May 2006 | B2 |
7042869 | Bender | May 2006 | B1 |
7046651 | Terry | May 2006 | B2 |
7054902 | Toporek et al. | May 2006 | B2 |
7058134 | Sampath | Jun 2006 | B2 |
7061915 | Seidel et al. | Jun 2006 | B2 |
7061916 | Herron et al. | Jun 2006 | B2 |
7062276 | Xu et al. | Jun 2006 | B2 |
7068703 | Maric | Jun 2006 | B2 |
7072413 | Walton et al. | Jul 2006 | B2 |
7089024 | Kim et al. | Aug 2006 | B2 |
7092459 | Sendonaris | Aug 2006 | B2 |
7099296 | Belcea | Aug 2006 | B2 |
7099299 | Liang et al. | Aug 2006 | B2 |
7099622 | Meyer et al. | Aug 2006 | B2 |
7103823 | Nemawarkar et al. | Sep 2006 | B2 |
7127012 | Han et al. | Oct 2006 | B2 |
7133460 | Bae et al. | Nov 2006 | B2 |
7139320 | Singh et al. | Nov 2006 | B1 |
7177297 | Agrawal et al. | Feb 2007 | B2 |
7181170 | Love et al. | Feb 2007 | B2 |
7181666 | Grob et al. | Feb 2007 | B2 |
7254158 | Agrawal | Aug 2007 | B2 |
7280467 | Smee et al. | Oct 2007 | B2 |
7283559 | Cho et al. | Oct 2007 | B2 |
7310336 | Malkamaki | Dec 2007 | B2 |
7320043 | Shatas et al. | Jan 2008 | B2 |
7366272 | Kim et al. | Apr 2008 | B2 |
7376422 | Yagihashi | May 2008 | B2 |
7411895 | Laroia et al. | Aug 2008 | B2 |
7430253 | Olson et al. | Sep 2008 | B2 |
7450587 | Gruhn et al. | Nov 2008 | B2 |
7453849 | Teague et al. | Nov 2008 | B2 |
7463576 | Krishnan et al. | Dec 2008 | B2 |
7464166 | Larsson et al. | Dec 2008 | B2 |
7474686 | Ho | Jan 2009 | B2 |
7519016 | Lee et al. | Apr 2009 | B2 |
7551546 | Ma et al. | Jun 2009 | B2 |
7630403 | Ho et al. | Dec 2009 | B2 |
7631247 | Petrovic et al. | Dec 2009 | B2 |
7778337 | Tong et al. | Aug 2010 | B2 |
20020034161 | Deneire et al. | Mar 2002 | A1 |
20020041635 | Ma et al. | Apr 2002 | A1 |
20020044540 | Mottier et al. | Apr 2002 | A1 |
20020145968 | Zhang et al. | Oct 2002 | A1 |
20020152315 | Kagan et al. | Oct 2002 | A1 |
20020160781 | Bark et al. | Oct 2002 | A1 |
20030135640 | Ho et al. | Jul 2003 | A1 |
20030161343 | Ghosh | Aug 2003 | A1 |
20030174662 | Malkamaki | Sep 2003 | A1 |
20030174700 | Ofek et al. | Sep 2003 | A1 |
20030214906 | Hu et al. | Nov 2003 | A1 |
20030214930 | Fischer | Nov 2003 | A1 |
20030228865 | Terry | Dec 2003 | A1 |
20040047298 | Yook et al. | Mar 2004 | A1 |
20040062206 | Soong et al. | Apr 2004 | A1 |
20040082336 | Jami et al. | Apr 2004 | A1 |
20040082356 | Walton et al. | Apr 2004 | A1 |
20040114552 | Lim et al. | Jun 2004 | A1 |
20040114566 | Lim et al. | Jun 2004 | A1 |
20040114618 | Tong et al. | Jun 2004 | A1 |
20040116125 | Terry | Jun 2004 | A1 |
20040131007 | Smee et al. | Jul 2004 | A1 |
20040137863 | Walton et al. | Jul 2004 | A1 |
20040137943 | Tseng | Jul 2004 | A1 |
20040170439 | Hiironen | Sep 2004 | A1 |
20040184471 | Chuah et al. | Sep 2004 | A1 |
20040213278 | Pullen et al. | Oct 2004 | A1 |
20040228267 | Agrawal et al. | Nov 2004 | A1 |
20040229615 | Agrawal | Nov 2004 | A1 |
20040235472 | Fujishima et al. | Nov 2004 | A1 |
20040253968 | Chang et al. | Dec 2004 | A1 |
20040258134 | Cho et al. | Dec 2004 | A1 |
20050002355 | Takano | Jan 2005 | A1 |
20050002369 | Ro et al. | Jan 2005 | A1 |
20050013263 | Kim et al. | Jan 2005 | A1 |
20050030976 | Wentink | Feb 2005 | A1 |
20050069022 | Agrawal | Mar 2005 | A1 |
20050163194 | Gore et al. | Jul 2005 | A1 |
20050165949 | Teague | Jul 2005 | A1 |
20050174931 | Krishnamoorthi | Aug 2005 | A1 |
20050190868 | Khandekar et al. | Sep 2005 | A1 |
20050254555 | Teague | Nov 2005 | A1 |
20050272432 | Ji et al. | Dec 2005 | A1 |
20050281242 | Sutivong et al. | Dec 2005 | A1 |
20050281290 | Khandekar et al. | Dec 2005 | A1 |
20060034163 | Gore et al. | Feb 2006 | A1 |
20060034173 | Teague et al. | Feb 2006 | A1 |
20060045001 | Jalali | Mar 2006 | A1 |
20060114848 | Eberle et al. | Jun 2006 | A1 |
20060133308 | Madan | Jun 2006 | A1 |
20060133522 | Sutivong et al. | Jun 2006 | A1 |
20060153239 | Julian et al. | Jul 2006 | A1 |
20060164993 | Teague et al. | Jul 2006 | A1 |
20060203932 | Palanki et al. | Sep 2006 | A1 |
20060209927 | Khandekar et al. | Sep 2006 | A1 |
20060218302 | Chia et al. | Sep 2006 | A1 |
20060221810 | Vrcelj et al. | Oct 2006 | A1 |
20060279435 | Krishnan et al. | Dec 2006 | A1 |
20070206623 | Tiedemann et al. | Sep 2007 | A1 |
20070211790 | Agrawal et al. | Sep 2007 | A1 |
20080075184 | Muharemovic et al. | Mar 2008 | A1 |
20080137603 | Teague et al. | Jun 2008 | A1 |
20080137652 | Herrmann et al. | Jun 2008 | A1 |
20090245421 | Montojo et al. | Oct 2009 | A1 |
20100002570 | Walton et al. | Jan 2010 | A9 |
20100034164 | Ho et al. | Feb 2010 | A1 |
20100182911 | Pullen et al. | Jul 2010 | A1 |
20110145584 | Coburn et al. | Jun 2011 | A1 |
20110235685 | Sutivong et al. | Sep 2011 | A1 |
20110282999 | Teague et al. | Nov 2011 | A1 |
20120087336 | Sutivong et al. | Apr 2012 | A1 |
Number | Date | Country |
---|---|---|
1187930 | Jul 1998 | CN |
1254223 | May 2000 | CN |
1345518 | Apr 2002 | CN |
1394394 | Jan 2003 | CN |
19701011 | Jun 1998 | DE |
19747369 | May 1999 | DE |
10010870 | Nov 2000 | DE |
0658028 | Jun 1995 | EP |
0768806 | Apr 1997 | EP |
0917316 | May 1999 | EP |
1039683 | Mar 2002 | EP |
1043861 | Jun 2002 | EP |
1265411 | Dec 2002 | EP |
1286491 | Feb 2003 | EP |
1432261 | Jun 2004 | EP |
1513272 | Mar 2005 | EP |
1919152 | May 2008 | EP |
2350753 | Dec 2003 | GB |
04127738 | Apr 1992 | JP |
04367135 | Dec 1992 | JP |
07327248 | Dec 1995 | JP |
09233047 | Sep 1997 | JP |
9266466 | Oct 1997 | JP |
10336159 | Dec 1998 | JP |
11113049 | Apr 1999 | JP |
11261623 | Sep 1999 | JP |
11331121 | Nov 1999 | JP |
11346203 | Dec 1999 | JP |
2000013353 | Jan 2000 | JP |
2000111631 | Apr 2000 | JP |
2000504908 | Apr 2000 | JP |
2000201134 | Jul 2000 | JP |
2000252947 | Sep 2000 | JP |
2000278207 | Oct 2000 | JP |
2001036497 | Feb 2001 | JP |
2002111624 | Apr 2002 | JP |
2002111631 | Apr 2002 | JP |
2002141837 | May 2002 | JP |
2002152167 | May 2002 | JP |
2002152169 | May 2002 | JP |
2002158631 | May 2002 | JP |
2002514368 | May 2002 | JP |
2002164867 | Jun 2002 | JP |
2003060645 | Feb 2003 | JP |
2003060655 | Feb 2003 | JP |
2003078565 | Mar 2003 | JP |
2003218826 | Jul 2003 | JP |
2003520499 | Jul 2003 | JP |
2003528527 | Sep 2003 | JP |
2003339072 | Nov 2003 | JP |
2004007353 | Jan 2004 | JP |
2004159345 | Jun 2004 | JP |
2004529524 | Sep 2004 | JP |
2004312291 | Nov 2004 | JP |
2004537875 | Dec 2004 | JP |
2005508103 | Mar 2005 | JP |
2005512458 | Apr 2005 | JP |
2005536103 | Nov 2005 | JP |
20060505229 | Feb 2006 | JP |
030017401 | Mar 2003 | KR |
2111619 | May 1998 | RU |
2150174 | May 2000 | RU |
2180159 | Feb 2002 | RU |
2213430 | Sep 2003 | RU |
2335852 | Oct 2008 | RU |
387186 | Apr 2000 | TW |
508922 | Nov 2002 | TW |
WO92010890 | Jun 1992 | WO |
WO9408432 | Apr 1994 | WO |
WO9730526 | Aug 1997 | WO |
WO98014026 | Apr 1998 | WO |
WO-9837638 | Aug 1998 | WO |
WO99014878 | Mar 1999 | WO |
WO9943114 | Aug 1999 | WO |
WO9944316 | Sep 1999 | WO |
WO9966748 | Dec 1999 | WO |
WO0161902 | Aug 2001 | WO |
WO0176110 | Oct 2001 | WO |
WO0203556 | Jan 2002 | WO |
WO0237887 | May 2002 | WO |
WO0241548 | May 2002 | WO |
WO0249305 | Jun 2002 | WO |
WO02049306 | Jun 2002 | WO |
0273831 | Sep 2002 | WO |
WO02093832 | Nov 2002 | WO |
WO03019852 | Mar 2003 | WO |
WO03021829 | Mar 2003 | WO |
WO03034645 | Apr 2003 | WO |
WO2004015946 | Feb 2004 | WO |
WO2004040813 | May 2004 | WO |
WO2004073219 | Aug 2004 | WO |
WO2004079937 | Sep 2004 | WO |
2004102815 | Nov 2004 | WO |
2004102816 | Nov 2004 | WO |
WO2005074184 | Aug 2005 | WO |
WO2006022876 | Mar 2006 | WO |
Entry |
---|
“A Time and Frequency Synchronization Scheme for Multiuser OFDM” by JJ Van De Beek et al., IEEE Journal of Selected Areas in Communications, vol. 17, No. 11, pp. 1900-1914, Published in Nov. 1999. |
Elkashlan M. et al, Performance of Frequency-Hopping Multicarrier CDMA on a Uplink with Conference Proceedings, San Francisco, CA Dec. 1-5, 2003, IEEE Global Telecommunications Conference, NY, NY, IEEE, US, vol. 7 of 7, Dec. 1, 2003, pp. 3407-3411. |
Gromakov, Ju.A., “Standards and Systems of Mobile Communications (Mobile Radio Communication Standards and Systems)” Moscow: Mobilnye Telesistemy—Eko Trands, 1997, pp. 59-61. |
Hui Won Je et al, “A Novel Multiple Access Scheme for Uplink Cellular Systems,” Vehicular Technology Conference, 2004, VTC2004-fall, 2004 IEEE 60th Los Angeles, CA, US, Sep. 26-29, 2004, Piscataway, NY, pp. 984-988. |
IEEE Communications Magazine, Apr. 2002, David Falconer et al., Frequency Domain Equalization for Single-Carrier Broadband Wireless Systems, pp. 58-66. |
International Search Report & Written Opinion—PCT/US05/046741—International Search Authority—European Patent Office, May 12, 2006. |
Kapoor, S. et al., “Pilot assisted synchronization for wireless OFDM systems over fast time varying fading channels,” Vehicular Technology Conference, 1998. VTC 98. 48th IEEE, May 18, 1998, vol. 3, pp. 2077-2080. |
Sudarshan Roa , Subramanian Vasudevan “Resource Allocation and Fairness for downlink shared Data channels”, Mar. 16-20, 2003, 2003 IEEE. Wireless Communication and Networking, 2003 WCNC 2003,pp. 1049-1054. |
“3GPP TR 25.848 V4.0.0 Technical Specification Group Radio Access Network: Physical Layer Aspects of Utra High Speed Downlink Packet Access (Release 4)” 3GPP TR 25.848 V4.0.0, Mar. 2001, pp. 1-89, XP002189517. |
Tonello A.M. et al. “An Asynchronous Multitone Multiuser Air Interface for High-speed Uplink Communications,” Vehicular Technology Conference, 2003, VTC 2003 Fall, 2003 IEEE 58th, Orlando, FL, US Oct. 6-9, 2003, Piscataway, NJ, US, IEEE, US. 2267-2271. |
Van De Beek J-J et al: “On Channel Estimation in OFDM Systems” Proceedings of the Vehicular Technology Conference. Chicago, July 25-28, 1995, New York, IEEE, US, vol. 2 Conf. 45, Jul. 25, 1995, pp. 815-819, XP000551647 ISBN: 0-7803-2743-8 p. 816, left-hand column, line 20—page 817, left-hand column, line 23 p. 818, right-hand column, line 3—line 20 figure 5. |
Yasunori Matsui et al., “A Study on Adaptive Uplink Resource Control Scheme for Asymmetric Packet Radio Communication Systems using OFDMA/TDD Technique,” Technical Report of IEICE, Nov. 10, 2000, vol. 100, No. 435, pp. 63-70, RCS 2000-172 (Abstract). |
Zhongren Cao et al., “Analysis of two receiver schemes for interleaved OFDMA uplink,” Signals, Systems and Computers, 2002. Conference Record of the Thirty-Sixth Asilomar Conference on, Nov. 3, 2002, vol. 2, pp. 1818-1821. |
Miller, L. et al., “Cumulative acknowledgement multicast repetition policy for wireless LANs or ad hoc network clusters,” IEEE, Wireless Communication Technologies Group National Institute of Standards and Technology, Maryland Gaithersburg, pp. 3403-3407, (2002). |
Miyoshi, M. et al.,“Performance Improvement of TCP in wireless cellular network based acknowledgement control”, Department of Infomatics and Mathematical Secience, Gradute School of Engineering Science, Osaka University, Japan, Proceedings of the 7th Asia Pacific, pp. 1-15, (2001). |
Coleri, S. et al: “Channel Estimation Techniques Based on Pilot Arrangement in OFDM Systems,” IEEE Transactions on Broadcasting, Sep. 1, 2002, pp. 223-229, vol. 48, No. 3, IEEE Service Center, XP011070267, ISSN: 0018-9316. |
Taiwan Search Report—TW094145927—TIPO—Dec. 23, 2011 |
Zhao et al., “A novel channel estimation method for OFDM mobile communication systems based on pilot signals and transform-domain processing” Vehicular Technology Conference, 1997, IEEE 47th Phoenix, AZ, USA May 4-7, 1997, New York, NY, USA, IEEE, US, vol. 3, May 4, 1997, pp. 2089-2093, XP010229166 ISBN: 0-7803-3659-3. |
Cai, X., et al., “Group-orthogonal multi-carrier CDMA”, Military Communications Conference. Milcom 2002. Proceedings. Anaheim, CA, Oct. 7-10, 2002; [IEEE Military Communications Conference], New York, NY: IEEE; US, vol. 1, Oct. 7, 2002, pp. 596-601, XP010632171, DOI: 10.1109/Milcom.2002.1180511 ISBN: 978-0/7803-7625-0, Sections I-III. |
European Search Report—EP11164567—Search Authority—Munich—Jul. 1, 2013. |
Xu, Y., et al., “Group-orthogonal OFDMA in fast time-varying frequency-selective fading environments”, 2004 IEEE 60th Vehicular Technology Conference. VTC2004-Fall (IEEE Cat. No. 04CH37575) IEEE Piscataway, NJ, USA, IEEE, vol. 1, Sep. 26, 2004, pp. 488-492, XP010788423, DOI: 10.1109/VETECF.2004.1400054 ISBN: 978-0-7803-8521-4, abstract, Sections I and III. |
Number | Date | Country | |
---|---|---|---|
20110064039 A1 | Mar 2011 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11022145 | Dec 2004 | US |
Child | 12889131 | US |