Code division multiplexing in a single-carrier frequency division multiple access system

Abstract
In a single-carrier frequency division multiple access (SC-FDMA) system that utilizes interleaved FDMA (IFDMA) or localized FDMA (LFDMA), a transmitter generates modulation symbols for different types of data (e.g., traffic data, signaling, and pilot) and performs code division multiplexing (CDM) on at least one data type. For example, the transmitter may apply CDM on signaling and/or pilot sent on frequency subbands and symbol periods that are also used by at least one other transmitter. To apply CDM to a given data type (e.g., signaling), the transmitter performs spreading on the modulation symbols for that data type with an assigned spreading code. CDM may be applied across symbols, samples, samples and symbols, frequency subbands, and so on. The transmitter may perform scrambling after the spreading. The transmitter generates SC-FDMA symbols of the same or different symbol durations for traffic data, signaling, and pilot and transmits the SC-FDMA symbols.
Description
BACKGROUND

I. Field


The present disclosure relates generally to communication, and more specifically to transmission techniques in a wireless communication system.


II. Background


A multiple-access system can concurrently communicate with multiple terminals on the forward and reverse links. The forward link (or downlink) refers to the communication link from the base stations to the terminals, and the reverse link (or uplink) refers to the communication link from the terminals to the base stations. Multiple terminals may simultaneously transmit data on the reverse link and/or receive data on the forward link. This is often achieved by multiplexing the multiple data transmissions on each link to be orthogonal to one another in time, frequency and/or code domain. For example, data transmissions for different terminals may be orthogonalized by using different orthogonal codes in a code division multiple access (CDMA) system, by transmitting in different time slots in a time division multiple access (TDMA) system, and by transmitting on different frequency subbands in a frequency division multiple access (FDMA) system or an orthogonal frequency division multiple access (OFDMA) system.


The terminals may transmit various types of data such as, e.g., traffic data, signaling, and pilot. Traffic data refers to data sent by an application (e.g., voice or packet data), signaling refers to data sent to support system operation (e.g., control data), and pilot refers to data that is known a priori by both a transmitter and a receiver. The different types of data may have different requirements and may be transmitted in different manners, e.g., at different rates and in different time intervals. Since signaling and pilot represent overhead, it is desirable for the terminals to transmit signaling and pilot as efficiently as possible.


There is therefore a need in the art for efficient transmission techniques in a multiple-access system.


SUMMARY

Techniques to efficiently transmit different types of data in a single-carrier frequency division multiple access (SC-FDMA) system are described herein. The SC-FDMA system may utilize (1) interleaved FDMA (IFDMA) to transmit on frequency subbands that are distributed across a frequency band or overall system bandwidth (2) localized FDMA (LFDMA) to transmit on a group of adjacent subbands, or (3) enhanced FDMA (EFDMA) to transmit data and pilot on multiple groups of adjacent subbands. IFDMA is also called distributed FDMA, and LFDMA is also called narrowband FDMA, classical FDMA, and FDMA.


In an embodiment, a transmitter (e.g., a terminal) generates modulation symbols for different types of data (e.g., traffic data, signaling, and pilot) and performs code division multiplexing (CDM) on one or more data types. CDM may be applied to traffic data, signaling, pilot, or any combination thereof. For example, the transmitter may apply CDM on signaling and/or pilot sent on frequency subbands and symbol periods that are also used by at least one other transmitter. To apply CDM to a given data type (e.g., signaling), the transmitter performs spreading on the modulation symbols for that data type with an assigned spreading code (e.g., a Walsh code). CDM may be applied across symbols, across samples, across both samples and symbols, across frequency subbands, and so on, as described below. The transmitter may also perform scrambling after the spreading. The transmitter generates SC-FDMA symbols of the same or different symbol durations for traffic data, signaling, and pilot and transmits the SC-FDMA symbols to a receiver. The receiver performs the complementary processing to recover the transmitted data.


Various aspects and embodiments of the invention are described in further detail below.





BRIEF DESCRIPTION OF THE DRAWINGS

The features and nature 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.



FIG. 1 shows a system with multiple transmitters and a receiver.



FIG. 2A shows an exemplary subband structure for IFDMA.



FIG. 2B shows an exemplary subband structure for LFDMA.



FIG. 2C shows an exemplary subband structure for EFDMA.



FIG. 3A shows the generation of an IFDMA, LFDMA or EFDMA symbol.



FIG. 3B shows the generation of an IFDMA symbol.



FIG. 4 shows a frequency hopping (FH) scheme.



FIG. 5 shows a transmission scheme with CDM across symbols.



FIG. 6 shows transmissions for two transmitters with 2-chip spreading codes.



FIG. 7 shows a transmission scheme with CDM across samples.



FIG. 8 shows a transmission scheme with CDM across samples and symbols.



FIG. 9 shows use of different symbol durations for different types of data.



FIG. 10 shows a process for transmitting SC-FDMA symbols with CDM.



FIG. 11 shows a process for receiving SC-FDMA symbols sent with CDM.



FIG. 12 shows a block diagram of a transmitter.



FIG. 13 shows a block diagram of a receiver.



FIG. 14 shows a block diagram of a receive (RX) spatial processor.





DETAILED DESCRIPTION

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.


The transmission techniques described herein may be used for various communication systems. For example, these techniques may be used for an SC-FDMA system that utilizes IFDMA, LFDMA, or EFDMA, an OFDMA system that utilizes orthogonal frequency division multiplexing (OFDM), other FDMA systems, other OFDM-based systems, and so on. Modulation symbols are sent in the time domain with IFDMA, LFDMA, and EFDMA and in the frequency domain with OFDM. In general, the techniques may be used for a system that utilizes one or more multiplexing schemes for the forward and reverse links. For example, the system may utilize (1) SC-FDMA (e.g., IFDMA, LFDMA or EFDMA) for both the forward and reverse links (2) one version of SC-FDMA (e.g., LFDMA) for one link and another version of SC-FDMA (e.g., IFDMA) for the other link, (3) SC-FDMA for the reverse link and OFDMA for the forward link, or (4) some other combination of multiplexing schemes. SC-FDMA, OFDMA, some other multiplexing scheme, or a combination thereof may be used for each link to achieve the desired performance. For example, SC-FDMA and OFDMA may be used for a given link, with SC-FDMA being used for some subbands and OFDMA being used on other subbands. It may be desirable to use SC-FDMA on the reverse link to achieve lower PAPR and to relax the power amplifier requirements for the terminals. It may be desirable to use OFDMA on the forward link to potentially achieve higher system capacity.


The techniques described herein may be used for the forward and reverse links. The techniques may also be used for (1) an orthogonal multiple-access system in which all users within a given cell or sector are orthogonal in time, frequency and/or code and (2) a quasi-orthogonal multiple-access system in which multiple users within the same cell or sector may transmit simultaneously on the same frequency at the same time. A quasi-orthogonal SC-FDMA system supports space division multiple access (SDMA), which uses multiple antennas located at different points in space to support simultaneous transmissions for multiple users.



FIG. 1 shows an SC-FDMA system 100 with multiple (M) transmitters 110a through 110m and a receiver 150. For simplicity, each transmitter 110 is equipped with a single antenna 134, and receiver 150 is equipped with multiple (R) antennas 152a through 152r. For the reverse link, each transmitter 110 may be part of a terminal, and receiver 150 may be part of a base station. For the forward link, each transmitter 110 may be part of a base station, and receiver 150 may be part of a terminal. A base station is generally a fixed station and may also be called a base transceiver system (BTS), an access point, or some other terminology. A terminal may be fixed or mobile and may be a wireless device, a cellular phone, a personal digital assistant (PDA), a wireless modem card, and so on.


At each transmitter 110, a transmit (TX) data and pilot processor 120 encodes, interleaves, symbol maps traffic data and signaling and generates data symbols. The same or different coding and modulation schemes may be used for traffic data and signaling, which are collectively referred to as “data” in portions of the description below. Processor 120 also generates pilot symbols and multiplexes the data symbols and pilot symbols. As used herein, a data symbol is a modulation symbol for data, a pilot symbol is a modulation symbol for pilot, a modulation symbol is a complex value for a point in a signal constellation (e.g., for PSK or QAM), and a symbol is a complex value. A TX CDM processor 122 performs spreading for each type of data to be transmitted with CDM. An SC-FDMA modulator 130 performs SC-FDMA modulation (e.g., for IFDMA, LFDMA, or EFDMA) and generates SC-FDMA symbols. An SC-FDMA symbol may be an IFDMA symbol, an LFDMA symbol, or an EFDMA symbol. A data SC-FDMA symbol is an SC-FDMA symbol for data, and a pilot SC-FDMA symbol is an SC-FDMA symbol for pilot. A transmitter unit (TMTR) 132 processes (e.g., converts to analog, amplifies, filters, and frequency upconverts) the SC-FDMA symbols and generates a radio frequency (RF) modulated signal, which is transmitted via antenna 134.


At receiver 150, R antennas 152a through 152r receive the RF modulated signals from transmitters 110a through 110m, and each antenna provides a received signal to an associated receiver unit (RCVR) 154. Each receiver unit 154 conditions (e.g., filters, amplifies, frequency downconverts, and digitizes) its received signal and provides input samples to an associated demultiplexer (Demux) 156. Each demultiplexer 156 provides input samples for SC-FDMA symbols sent with CDM to an SC-FDMA demodulator (Demod) 160 and provides input samples for SC-FDMA symbols sent without CDM to an RX spatial processor 170. SC-FDMA demodulator 160 performs SC-FDMA demodulation on the input samples and provides received symbols. An RX CDM processor 162 performs the complementary despreading and provides detected data symbols. An RX data processor 164 processes the detected data symbols to recover the data sent with CDM.


RX spatial processor 170 performs receiver spatial processing for each subband used by multiple transmitters and separates out the data symbols sent by these transmitters. RX spatial processor 170 also demultiplexes the detected SC-FDMA symbols for each transmitter. An SC-FDMA demodulator 172 performs SC-FDMA demodulation on the detected SC-FDMA symbols for each transmitter and provides data symbol estimates for that transmitter, which are estimates of the data symbols sent by the transmitter. An RX data processor 174 symbol demaps, deinterleaves, and decodes the data symbol estimates for each transmitter and provides decoded data for that transmitter. In general, the processing by receiver 150 is complementary to the processing by transmitters 110a through 110m.


Controllers 140a through 140m and controller 180 direct the operation of various processing units at transmitters 110a through 110m and receiver 150, respectively. Memories 142a through 142m and memory 182 store program codes and data for transmitters 110a through 110m and receiver 150, respectively.


System 100 may utilize IFDMA, LFDMA, or EFDMA for transmission. The subband structures and symbol generation for IFDMA, LFDMA, and EFDMA are described below.



FIG. 2A shows an exemplary subband structure 200 for IFDMA. The overall system bandwidth of BW MHz is partitioned into multiple (K) orthogonal subbands that are given indices of 1 through K, where K may be any integer value. The spacing between adjacent subbands is BW/K MHz. For simplicity, the following description assumes that all K total subbands are usable for transmission. For subband structure 200, the K subbands are arranged into S disjoint or non-overlapping interlaces. The S interlaces are disjoint in that each of the K subbands belongs in only one interlace. In an embodiment, each interlace contains N subbands that are uniformly distributed across the K total subbands, consecutive subbands in each interlace are spaced apart by S subbands, and interlace u contains subband u as the first subband, where K=S·N and u ε {1, . . . , S}. In general, a subband structure may include any number of interlaces, each interlace may contain any number of subbands, and the interlaces may contain the same or different numbers of subbands. Furthermore, N may or may not be an integer divisor of K, and the N subbands may or may not be uniformly distributed across the K total subbands.



FIG. 2B shows an exemplary subband structure 210 for LFDMA. For subband structure 210, the K total subbands are arranged into S non-overlapping groups. In an embodiment, each group contains N subbands that are adjacent to one another, and group v contains subbands (v−1)·N+1 through v·N, where v is the group index and v ε {1, . . . , S}. N and S for subband structure 210 may be the same or different from N and S for subband structure 200. In general, a subband structure may include any number of groups, each group may contain any number of subbands, and the groups may contain the same or different numbers of subbands.



FIG. 2C shows an exemplary subband structure 220 for EFDMA. For subband structure 220, the K total subbands are arranged into S non-overlapping sets, with each set including G groups of subbands. In an embodiment, the K total subbands are distributed to the S sets as follows. The K total subbands are first partitioned into multiple frequency ranges, with each frequency range containing K′=K/G consecutive subbands. Each frequency range is further partitioned into S groups, with each group including V consecutive subbands. For each frequency range, the first V subbands are allocated to set 1, the next V subbands are allocated to set 2, and so on, and the last V subbands are allocated to set S. Set s, for s=1, . . . , S, includes subbands having indices k that satisfy the following: (s−1)·V≦k modulo (K/G)<s·V. Each set contains G groups of V consecutive subbands, or a total of N=G·V subbands. In general, a subband structure may include any number of sets, each set may contain any number of groups and any number of subbands, and the sets may contain the same or different numbers of subbands. For each set, the groups may contain the same or different numbers of subbands and may be distributed uniformly or non-uniformly across the system bandwidth.


An SC-FDMA system may also utilize a combination of IFDMA, LFDMA, and/or EFDMA. For example, multiple interlaces may be formed for each subband group, and each interlace may be allocated to one or more users for transmission. As another example, multiple subband groups may be formed for each interlace, and each subband group may be allocated to one or more users for transmission. IFDMA, LFDMA, EFDMA, and variants and combinations thereof may be considered as different versions of SC-FDMA. In general, the techniques described herein may be used for any subband structure with any number of subband sets and where each subband set may include any number of subbands that may be arranged in any manner. For each subband set, (1) the subbands may be individually and either uniformly or non-uniformly distributed across the system bandwidth, (2) the subbands may be adjacent to one another in one group, or (3) the subbands may be distributed in multiple groups, where each group may be located anywhere in the system bandwidth and may contain one or multiple subbands.



FIG. 3A shows the generation of an IFDMA symbol for one interlace, an


LFDMA symbol for one subband group, or an EFDMA symbol for one subband set. An original sequence of N modulation symbols to be transmitted in one symbol period on the interlace, subband group, or subband set is denoted as {d1, d2,d3, . . . ,dn} (block 310). The original sequence is transformed to the frequency domain with an N-point discrete Fourier transform (DFT) to obtain a sequence of N frequency-domain values (block 312). The N frequency-domain values are mapped onto the N subbands used for transmission, and K-N zero values are mapped onto the remaining K-N subbands to generate a sequence of K values (block 314). The N subbands used for transmission are in one group of adjacent subbands for LFDMA (as shown in FIG. 3A), are in one interlace with subbands distributed across the K total subbands for IFDMA (not shown in FIG. 3A), and are in one set of multiple groups of subbands for EFDMA (also not shown in FIG. 3A). The sequence of K values is then transformed to the time domain with a K-point inverse discrete Fourier transform (IDFT) to obtain a sequence of K time-domain output samples (block 316).


The last C output samples of the sequence are copied to the start of the sequence to form an IFDMA, LFDMA, or EFDMA symbol that contains K+C output samples (block 318). The C copied output samples are often called a cyclic prefix or a guard interval, and C is the cyclic prefix length. The cyclic prefix is used to combat intersymbol interference (ISI) caused by frequency selective fading, which is a frequency response that varies across the system bandwidth.



FIG. 3B shows the generation of an IFDMA symbol for one interlace for the case in which N is an integer divisor of K and the N subbands are uniformly distributed across the K total subbands. An original sequence of N modulation symbols to be transmitted in one symbol period on the N subbands in interlace u is denoted as {d1, d2, d3, . . . , dN} (block 350). The original sequence is replicated S times to obtain an extended sequence of K modulation symbols (block 352). The N modulation symbols are sent in the time domain and collectively occupy N subbands in the frequency domain. The S copies of the original sequence result in the N occupied subbands being spaced apart by S subbands, with S−1 subbands of zero power separating adjacent occupied subbands. The extended sequence has a comb-like frequency spectrum that occupies interlace 1 in FIG. 2A.


The extended sequence is multiplied with a phase ramp to obtain a frequency-translated sequence of K output samples (block 354). Each output sample in the frequency-translated sequence may be generated as follows:

xn=dn·e−j2π·(n−1)·(u−1)/K, for n=1, . . . , K,   Eq (1)

where dn is the n-th modulation symbol in the extended sequence, xn the n-th output sample in the frequency-translated sequence, and u is the index of the first subband in the interlace. The multiplication with the phase ramp e−j2π·(n−1)·(u−1)/K· in the time domain results in the frequency-translated sequence occupying interlace u in the frequency domain. The last C output samples of the frequency-translated sequence are copied to the start of the frequency-translated sequence to form an IFDMA symbol that contains K+C output samples (block 356).


The processing shown in FIG. 3A may be used to generate IFDMA, LFDMA and EFDMA symbols for any values of N and K. The processing shown in FIG. 3B may be used to generate an IFDMA symbol for the case in which N is an integer divisor of K and the N subbands are uniformly distributed across the K total subbands. The IFDMA symbol generation in FIG. 3B does not require a DFT or an IDFT and may thus be used whenever possible. IFDMA, LFDMA and EFDMA symbols may also be generated in other manners.


The K+C output samples of an SC-FDMA symbol (which may be an IFDMA, LFDMA or EFDMA symbol) are transmitted in K+C sample periods, one output sample in each sample period. An SC-FDMA symbol period (or simply, a symbol period) is the duration of one SC-FDMA symbol and is equal to K+C sample periods. A sample period is also called a chip period.


As generically used herein, a subband set is a set of subbands, which may be an interlace for IFDMA, a subband group for LFDMA, or a set of multiple subband groups for EFDMA. For the reverse link, S users may simultaneously transmit on S subband sets (e.g., S interlaces or S subband groups) to a base station without interfering with one another. For the forward link, the base station may simultaneously transmit on the S subband sets to S users without interference.



FIG. 4 shows a frequency hopping (FH) scheme 400 that may be used for the forward and/or reverse link. Frequency hopping can provide frequency diversity and interference randomization. With frequency hopping, a user may be assigned a traffic channel that is associated with a hop pattern that indicates which subband set(s), if any, to use in each time slot. A hop pattern is also called an FH pattern or sequence, and a time slot is also called a hop period. A time slot is the amount of time spent on a given subband set and typically spans multiple symbol periods. The hop pattern may pseudo-randomly select different subband sets in different time slots.


In an embodiment, one channel set is defined for each link. Each channel set contains S traffic channels that are orthogonal to one another so that no two traffic channels map to the same subband set in any given time slot. This avoids intra-cell/sector interference among users assigned to traffic channels in the same channel set. Each traffic channel is mapped to a specific sequence of time-frequency blocks based on the hop pattern for that traffic channel. A time-frequency block is a specific set of subbands in a specific time slot. For this embodiment, up to S users may be assigned the S traffic channels and would be orthogonal to one another. Multiple users may also be assigned the same traffic channel, and these overlapping users would share the same sequence of time-frequency blocks.


In another embodiment, multiple channel sets may be defined for each link. Each channel set contains S orthogonal traffic channels. The S traffic channels in each channel set may be pseudo-random with respect to the S traffic channels in each of the remaining channel sets. This randomizes interference among users assigned with traffic channels in different channel sets.



FIG. 4 shows an exemplary mapping of traffic channel 1 to a sequence of time-frequency blocks. Traffic channels 2 through S may be mapped to vertically and circularly shifted versions of the time-frequency block sequence for traffic channel 1. For example, traffic channel 2 may be mapped to subband set 2 in time slot 1, subband set 5 in time slot 2, and so on.


In general, multiple users may overlap in a deterministic manner (e.g., by sharing the same traffic channel), a pseudo-random manner (e.g., by using two pseudo-random traffic channels), or a combination of both.


With quasi-orthogonal SC-FDMA, multiple transmitters may transmit on a given time-frequency block. Traffic data, signaling, and/or pilot for these transmitters may be multiplexed using CDM, time division multiplexing (TDM), frequency division multiplexing (FDM), localized frequency division multiplexing (LFDM), and/or some other multiplexing scheme.



FIG. 5 shows a transmission scheme 500 with CDM applied across symbols. Multiple (Q) transmitters are mapped to the same time-frequency block and are assigned Q different spreading codes. The spreading codes may be Walsh codes, OVSF codes, orthogonal codes, pseudo-random codes, and so on. Each spreading code is a sequence of L chips that is denoted as {c1, c2, . . . , cL}, where L≧Q. CDM may be applied on either (1) the modulation symbols prior to SC-FDMA modulation or (2) the SC-FDMA symbols after SC-FDMA modulation. For CDM prior to SC-FDMA modulation, a sequence of modulation symbols {dt,1, dt,2, . . . , dt,N} is replicated L times, and the L replicated sequences are multiplied with the L chips of an assigned spreading code to generate L sequences of scaled modulation symbols. An SC-FDMA symbol is then generated for each sequence of scaled modulation symbols and transmitted in one symbol period. For CDM after SC-FDMA modulation, an SC-FDMA symbol Xt containing K+C output samples is replicated L times, and the L replicated SC-FDMA symbols are multiplied with the L chips of the spreading code to generate L scaled SC-FDMA symbols Xt·c1 through Xt·cL, which are transmitted in L symbol periods.


For the example shown in FIG. 5, the first SC-FDMA symbol X1 is multiplied with the L chips c1 through cL and transmitted in symbol periods 1 through L, the next SC-FDMA symbol X2 is multiplied with the L chips c1 through cL and transmitted in symbol periods L+1 through 2L, and so on. Each SC-FDMA symbol Xt may be for traffic data, signaling, pilot, or a combination thereof.


For CDM across symbol periods, the wireless channel is assumed to be static over the L symbol periods used to transmit an SC-FDMA symbol. To recover SC-FDMA symbol Xt, the receiver multiplies the L scaled SC-FDMA symbols received for that SC-FDMA symbol with the L chips of the assigned spreading code. The receiver then accumulates the L resultant SC-FDMA symbols to obtain a received SC-FDMA symbol for SC-FDMA symbol Xt.



FIG. 6 shows exemplary transmissions for two transmitters with 2-chip spreading codes. For the example shown in FIG. 6, each transmitter transmits signaling in symbol periods 1 and 2, then traffic data in symbol periods 3 through t−1, then pilot in symbol periods t and t+1, then traffic data in symbol periods t+2 through T. Each transmitter generates SC-FDMA symbols in the normal manner, e.g., as shown in FIG. 3A or 3B. Transmitter 1 is assigned a spreading code of {+1, −1}, multiplies the SC-FDMA symbol for signaling with +1 and +1 to generate two scaled SC-FDMA symbols, and transmits these two scaled SC-FDMA symbols in symbol periods 1 and 2. Transmitter 1 also multiplies the SC-FDMA symbol for pilot with +1 and +1 to generate two scaled SC-FDMA symbols and transmits these two scaled SC-FDMA symbols in symbol periods t and t+1. Transmitter 2 is assigned a spreading code of {+1, −1}, multiplies the SC-FDMA symbol for signaling with +1 and −1 to generate two scaled SC-FDMA symbols, and transmits these two scaled SC-FDMA symbols in symbol periods 1 and 2. Transmitter 2 also multiplies the SC-FDMA symbol for pilot with+1 and −1 to generate two scaled SC-FDMA symbols and transmits these two scaled SC-FDMA symbols in symbol periods t and t+1. For the example shown in FIG. 6, transmitters 1 and 2 transmit SC-FDMA symbols for traffic data without CDM.



FIG. 6 shows transmission of traffic data, signaling, and pilot in one time-frequency block. In general, any type of data may be transmitted in a given time-frequency block. For example, traffic data and pilot may be transmitted in each time-frequency block assigned to a transmitter, and signaling may be transmitted as needed, e.g., periodically in every j-th time-frequency block, where j may be any integer value.



FIG. 7 shows a transmission scheme 700 with CDM applied across samples. D modulation symbols may be sent on one set of N subbands in one symbol period, where D≦1 and D may or may not be an integer divisor of N. Each modulation symbol may be for traffic data, signaling, or pilot. Each modulation symbol is replicated L times, and the L replicated symbols are multiplied with the L chips of the assigned spreading code to generate L scaled modulation symbols. For simplicity, FIG. 7 shows the transmission of one SC-FDMA symbol in one symbol period, with D being an integer divisor of N, or D=N/L. The first modulation symbol d1 is multiplied with the L chips c1 through cL to obtain L scaled modulation symbols s1=d1·c1 through sL=d1·cL, the next modulation symbol d2 is multiplied with the L chips c1 through cL to obtain L modulation symbols sL+1=d2·c1 through s2L=d2·cL, and so on, and the last modulation symbol dN/L is multiplied with the L chips c1 through cL to obtain L scaled modulation symbols sN−L+1=dN/L·c1 through sN=dN/L·cL. An SC-FDMA symbol may be generated based on the N scaled modulation symbols s1 through sN. If L=N, then one modulation symbol is sent across all N samples in a symbol period.


To recover a given modulation symbol dn, the receiver multiplies the L scaled modulation symbols received for that modulation symbol with the L chips of the assigned spreading code. The receiver then accumulates the L resultant symbols to obtain a received modulation symbol for modulation symbol dn.



FIG. 8 shows a transmission scheme 800 with CDM applied across samples and symbols. A modulation symbol d may be sent on one set of N subbands in multiple symbol periods. The modulation symbol is replicated L times and multiplied with all L chips of the assigned spreading code to generate L scaled modulation symbols. For simplicity, FIG. 8 shows the case in which L is an integer multiple of N, and the modulation symbol is sent in L/N symbol periods. Modulation symbol d is multiplied with the first N chips c1 through cN of the assigned spreading code to obtain N scaled modulation symbols s1=d·c1 through sN=d·cN for the first SC-FDMA symbol, multiplied with the next N chips cN+1 through c2N to obtain N scaled modulation symbols sN+1=d·cN+1 through s2N=d·c2N for the second SC-FDMA symbol, and so on, and multiplied with the last N chips cL−N+1 through cL to obtain N scaled modulation symbols sL−N+1=d·cL−N+1 through sL=d·cL for the last SC-FDMA symbol. An SC-FDMA symbol may be generated for each sequence of N scaled modulation symbols.


To recover modulation symbol d sent across symbols and samples, the receiver multiplies the L scaled modulation symbols received for that modulation symbol with the L chips of the assigned spreading code. The receiver then accumulates the L resultant symbols to obtain a received modulation symbol for modulation symbol d.



FIGS. 5 through 8 show various schemes for applying CDM in the time domain. Other schemes for applying CDM in the time domain may also be implemented, and this is within the scope of the invention. For example, CDM may be applied across samples in only a portion of an SC-FDMA symbol, e.g., the first L samples of the SC-FDMA symbol. As another example, CDM may be applied across symbols for some sample indices and not applied for other sample indices. As yet another example, CDM may be applied on multiple modulation symbols, and each modulation symbol may be sent across both samples and symbols.


CDM may also be applied across subbands in the frequency domain. D modulation symbols may be sent on one set of N subbands in one symbol period, where D≧1 and D may or may not be an integer divisor of N. A D-point DFT may be performed on the D modulation symbols to obtain D frequency-domain values. Each frequency-domain value is then replicated L times, and the L replicated values are multiplied with the L chips of the assigned spreading code to generate L scaled values. A total of N scaled values are obtained for the D frequency-domain values and are mapped onto the N subbands used for transmission. Zero values are mapped onto the remaining subbands. A K-point IDFT is then performed on the K scaled and zero values to generate K time-domain output samples. An SC-FDMA symbol is formed by appending a cyclic prefix to the K output samples. CDM across subbands is similar to CDM across samples shown in FIG. 7, albeit with the vertical axis representing subband (instead of sample period) and d1 through dN/L representing the D frequency-domain values (instead of modulation symbols).


For CDM across subbands, the wireless channel is assumed to be static over the L subbands used to transmit a frequency-domain value, which are the subbands on which the L-chip spreading code is applied. To recover the D modulation symbols, the receiver obtains K+C input samples for the SC-FDMA symbol, removes the cyclic prefix, performs a K-point DFT on K input samples to obtain K received values, and retains N received values for the N subbands used for transmission. The receiver then multiplies the L received values for each transmitted frequency-domain value with the L chips of the spreading code, and accumulates the L resultant values to obtain a received frequency-domain value for the transmitted frequency-domain value. The receiver then performs a D-point IDFT on D received frequency-domain values to obtain D received modulation symbols.


In general, CDM may be applied in the time domain (e.g., as shown in FIGS. 5 through 8) or in the frequency domain. Applying CDM in the time domain may result in a lower peak-to-average power ratio (PAPR) than applying CDM in the frequency domain.


A transmitter may perform scrambling on the scaled and/or unscaled modulation symbols. Each transmitter may be assigned a scrambling code that is pseudo-random with respect to the scrambling codes assigned to other transmitters. Transmitter m may multiply each (scaled or unscaled) modulation symbol with a chip of an assigned scrambling code Sm prior to SC-FDMA modulation. The scrambling randomizes the interference caused by transmitter m to other transmitters transmitting on the same time-frequency block. The scrambling also allows the receiver to estimate the interference from other cells based on the unassigned spreading codes (e.g., if different sectors use different scrambling codes, and all transmitters within a sector use the same scrambling code), as described below. Scrambling may be performed on all types of data, on certain types of data, on data sent with CDM, and so on.


In the description above, the SC-FDMA symbols for different types of data have the same duration, and each SC-FDMA symbol is transmitted in K+C sample periods. SC-FDMA symbols of different durations may be generated for different types of data.



FIG. 9 shows a transmission scheme 900 with different symbol durations for different types of data. For transmission scheme 900, an SC-FDMA symbol for traffic data is composed of NT output samples that are transmitted in NT sample periods, an SC-FDMA symbol for signaling is composed of NS output samples that are transmitted in NS sample periods, and an SC-FDMA symbol for pilot is composed of NP output samples that are transmitted in NP sample periods, where NT, NS, and NP may each be any integer value. For example, NT may be equal to K+C, NS may be equal to K/MS+C, and NP may be equal to K/MP+C, where MS and MP may each be any integer value. As an example, a shortened SC-FDMA symbol for pilot may have half the duration of a normal SC-FDMA symbol for traffic data (not counting the cyclic prefix). In this case, there are K/2 total “wider” subbands for pilot, with each wider subband having twice the width of a “normal” subband for traffic data. As a specific example, K may be equal to 512, C may be equal to 32, NT may be equal to K+C=544, NS may be equal to K/2+C=288, and NP may also be equal to K/2+C=288. An SC-FDMA symbol with NT, NS, or NP output samples may be generated, e.g., as shown in FIG. 3A.


For LFDMA, a shortened SC-FDMA symbol and a normal SC-FDMA symbol may occupy the same portion of the system bandwidth. For IFDMA, there is no direct mapping between the wider subbands for a shortened SC-FDMA symbol and the normal subbands for a normal SC-FDMA symbol, for a given interlace. N wider subbands may be formed with multiple interlaces and divided into multiple subsets of wider subbands, which may be allocated to multiple transmitters assigned to these interlaces. Each transmitter may generate a shortened IFDMA symbol with the modulation symbols mapped onto the assigned subset of wider subbands.


CDM may be applied to SC-FDMA symbols of different durations. For the example shown in FIG. 9, a shortened SC-FDMA symbol may be generated for pilot and sent using CDM in L shortened symbol periods to reduce the amount of overhead of pilot. A shortened SC-FDMA symbol may also be generated for signaling and sent using CDM in L shortened symbol periods. Traffic data may be sent using normal SC-FDMA symbols.


In general, CDM may be applied to any type of data, e.g., traffic data, signaling, and/or pilot. For example, CDM may be applied to signaling and pilot but not traffic data, as shown in FIG. 6. As another example, CDM may be applied to signaling (e.g., for a control channel), but not traffic data or pilot. CDM may also be applied to a portion of a time slot (as shown in FIG. 6) or across an entire time-frequency block (e.g., as shown in FIG. 5). CDM may also be selectively applied, e.g., applied under poor channel conditions and not applied under good channel conditions.


CDM may improve reliability for a transmission sent in poor channel conditions. A transmitter may be constrained by a certain maximum transmit power level, which may be imposed by regulatory bodies or design limitations. In this case, a CDM transmission scheme allows the transmitter to transmit an SC-FDMA symbol over a longer time interval. This allows the receiver to collect more energy for the SC-FDMA symbol, which enables the receiver to perform detection at a lower SNR and/or derive a higher quality channel estimate. CDM may also whiten the interference caused to other transmitters, which may improve performance for these other transmitters.



FIG. 10 shows a process 1000 for transmitting SC-FDMA symbols with CDM. Modulation symbols for traffic data, signaling, and pilot are generated (block 1012). CDM is performed with an assigned spreading code Cm on the modulation symbols for traffic data, signaling, and/or pilot (block 1014). CDM may be performed for symbol periods used by multiple transmitters for transmission. CDM may also be performed across symbols, across samples, across both samples and symbols, across subbands, and so on. Scrambling may be performed with an assigned scrambling code Sm after the spreading (block 1016). SC-FDMA symbols of the same or different durations are generated for traffic data, signaling, and pilot (block 1018) and transmitted to the receiver.



FIG. 11 shows a process 1100 for receiving SC-FDMA symbols transmitted with CDM. SC-FDMA symbols are received for traffic data, signaling, and pilot sent by multiple transmitters (block 1112). Data transmitted with CDM may be separately recovered for each transmitter. The processing for one transmitter m may be performed as follows. SC-FDMA demodulation is performed to obtain received symbols for transmitter m (block 1114). Descrambling is performed (if applicable) on the received symbols with the scrambling code Sm assigned to transmitter m (block 1116). Despreading is performed on SC-FDMA symbols sent with CDM based on the spreading code Cm assigned to transmitter m (block 1118). An interference estimate may be derived based on the spreading codes not assigned to any transmitter (block 1120). A channel estimate may be derived for transmitter m based on a received pilot for the transmitter (block 1122). The channel estimate and interference estimate may be used for data detection (e.g., equalization), receiver spatial processing, and so on (block 1124). For example, coherent or non-coherent data detection may be performed for signaling sent with CDM, and receiver spatial processing may be performed for traffic data sent without CDM.


The receiver may derive an interference estimate during symbol periods in which CDM is applied. If L spreading codes are available and Q spreading codes are assigned to the transmitters, where Q<L, then the receiver may derive the interference estimate based on the L−Q unassigned spreading codes. For example, one or more spreading codes may be reserved for interference estimation and not assigned to any transmitter. For symbol periods in which CDM is applied, the receiver performs despreading with each of the Q assigned spreading codes to recover the transmissions sent by the transmitters. The receiver may also perform despreading with each of the L−Q unassigned spreading codes to obtain an interference estimate for that unassigned spreading code. For CDM across symbols, the interference estimate for an unassigned spreading code may be derived as follows:











N
j

=


1

N
·
L










n
=
1

N






i
=
1

L




r


(


t
i

,
n

)


·

c

i
,
j







2



,




Eq






(
2
)









where r(ti, n) is a received symbol for sample period n in symbol period ti;


ci,j is the i-th chip of the j-th unassigned spreading code; and


Nj is an interference estimate for the j-th unassigned spreading code.


Equation (2) despreads and accumulates the received symbols across L symbol periods t1 through tL and further averages the results across N sample periods. The receiver may average the interference estimates for all L−Q unassigned spreading codes to obtain an average interference estimate {circumflex over (N)}o, as follows:











N
^

0

=


1

L
-
Q


·




j
=
1


L
-
Q





N
j

.







Eq






(
3
)








The receiver may also derive an interference estimate for CDM across samples and CDM across both samples and symbols. In general, the receiver may despread across samples and/or symbols in a manner complementary to the spreading performed by the transmitter and may then accumulate the despread results across the samples and/or symbols.


The receiver may average the interference estimate across samples, symbols, and/or subbands in a given time-frequency block to obtain a short-term interference estimate. The receiver may also average the interference estimate across multiple time-frequency blocks to obtain a long-term interference estimate. The receiver may use the short-term interference estimate for channel estimation, data detection, receiver spatial processing, and so on. The receiver may use the long-term interference estimate to ascertain the operating conditions and/or for other purposes


For channel estimation, the receiver obtains a received SC-FDMA symbol for each symbol period used for pilot transmission by a given transmitter. The receiver may remove the cyclic prefix from the received SC-FDMA symbol, perform SC-FDMA demodulation, descrambling and despreading, and obtain received pilot values for the subbands used for pilot transmission. The received pilot values may be expressed as:

Rp(k)=H(kP(k)+N(k), for k ε Kp,   Eq (4)

where P(k) is a transmitted pilot value for subband k;


H(k) is a complex gain for the wireless channel for subband k;


Rp(k) is a received pilot value for subband k;


N(k) is the noise and interference for subband k; and


Kp is the set of subbands used for pilot transmission.


The receiver may estimate N(k) based on the unassigned spreading codes, e.g., as described above. Alternatively, N(k) may be assumed to be additive white Gaussian noise (AWGN) with zero mean and a variance of N0.


The receiver may estimate the frequency response of the wireless channel using a minimum mean-square error (MMSE) technique or some other technique. For the MMSE technique, the receiver may derive an initial frequency response estimate for the wireless channel, as follows:













H
^



(
k
)


=




R
p



(
k
)


·


P
*



(
k
)








P


(
k
)




2

+


N
^

0




,




for








k


K
p


,





Eq






(
5
)









where Ĥ(k) is a channel gain estimate for subband k and “*” denotes a complex conjugate. If |P(k)|==b 1 for all values of k, then equation (5) may be expressed as:













H
^



(
k
)


=




R
p



(
k
)


·


P
*



(
k
)




1
+


N
^

0




,




for

















k



K
p

.






Eq






(
6
)









The receiver may also derive a channel estimate in other manners.


For data detection, the receiver obtains a received SC-FDMA symbol for each symbol period used for data transmission by the transmitter. The receiver may remove the cyclic prefix from the received SC-FDMA symbol, perform SC-FDMA demodulation, descrambling and despreading, and obtain received data values for the subbands used for data transmission. The received data values may be expressed as:

Rd(k)=H(kD(k)+N(k), for k ε Kd,   Eq (7)

where D(k) is a transmitted data value for subband k;


Rd(k) is a received data value for subband k; and


Kd is the set of subbands used for data transmission.


The receiver may perform data detection (or equalization) in the frequency domain on the received data values using the MMSE technique, as follows:













Z
d



(
k
)


=




R
d



(
k
)


·



H
^

*



(
k
)









H
^



(
k
)




2

+


N
^

0




,




for








k


K
d


,





Eq






(
8
)









where Zd(k) is a detected data value for subband k. Equation (8) is for data detection for one antenna. For multiple antennas, the receiver may derive a spatial filter matrix based on (1) the channel estimates for all transmitters transmitting in the same symbol period and (2) possibly the interference estimate. The receiver may then perform receiver spatial processing based on the spatial filter matrix to obtain the detected data values for each transmitter. The detected data values for all data subbands may be transformed with an IDFT/IFFT to obtain data symbol estimates.



FIG. 12 shows an embodiment of transmitter 110m. Within TX data and pilot processor 120m, an encoder 1212 encodes traffic data based on a coding scheme selected for traffic data. An interleaver 1214 interleaves or reorders the coded traffic data based on an interleaving scheme. A symbol mapper 1216 maps the interleaved data bits to modulation symbols based on a modulation scheme selected for traffic data. An encoder 1222 encodes signaling based on a coding scheme selected for signaling. An interleaver 1224 interleaves the coded signaling based on an interleaving scheme. A symbol mapper 1226 maps the interleaved signaling bits to modulation symbols based on a modulation scheme selected for signaling. A pilot generator 1232 generates modulation symbols for pilot, e.g., based on a polyphase sequence having good temporal characteristics (e.g., a constant time-domain envelope) and good spectral characteristics (e.g., a flat frequency spectrum). A multiplexer (Mux) 1238 multiplexes the modulation symbols for traffic data, signaling, and pilot onto the appropriate sample periods and symbol periods.


TX CDM processor 122m performs spreading for CDM and scrambling. Within a CDM spreader 1240, a repetition unit 1242 repeats modulation symbols to be sent with CDM. A multiplier 1244 multiplies the replicated symbols with the L chips of an assigned spreading code Cm and provides scaled modulation symbols. The same or different spreading codes may be used for different types of data. A multiplexer 1246 receives the unscaled modulation symbols from processor 120m and the scaled modulation symbols from CDM spreader 1240, provides the unscaled modulation symbols if CDM is not applied, and provides the scaled modulation symbols if CDM is applied. A multiplier 1248 multiplies the modulation symbols from multiplexer 1246 with an assigned scrambling code Sm and provides processed modulation symbols.


Within controller/processor 140m, an FH generator determines the set of subbands to use for transmission in each time slot, e.g., based on a hop pattern assigned to transmitter 110m. SC-FDMA modulator 130m generates SC-FDMA symbols for traffic data, signaling, and pilot such that the modulation symbols are sent on the assigned subbands.



FIG. 13 shows an embodiment of SC-FDMA demodulator 160, RX CDM processor 162, and RX data processor 164 at receiver 150 for data sent with CDM. For simplicity, FIG. 15 shows the processing to recover the data sent by one transmitter m.


Within SC-FDMA demodulator 160, R SC-FDMA demodulators 1310a through 1310r receive the input samples from R demultiplexers 156a through 156r, respectively. Each SC-FDMA demodulator 1310 performs SC-FDMA demodulation on its input samples and provides received symbols. Within RX CDM processor 162, R multipliers 1318a through 1318r obtain the received symbols from SC-FDMA demodulators 1310a through 1310r, respectively. For each receive antenna, multiplier 1318 multiples the received symbols with the scrambling code Sm assigned to transmitter m. A CDM despreader 1320 performs despreading for transmitter m. Within CDM despreader 1320, a multiplier 1322 multiplies the descrambled symbols from multiplier 1318 with the spreading code Cm assigned to transmitter m. An accumulator 1324 accumulates the output of multiplier 1322 over the length of the spreading code and provides despread symbols. A CDM despreader 1330 performs despreading for each unassigned spreading code. An interference estimator 1332 derives an interference estimate for each unassigned spreading code, e.g., as shown in equation (2).


Within RX data processor 164, a data combiner 1340 combines the despread symbols across the R receive antennas. An interference combiner 1342 combines the interference estimates across the R receive antennas, e.g., as shown in equation (3). Combiner 1340 and/or 1342 may perform maximal ratio combining (MRC) and may give more weight to symbols with greater reliability, e.g., symbols with less interference. A data detector 1344 performs non-coherent detection for the data symbols sent with CDM. Although not shown in FIG. 13, RX data processor 164 may also perform deinterleaving and decoding if interleaving and encoding, respectively, are performed by transmitter m for the data sent with CDM.



FIG. 14 shows an embodiment of RX spatial processor 170. R DFT units 1410a through 1410r receive the input samples from R demultiplexers 156a through 156r, respectively. Each DFT unit 1410 performs a DFT on the input samples for each symbol period to obtain frequency-domain values for that symbol period. R demultiplexers/channel estimators 1420a through 1420r receive the frequency-domain values from DFT units 1410a through 1410r, respectively. Each demultiplexer 1420 provides frequency-domain values for data (or received data values) to K subband spatial processors 1432a through 1432k.


Each channel estimator 1420 performs descrambling and despreading on the frequency-domain values for pilot (or received pilot values), if the pilot was transmitted with scrambling and CDM, respectively. Each channel estimator 1420 derives a channel estimate for each transmitter based on the received pilot values for that transmitter. A spatial filter matrix computation unit 1434 forms a channel response matrix H(k,t) for each subband in each time slot based on the channel estimates for all transmitters using that subband and time slot. Computation unit 1434 then derives a spatial filter matrix M(k,t) for each subband of each time slot based on the channel response matrix H(k,t) and using zero-forcing (ZF), MMSE, or MRC technique. Computation unit 1434 provides K spatial filter matrices for the K subbands in each time slot.


Each subband spatial processor 1432 receives the spatial filter matrix for its subband, performs receiver spatial processing on the received data values with the spatial filter matrix, and provides detected data values. A demultiplexer 1436 maps the detected data values for each transmitter onto detected SC-FDMA symbols. A detected SC-FDMA symbol for a given transmitter is an SC-FDMA symbol that is obtained by receiver 150 for that transmitter with the interference from the other transmitters suppressed via the receiver spatial processing. SC-FDMA demodulator 172 processes each detected SC-FDMA symbol and provides data symbol estimates to RX data processor 174. SC-FDMA demodulator 172 may perform IDFT/IFFT, equalization, demapping of the data symbol estimates from the assigned subbands, and so on. SC-FDMA demodulator 172 also maps the data symbol estimates for the M transmitters onto M streams based on the traffic channels assigned to these transmitters. An FH generator within controller 180 determines the subbands used by each transmitter based on the hop pattern assigned to that transmitter. RX data processor 174 symbol demaps, deinterleaves, and decodes the data symbol estimates for each transmitter and provides the decoded data.


For the embodiment shown in FIG. 14, the receiver processing includes receiver spatial processing and SC-FDMA demodulation. The receiver spatial processing operates on frequency-domain values. The SC-FDMA demodulation includes the DFT/FFT performed by DFT units 1410 on the input samples to obtain frequency-domain values and the IDFT/IFFT performed by SC-FDMA demodulator 172 on the detected data values to obtain data symbol estimates. The receiver spatial processing and SC-FDMA demodulation may also be performed in other manners.


The techniques described herein may be implemented by various means. For example, these techniques may be implemented in hardware, software, or a combination thereof. For a hardware implementation, the processing units at a transmitter 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, electronic devices, other electronic units designed to perform the functions described herein, or a combination thereof. The processing units at a receiver may also be implemented with one or more ASICs, DSPs, processors, and so on.


For a software implementation, the techniques 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 (e.g., memory 142 or 182 in FIG. 1) and executed by a processor (e.g., controller 140 or 180). The memory unit may be implemented within the processor or external to the processor.


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.

Claims
  • 1. An apparatus for wireless communication, comprising: a processor operative to generate a modulation symbol for control information, to spread the modulation symbol for the control information with a spreading code by replicating the modulation symbol L times and multiplying the replicated modulation symbols with L chips of the spreading code to obtain L spread modulation symbols, where L is a length of the spreading code, and to generate at least one single-carrier frequency division multiple access (SC-FDMA) symbol based on the L spread modulation symbols and a set of contiguous subcarriers used for transmission; anda memory coupled to the processor.
  • 2. The apparatus of claim 1, wherein the processor is operative to perform spreading over at least one symbol period used by at least two transmitters for transmission.
  • 3. The apparatus of claim 1, wherein the processor is operative to perform scrambling with a scrambling code.
  • 4. The apparatus of claim 3, wherein different sectors are assigned different scrambling codes.
  • 5. The apparatus of claim 1, wherein the processor is operative to perform spreading across symbols.
  • 6. The apparatus of claim 1, wherein the processor is operative to generate L SC-FDMA symbols based on the L spread modulation symbols.
  • 7. The apparatus of claim 1, wherein the processor is operative to generate an SC-FDMA symbol, to replicate the SC-FDMA symbol L times, and to multiply the replicated SC-FDMA symbols with the L chips of a-the spreading code.
  • 8. The apparatus of claim 1, wherein the processor is operative to perform spreading across samples.
  • 9. The apparatus of claim 1, wherein the processor is operative to generate a single SC-FDMA symbol based on the L spread modulation symbols.
  • 10. The apparatus of claim 1, wherein the processor is operative to perform spreading across both symbols and samples.
  • 11. The apparatus of claim 1, wherein the processor is operative to generate at least two SC-FDMA symbols based on the L spread modulation symbols.
  • 12. The apparatus of claim 1, wherein the processor is operative to perform spreading across subcarriers.
  • 13. The apparatus of claim 1, wherein at least one other spreading code is not assigned to any transmitter and is reserved for interference estimation.
  • 14. The apparatus of claim 1, wherein the processor is operative to generate modulation symbols for at least two types of data and to perform spreading for at least one type of data among the at least two types of data.
  • 15. The apparatus of claim 1, wherein the processor is operative to generate modulation symbols for traffic data and control information and to perform spreading for control information.
  • 16. The apparatus of claim 1, wherein the processor is operative to generate SC-FDMA symbols having at least two different durations.
  • 17. The apparatus of claim 1, wherein the processor is operative to generate modulation symbols for traffic data and control information, to generate SC-FDMA symbols having a first duration for traffic data, and to generate SC-FDMA symbols having a second duration for control information, the second duration being shorter or longer than the first duration.
  • 18. The apparatus of claim 1, wherein the processor is operative to generate modulation symbols for traffic data and pilot, to generate SC-FDMA symbols having a first duration for traffic data, and to generate SC-FDMA symbols having a second duration for pilot, the second duration being shorter or longer than the first duration.
  • 19. The apparatus of claim 1, wherein the processor is operative to generate SC-FDMA symbols having a first duration for data sent without spreading and to generate SC-FDMA symbols having a second duration for data sent with spreading, the second duration being shorter or longer than the first duration.
  • 20. The apparatus of claim 1, further comprising: a controller operative to determine different sets of subcarriers to use for transmission in different time slots based on a frequency hopping pattern.
  • 21. A method of wireless communication, comprising: generating a modulation symbol for control information;spreading the modulation symbol for the control information with a spreading code by replicating the modulation symbol L times and multiplying the replicated modulation symbols with L chips of the spreading code to obtain L spread modulation symbols, where L is a length of the spreading code; andgenerating at least one single-carrier frequency division multiple access (SC-FDMA) symbol based on the L spread modulation symbols and a set of contiguous subcarriers used for transmission.
  • 22. The method of claim 21, further comprising: performing scrambling with a scrambling code.
  • 23. The method of claim 21, wherein the spreading comprises spreading the modulation symbol with the spreading code across symbols, or across samples, or across subcarriers, or a combination thereof.
  • 24. The method of claim 21, wherein the spreading comprises spreading the modulation symbol with the spreading code for at least one type of data among at least two types of data being transmitted.
  • 25. The method of claim 21, further comprising: generating SC-FDMA symbols having at least two different durations for at least two types of data being transmitted.
  • 26. The method of claim 21, further comprising: performing spreading over at least one symbol period used by at least two transmitters for transmission.
  • 27. The method of claim 21, wherein the generating the at least one SC-FDMA symbol comprises generating L SC-FDMA symbols based on the L spread modulation symbols.
  • 28. The method of claim 21, wherein the generating the at least one SC-FDMA symbol comprises generating a single SC-FDMA symbol based on the L spread modulation symbols.
  • 29. An apparatus for wireless communication, comprising: means for generating a modulation symbol for control information;means for spreading the modulation symbol for the control information with a spreading code by replicating the modulation symbol L times and multiplying the replicated modulation symbols with L chips of the spreading code to obtain L spread modulation symbols, where L is a length of the spreading code; andmeans for generating at least one single-carrier frequency division multiple access (SC-FDMA) symbol based on the L spread modulation symbols and a set of contiguous subcarriers used for transmission.
  • 30. The apparatus of claim 29, further comprising: means for performing scrambling with a scrambling code.
  • 31. The apparatus of claim 29, wherein the means for spreading comprises means for spreading the modulation symbol with the spreading code across symbols, or across samples, or across subcarriers, or a combination thereof.
  • 32. The apparatus of claim 29, wherein the means for spreading comprises means for spreading the modulation symbol with the spreading code for at least one type of data among at least two types of data being transmitted.
  • 33. The apparatus of claim 29, further comprising: means for generating SC-FDMA symbols having at least two different durations for at least two types of data being transmitted.
  • 34. The apparatus of claim 29, further comprising: means for performing spreading over at least one symbol period used by at least two transmitters for transmission.
  • 35. The apparatus of claim 29, wherein the means for generating the at least one SC-FDMA symbol comprises means for generating L SC-FDMA symbols based on the L spread modulation symbols.
  • 36. The apparatus of claim 29, wherein the means for generating the at least one SC-FDMA symbol comprises means for generating a single SC-FDMA symbol based on the L spread modulation symbols.
  • 37. An apparatus for wireless communication, comprising: a processor operative to receive at least one single-carrier frequency division multiple access (SC-FDMA) symbol comprising control information, to perform SC-FDMA demodulation on the at least one received SC-FDMA symbol to obtain received symbols from a set of contiguous subcarriers used for transmission in at least one symbol period, and to despread the received symbols with L chips of a spreading code to recover a modulation symbol for the control information, where L is a length of the spreading code; anda memory coupled to the processor.
  • 38. The apparatus of claim 37, wherein multiple transmitters transmit SC-FDMA symbols with spreading in the at least one symbol period assigned to the transmitters for transmission.
  • 39. The apparatus of claim 37, wherein the processor is operative to perform despreading across symbols, or across samples, or across subcarriers, or a combination thereof.
  • 40. The apparatus of claim 37, wherein the processor is operative to perform descrambling with a scrambling code.
  • 41. The apparatus of claim 37, wherein the processor is operative to derive an interference estimate based on at least one other spreading code not assigned to any transmitter.
  • 42. The apparatus of claim 41, wherein the processor is operative to perform data detection based on the interference estimate.
  • 43. The apparatus of claim 41, wherein the processor is operative to derive a channel estimate and to perform data detection based on the channel estimate and the interference estimate.
  • 44. The apparatus of claim 37, wherein the processor is operative to obtain despread symbols for multiple antennas, to combine the despread symbols across the multiple antennas, and to perform data detection after combining across the multiple antennas.
  • 45. The apparatus of claim 37, wherein the processor is operative to perform receiver spatial processing for SC-FDMA symbols transmitted without spreading by at least two transmitters in a symbol period.
  • 46. The apparatus of claim 37, further comprising: a controller operative to determine different sets of subcarriers used for transmission in different time slots based on a frequency hopping pattern.
  • 47. The apparatus of claim 37, wherein the processor is operative to perform SC-FDMA demodulation on L received SC-FDMA symbols to obtain received symbols for L symbol periods, and to despread the received symbols with the L chips of the spreading code to recover the modulation symbol.
  • 48. The apparatus of claim 37, wherein the processor is operative to perform SC-FDMA demodulation on a single received SC-FDMA symbol to obtain received symbols for L sample periods or L subcarriers, and to despread the received symbols with the L chips of the spreading code to recover the modulation symbol.
  • 49. A method of wireless communication, comprising: receiving at least one single-carrier frequency division multiple access (SC-FDMA) symbol comprising control information;performing SC-FDMA demodulation on the at least one received SC-FDMA symbol to obtain received symbols from a set of contiguous subcarriers used for transmission in at least one symbol period; anddespreading the received symbols with L chips of a spreading code to recover a modulation symbol for the control information, where L is a length of the spreading code.
  • 50. The method of claim 49, wherein the despreading comprises despreading the received symbols with the spreading code across symbols, or across samples, or across subcarriers, or a combination thereof
  • 51. The method of claim 49, further comprising: performing descrambling with a scrambling code.
  • 52. The method of claim 49, further comprising: deriving an interference estimate based on at least one other spreading code not assigned to any transmitter.
  • 53. The method of claim 49, wherein the performing SC-FDMA demodulation comprises performing SC-FDMA demodulation on L received SC-FDMA symbols to obtain received symbols for L symbol periods, and wherein the despreading comprises despreading the received symbols for the L symbol periods with the L chips of the spreading code to recover the modulation symbol.
  • 54. The method of claim 49, wherein the performing SC-FDMA demodulation comprises performing SC-FDMA demodulation on a single received SC-FDMA symbol to obtain received symbols for L sample periods or L subcarriers, and wherein the despreading comprises despreading the received symbols for the L sample periods or the L subcarriers with the L chips of the spreading code to recover the modulation symbol.
  • 55. An apparatus for wireless communication, comprising: means for receiving at least one single-carrier frequency division multiple access (SC-FDMA) symbol comprising control information;means for performing SC-FDMA demodulation on the at least one received SC-FDMA symbol to obtain received symbols from a set of contiguous subcarriers used for transmission in at least one symbol period; andmeans for despreading the received symbols with L chips of a spreading code to recover a modulation symbol for the control information, where L is a length of the spreading code.
  • 56. The apparatus of claim 55, further comprising: means for performing descrambling with a scrambling code.
  • 57. The apparatus of claim 55, wherein the means for despreading comprises means for despreading the received symbols with the spreading code across symbols, or across samples, or across subcarriers, or a combination thereof.
  • 58. The apparatus of claim 55, further comprising: means for deriving an interference estimate based on at least one other spreading code not assigned to any transmitter.
  • 59. The apparatus of claim 55, wherein the means for performing SC-FDMA demodulation comprises means for performing SC-FDMA demodulation on L received SC-FDMA symbols to obtain received symbols for L symbol periods, and wherein the means for despreading comprises means for despreading the received symbols for the L symbol periods with the L chips of the spreading code to recover the modulation symbol.
  • 60. The apparatus of claim 55, wherein the means for performing SC-FDMA demodulation comprises means for performing SC-FDMA demodulation on a single received SC-FDMA symbol to obtain received symbols for L sample periods or L subcarriers, and wherein the means for despreading comprises means for despreading the received symbols for the L sample periods or the L subcarriers with the L chips of the spreading code to recover the modulation symbol.
  • 61. A non-transitory computer-readable medium comprising: code for causing at least one processor to generate a modulation symbol for control information,code for causing the at least one processor to spread the modulation symbol for the control information with a spreading code by replicating the modulation symbol L times and multiplying the replicated modulation symbols with L chips of the spreading code to obtain L spread modulation symbols, where L is a length of the spreading code, andcode for causing the at least one processor to generate at least one single-carrier frequency division multiple access (SC-FDMA) symbol based on the L spread modulation symbols and a set of contiguous subcarriers used for transmission.
  • 62. A non-transitory computer-readable medium comprising: code for causing at least one processor to receive at least one single-carrier frequency division multiple access (SC-FDMA) symbol comprising control information,code for causing the at least one processor to perform SC-FDMA demodulation on the at least one received SC-FDMA symbol to obtain received symbols from a set of contiguous subcarriers used for transmission in at least one symbol period, andcode for causing the at least one processor to despread the received symbols with L chips of a spreading code to recover a modulation symbol for the control information, where L is a length of the spreading code.
CLAIM OF PRIORITY UNDER 35 U.S.C. §119

The present Application for Patent claims priority to Provisional Application No. 60/706,639 entitled “CODE DIVISION MULTIPLEXING IN A SINGLE-CARRIER FREQUENCY DIVISION MULTIPLE ACCESS SYSTEM” filed Aug. 8, 2005, and Ser. No. 60/710,503 entitled “CODE DIVISION MULTIPLEXING IN A SINGLE-CARRIER FREQUENCY DIVISION MULTIPLE ACCESS SYSTEM” filed Aug. 22, 2005, and Ser. No. 60/710,428 entitled “CODE DIVISION MULTIPLEXING IN A SINGLE-CARRIER FREQUENCY DIVISION MULTIPLE ACCESS SYSTEM” filed Aug. 22, 2005, all assigned to the assignee hereof and hereby expressly incorporated by reference herein.

US Referenced Citations (760)
Number Name Date Kind
4393276 Steele Jul 1983 A
4554668 Deman et al. Nov 1985 A
4747137 Matsunaga May 1988 A
4783779 Takahata et al. Nov 1988 A
4783780 Alexis Nov 1988 A
4975952 Mabey et al. Dec 1990 A
5008900 Critchlow et al. Apr 1991 A
5115248 Roederer et al. May 1992 A
5268694 Jan et al. Dec 1993 A
5282222 Fattouche et al. Jan 1994 A
5363408 Paik et al. Nov 1994 A
5371761 Daffara et al. Dec 1994 A
5384810 Amrany Jan 1995 A
5406551 Saito et al. Apr 1995 A
5410538 Roche et al. Apr 1995 A
5455839 Eyuboglu Oct 1995 A
5465253 Rahnema Nov 1995 A
5491727 Petit Feb 1996 A
5513379 Benveniste et al. Apr 1996 A
5539748 Raith et al. Jul 1996 A
5548582 Brajal et al. Aug 1996 A
5583869 Grube et al. Dec 1996 A
5594738 Crisler et al. Jan 1997 A
5604744 Andersson et al. Feb 1997 A
5612978 Blanchard et al. Mar 1997 A
5625876 Gilhousen et al. Apr 1997 A
5684491 Newman et al. Nov 1997 A
5726978 Frodigh et al. Mar 1998 A
5732113 Schmidl et al. Mar 1998 A
5745487 Hamaki Apr 1998 A
5768276 Diachina et al. Jun 1998 A
5790537 Yoon et al. Aug 1998 A
5812938 Gilhousen et al. Sep 1998 A
5815488 Williams et al. Sep 1998 A
5822368 Wang Oct 1998 A
5828650 Malkamaki et al. Oct 1998 A
5838268 Frenkel Nov 1998 A
5867478 Baum et al. Feb 1999 A
5870393 Yano et al. Feb 1999 A
5887023 Mabuchi Mar 1999 A
5907585 Suzuki et al. May 1999 A
5920571 Houck et al. Jul 1999 A
5926470 Tiedemann, Jr. et al. Jul 1999 A
5933421 Alamouti et al. Aug 1999 A
5949814 Odenwalder et al. Sep 1999 A
5953325 Willars et al. Sep 1999 A
5955992 Shattil Sep 1999 A
5956642 Larsson et al. Sep 1999 A
5995992 Eckard et al. Nov 1999 A
5999826 Whinnett Dec 1999 A
6002942 Park et al. Dec 1999 A
6016123 Barton et al. Jan 2000 A
6038150 Yee et al. Mar 2000 A
6038263 Kotzin et al. Mar 2000 A
6038450 Brink et al. Mar 2000 A
6052364 Chalmers et al. Apr 2000 A
6061337 Light et al. May 2000 A
6067315 Sandin May 2000 A
6075350 Peng et al. Jun 2000 A
6075797 Thomas Jun 2000 A
6076114 Wesley et al. Jun 2000 A
6088345 Sakoda et al. Jul 2000 A
6088592 Doner et al. Jul 2000 A
6108323 Gray et al. Aug 2000 A
6108550 Wiorek et al. Aug 2000 A
6112094 Dent Aug 2000 A
6128776 Kang et al. Oct 2000 A
6138037 Jaamies Oct 2000 A
6141317 Marchok et al. Oct 2000 A
6154484 Lee et al. Nov 2000 A
6169910 Tamil et al. Jan 2001 B1
6172993 Kim et al. Jan 2001 B1
6175550 van Nee Jan 2001 B1
6175650 Sindhu et al. Jan 2001 B1
6176550 Lamart et al. Jan 2001 B1
6198775 Khayrallah et al. Mar 2001 B1
6215983 Dogan et al. Apr 2001 B1
6226280 Roark et al. May 2001 B1
6232918 Wax et al. May 2001 B1
6240129 Reusens et al. May 2001 B1
6249683 Lundby et al. Jun 2001 B1
6256478 Allen et al. Jul 2001 B1
6271946 Chang et al. Aug 2001 B1
6272122 Wee et al. Aug 2001 B1
6310704 Dogan et al. Oct 2001 B1
6317435 Tiedemann, Jr. et al. Nov 2001 B1
6335922 Tiedemann, Jr. et al. Jan 2002 B1
6337659 Kim et al. Jan 2002 B1
6337983 Bonta et al. Jan 2002 B1
6353637 Mansour et al. Mar 2002 B1
6363060 Sarkar Mar 2002 B1
6374115 Barnes et al. Apr 2002 B1
6377539 Kang et al. Apr 2002 B1
6377809 Rezaiifar et al. Apr 2002 B1
6388998 Kasturia May 2002 B1
6393008 Cheng et al. May 2002 B1
6393012 Pankaj May 2002 B1
6401062 Murashima Jun 2002 B1
6438369 Huang et al. Aug 2002 B1
6449246 Barton et al. Sep 2002 B1
6466800 Sydon et al. Oct 2002 B1
6473467 Wallace et al. Oct 2002 B1
6477317 Itokawa Nov 2002 B1
6478422 Hansen Nov 2002 B1
6483820 Davidson et al. Nov 2002 B1
6487243 Hwang et al. Nov 2002 B1
6496790 Kathavate et al. Dec 2002 B1
6501810 Karim et al. Dec 2002 B1
6507601 Parsa et al. Jan 2003 B2
6519462 Lu et al. Feb 2003 B1
6529525 Pecen et al. Mar 2003 B1
6535666 Dogan et al. Mar 2003 B1
6539008 Ahn et al. Mar 2003 B1
6539213 Richards et al. Mar 2003 B1
6542485 Mujtaba et al. Apr 2003 B1
6542743 Soliman Apr 2003 B1
6563806 Yano et al. May 2003 B1
6563881 Sakoda et al. May 2003 B1
6577739 Hurting et al. Jun 2003 B1
6584140 Lee Jun 2003 B1
6590881 Wallace et al. Jul 2003 B1
6597746 Amrany et al. Jul 2003 B1
6601206 Marvasti Jul 2003 B1
6614857 Buehrer et al. Sep 2003 B1
6625172 Odenwalder et al. Sep 2003 B2
6636568 Kadous Oct 2003 B2
6654339 Bohnke et al. Nov 2003 B1
6654431 Barton et al. Nov 2003 B1
6657949 Jones, IV et al. Dec 2003 B1
6658258 Chen et al. Dec 2003 B1
6674787 Dick et al. Jan 2004 B1
6674810 Cheng Jan 2004 B1
6675012 Gray et al. Jan 2004 B2
6678318 Lai Jan 2004 B1
6690951 Cuffaro et al. Feb 2004 B1
6693952 Chuah et al. Feb 2004 B1
6701165 Ho et al. Mar 2004 B1
6704571 Moon Mar 2004 B1
6711400 Aura Mar 2004 B1
6717908 Vijayan et al. Apr 2004 B2
6721568 Gustavsson et al. Apr 2004 B1
6724719 Tong et al. Apr 2004 B1
6731602 Watanabe et al. May 2004 B1
6735244 Hasegawa et al. May 2004 B1
6744743 Walton et al. Jun 2004 B2
6748220 Chow et al. Jun 2004 B1
6751444 Meiyappan Jun 2004 B1
6751456 Bilgic et al. Jun 2004 B2
6754511 Halford et al. Jun 2004 B1
6763009 Bedekar et al. Jul 2004 B1
6765969 Vook et al. Jul 2004 B1
6776165 Jin et al. Aug 2004 B2
6776765 Soukup et al. Aug 2004 B2
6778513 Kasapi et al. Aug 2004 B2
6785341 Walton et al. Aug 2004 B2
6798736 Black et al. Sep 2004 B1
6799043 Tiedemann, Jr. et al. Sep 2004 B2
6802035 Catreux et al. Oct 2004 B2
6804307 Popovic Oct 2004 B1
6813284 Vayanos et al. Nov 2004 B2
6821535 Nurmi et al. Nov 2004 B2
6828293 Hazenkamp et al. Dec 2004 B1
6829293 Jones et al. Dec 2004 B2
6831943 Dabak et al. Dec 2004 B1
6842487 Larsson Jan 2005 B1
6850481 Wu et al. Feb 2005 B2
6850509 Lee et al. Feb 2005 B2
6862271 Medvedev et al. Mar 2005 B2
6870808 Liu et al. Mar 2005 B1
6870826 Ishizu Mar 2005 B1
6904097 Agami et al. Jun 2005 B2
6904283 Li et al. Jun 2005 B2
6904550 Sibecas et al. Jun 2005 B2
6907020 Periyalwar et al. Jun 2005 B2
6907269 Yamaguchi et al. Jun 2005 B2
6909707 Rotstein et al. Jun 2005 B2
6909797 Romsdahl et al. Jun 2005 B2
6917602 Toskala et al. Jul 2005 B2
6917821 Kadous et al. Jul 2005 B2
6927728 Vook et al. Aug 2005 B2
6928047 Xia Aug 2005 B1
6934266 Dulin et al. Aug 2005 B2
6934275 Love et al. Aug 2005 B1
6934340 Dollard et al. Aug 2005 B1
6940842 Proctor, Jr. Sep 2005 B2
6940845 Benveniste et al. Sep 2005 B2
6954448 Farley et al. Oct 2005 B2
6954481 Laroia et al. Oct 2005 B1
6954622 Nelson et al. Oct 2005 B2
6961364 Laroia et al. Nov 2005 B1
6963543 Diep et al. Nov 2005 B2
6970682 Crilly, Jr. et al. Nov 2005 B2
6975868 Joshi et al. Dec 2005 B2
6980540 Laroia et al. Dec 2005 B1
6985434 Wu et al. Jan 2006 B2
6985453 Lundby et al. Jan 2006 B2
6985466 Yun et al. Jan 2006 B1
6985498 Laroia et al. Jan 2006 B2
6987746 Song Jan 2006 B1
6993342 Kuchibhotla et al. Jan 2006 B2
7002900 Walton et al. Feb 2006 B2
7006529 Alastalo et al. Feb 2006 B2
7006557 Subrahmanya et al. Feb 2006 B2
7006848 Ling et al. Feb 2006 B2
7009500 Rao et al. Mar 2006 B2
7010048 Shattil Mar 2006 B1
7013143 Love et al. Mar 2006 B2
7016318 Pankaj et al. Mar 2006 B2
7016319 Baum et al. Mar 2006 B2
7016425 Kraiem Mar 2006 B1
7020110 Walton et al. Mar 2006 B2
7023880 El-Maleh et al. Apr 2006 B2
7039356 Nguyen et al. May 2006 B2
7039370 Laroia et al. May 2006 B2
7042856 Walton et al. May 2006 B2
7042857 Krishnan et al. May 2006 B2
7047006 Classon et al. May 2006 B2
7050402 Schmidl et al. May 2006 B2
7050405 Attar et al. May 2006 B2
7050759 Gaal et al. May 2006 B2
7054301 Sousa et al. May 2006 B1
7061898 Hashem et al. Jun 2006 B2
7069009 Li et al. Jun 2006 B2
7072315 Liu et al. Jul 2006 B1
7079867 Chun et al. Jul 2006 B2
7085574 Gaal et al. Aug 2006 B2
7095708 Alamouti et al. Aug 2006 B1
7095709 Walton et al. Aug 2006 B2
7099299 Liang et al. Aug 2006 B2
7099630 Brunner et al. Aug 2006 B2
7103384 Chun et al. Sep 2006 B2
7106319 Ishiyama Sep 2006 B2
7113808 Hwang et al. Sep 2006 B2
7120134 Tiedemann, Jr. et al. Oct 2006 B2
7120395 Tong et al. Oct 2006 B2
7126928 Tiedemann, Jr. et al. Oct 2006 B2
7131086 Yamasaki et al. Oct 2006 B2
7133460 Bae et al. Nov 2006 B2
7139328 Thomas et al. Nov 2006 B2
7142864 Laroia et al. Nov 2006 B2
7145940 Gore et al. Dec 2006 B2
7145959 Harel et al. Dec 2006 B2
7149199 Sung et al. Dec 2006 B2
7149238 Agee et al. Dec 2006 B2
7151761 Palenius et al. Dec 2006 B1
7151936 Wager et al. Dec 2006 B2
7154936 Bjerke et al. Dec 2006 B2
7155236 Chen et al. Dec 2006 B2
7157351 Cheng et al. Jan 2007 B2
7161971 Tiedemann, Jr. et al. Jan 2007 B2
7164649 Walton et al. Jan 2007 B2
7164696 Sano et al. Jan 2007 B2
7167916 Willen et al. Jan 2007 B2
7170937 Zhou Jan 2007 B2
7177297 Agrawal et al. Feb 2007 B2
7177351 Kadous Feb 2007 B2
7180627 Moylan et al. Feb 2007 B2
7181170 Love et al. Feb 2007 B2
7184426 Padovani et al. Feb 2007 B2
7184713 Kadous et al. Feb 2007 B2
7188300 Eriksson et al. Mar 2007 B2
7197282 Dent et al. Mar 2007 B2
7209712 Holtzman et al. Apr 2007 B2
7215979 Nakagawa et al. May 2007 B2
7230942 Laroia et al. Jun 2007 B2
7233634 Hassell Sweatman et al. Jun 2007 B1
7236747 Meacham et al. Jun 2007 B1
7242722 Krauss et al. Jul 2007 B2
7243150 Sher et al. Jul 2007 B2
7248559 Ma et al. Jul 2007 B2
7248841 Agee et al. Jul 2007 B2
7254158 Agrawal et al. Aug 2007 B2
7257167 Lau et al. Aug 2007 B2
7257406 Ji et al. Aug 2007 B2
7257423 Iochi et al. Aug 2007 B2
7260153 Nissani et al. Aug 2007 B2
7280467 Smee et al. Oct 2007 B2
7289570 Schmidl et al. Oct 2007 B2
7289585 Sandhu et al. Oct 2007 B2
7290195 Guo et al. Oct 2007 B2
7292651 Li Nov 2007 B2
7292863 Chen et al. Nov 2007 B2
7295509 Laroia et al. Nov 2007 B2
7313086 Aizawa Dec 2007 B2
7313126 Yun et al. Dec 2007 B2
7313174 Alard et al. Dec 2007 B2
7313407 Shapira Dec 2007 B2
7327812 Auer Feb 2008 B2
7330701 Mukkavilli et al. Feb 2008 B2
7336727 Mukkavilli et al. Feb 2008 B2
7349371 Schein et al. Mar 2008 B2
7349667 Magee et al. Mar 2008 B2
7356000 Oprescu-Surcobe et al. Apr 2008 B2
7356005 Derryberry et al. Apr 2008 B2
7356073 Heikkila Apr 2008 B2
7359327 Oshiba Apr 2008 B2
7363055 Castrogiovanni et al. Apr 2008 B2
7366223 Chen et al. Apr 2008 B1
7366253 Kim et al. Apr 2008 B2
7366520 Haustein et al. Apr 2008 B2
7369531 Cho et al. May 2008 B2
7372911 Lindskog et al. May 2008 B1
7372912 Seo et al. May 2008 B2
7379489 Zuniga et al. May 2008 B2
7382764 Uehara et al. Jun 2008 B2
7392014 Baker et al. Jun 2008 B2
7394865 Borran et al. Jul 2008 B2
7403745 Dominique et al. Jul 2008 B2
7403748 Keskitalo et al. Jul 2008 B1
7406119 Yamano et al. Jul 2008 B2
7406336 Astely et al. Jul 2008 B2
7411898 Erlich et al. Aug 2008 B2
7412212 Hottinen et al. Aug 2008 B2
7418043 Shattil Aug 2008 B2
7418246 Kim et al. Aug 2008 B2
7423991 Cho et al. Sep 2008 B2
7426426 Van Baren et al. Sep 2008 B2
7428426 Kiran et al. Sep 2008 B2
7433661 Kogiantis et al. Oct 2008 B2
7437164 Agrawal et al. Oct 2008 B2
7443835 Lakshmi Narayanan et al. Oct 2008 B2
7447270 Hottinen et al. Nov 2008 B1
7450532 Chae et al. Nov 2008 B2
7450548 Haustein et al. Nov 2008 B2
7460466 Lee et al. Dec 2008 B2
7463698 Fujii et al. Dec 2008 B2
7468943 Gu et al. Dec 2008 B2
7469011 Lin et al. Dec 2008 B2
7471963 Kim et al. Dec 2008 B2
7483408 Bevan et al. Jan 2009 B2
7483719 Kim et al. Jan 2009 B2
7486408 Van Der Schaar et al. Feb 2009 B2
7486735 Dubuc et al. Feb 2009 B2
7492788 Zhang et al. Feb 2009 B2
7499393 Ozluturk et al. Mar 2009 B2
7508748 Kadous Mar 2009 B2
7508842 Baum et al. Mar 2009 B2
7512096 Kuzminskiy et al. Mar 2009 B2
7545867 Lou et al. Jun 2009 B1
7548506 Ma et al. Jun 2009 B2
7551546 Ma et al. Jun 2009 B2
7551564 Mattina Jun 2009 B2
7558293 Choi et al. Jul 2009 B2
7567621 Sampath et al. Jul 2009 B2
7573900 Kim et al. Aug 2009 B2
7599327 Zhuang Oct 2009 B2
7616955 Kim et al. Nov 2009 B2
7627051 Shen et al. Dec 2009 B2
7664061 Hottinen Feb 2010 B2
7676007 Choi et al. Mar 2010 B1
7684507 Levy Mar 2010 B2
7724777 Sutivong et al. May 2010 B2
7768979 Sutivong et al. Aug 2010 B2
7899497 Kish et al. Mar 2011 B2
7916624 Laroia et al. Mar 2011 B2
7924699 Laroia et al. Apr 2011 B2
7990843 Laroia et al. Aug 2011 B2
7990844 Laroia et al. Aug 2011 B2
8045512 Khandekar et al. Oct 2011 B2
8095141 Teague Jan 2012 B2
8098568 Laroia et al. Jan 2012 B2
8098569 Laroia et al. Jan 2012 B2
8199634 Laroia et al. Jun 2012 B2
8218425 Laroia et al. Jul 2012 B2
8223627 Laroia et al. Jul 2012 B2
8295154 Laroia et al. Oct 2012 B2
8462859 Sampath et al. Jun 2013 B2
8477684 Khandekar et al. Jul 2013 B2
8582509 Khandekar et al. Nov 2013 B2
8582548 Gore et al. Nov 2013 B2
20010021650 Bilgic et al. Sep 2001 A1
20010024427 Suzuki Sep 2001 A1
20010030948 Tiedemann, Jr. Oct 2001 A1
20010047424 Alastalo et al. Nov 2001 A1
20010053140 Choi et al. Dec 2001 A1
20010055294 Motoyoshi et al. Dec 2001 A1
20010055297 Benveniste et al. Dec 2001 A1
20020000948 Chun et al. Jan 2002 A1
20020015405 Sepponen et al. Feb 2002 A1
20020018157 Zhang et al. Feb 2002 A1
20020039912 Yamaguchi et al. Apr 2002 A1
20020044524 Laroia et al. Apr 2002 A1
20020058525 Kasapi et al. May 2002 A1
20020061742 Lapaille et al. May 2002 A1
20020077152 Johnson et al. Jun 2002 A1
20020085521 Tripathi et al. Jul 2002 A1
20020090004 Rinchiuso Jul 2002 A1
20020090024 Tan et al. Jul 2002 A1
20020101839 Farley et al. Aug 2002 A1
20020122381 Wu et al. Sep 2002 A1
20020122403 Hashem et al. Sep 2002 A1
20020128035 Jokinen et al. Sep 2002 A1
20020147953 Catreux et al. Oct 2002 A1
20020159422 Li et al. Oct 2002 A1
20020160769 Gray et al. Oct 2002 A1
20020160781 Bark et al. Oct 2002 A1
20020168946 Aizawa et al. Nov 2002 A1
20020172293 Kuchi et al. Nov 2002 A1
20020176398 Nidda Nov 2002 A1
20020181571 Yamano et al. Dec 2002 A1
20020193146 Wallace et al. Dec 2002 A1
20030002464 Rezaiifar et al. Jan 2003 A1
20030020651 Crilly, Jr. et al. Jan 2003 A1
20030027579 Sydon Feb 2003 A1
20030035491 Walton et al. Feb 2003 A1
20030036359 Dent et al. Feb 2003 A1
20030040283 Kawai et al. Feb 2003 A1
20030043732 Walton et al. Mar 2003 A1
20030043764 Kim et al. Mar 2003 A1
20030063579 Lee Apr 2003 A1
20030068983 Kim et al. Apr 2003 A1
20030072254 Ma et al. Apr 2003 A1
20030072255 Ma et al. Apr 2003 A1
20030072280 McFarland et al. Apr 2003 A1
20030072395 Jia et al. Apr 2003 A1
20030073409 Nobukiyo et al. Apr 2003 A1
20030073464 Giannakis et al. Apr 2003 A1
20030076890 Hochwald et al. Apr 2003 A1
20030086371 Walton et al. May 2003 A1
20030086393 Vasudevan et al. May 2003 A1
20030096579 Ito et al. May 2003 A1
20030103520 Chen et al. Jun 2003 A1
20030109266 Rafiah et al. Jun 2003 A1
20030112745 Zhuang et al. Jun 2003 A1
20030123414 Tong et al. Jul 2003 A1
20030125040 Walton et al. Jul 2003 A1
20030128658 Walton et al. Jul 2003 A1
20030133426 Schein et al. Jul 2003 A1
20030142648 Semper Jul 2003 A1
20030142729 Subrahmanya et al. Jul 2003 A1
20030147371 Choi et al. Aug 2003 A1
20030161281 Dulin et al. Aug 2003 A1
20030161282 Medvedev et al. Aug 2003 A1
20030165189 Kadous et al. Sep 2003 A1
20030181170 Sim Sep 2003 A1
20030185310 Ketchum et al. Oct 2003 A1
20030190897 Lei et al. Oct 2003 A1
20030193915 Lee et al. Oct 2003 A1
20030202491 Tiedemann, Jr. et al. Oct 2003 A1
20030202560 Tiedemann, Jr. et al. Oct 2003 A1
20030216156 Chun et al. Nov 2003 A1
20030228850 Hwang Dec 2003 A1
20030235255 Ketchum et al. Dec 2003 A1
20040001429 Ma et al. Jan 2004 A1
20040001460 Bevan et al. Jan 2004 A1
20040002364 Trikkonen et al. Jan 2004 A1
20040009783 Miyoshi Jan 2004 A1
20040010623 Sher et al. Jan 2004 A1
20040015692 Green et al. Jan 2004 A1
20040017785 Zelst et al. Jan 2004 A1
20040032443 Moylan et al. Feb 2004 A1
20040042558 Hwang et al. Mar 2004 A1
20040048609 Kosaka et al. Mar 2004 A1
20040048630 Shapira et al. Mar 2004 A1
20040054999 Willen et al. Mar 2004 A1
20040057394 Holtzman et al. Mar 2004 A1
20040058687 Kim et al. Mar 2004 A1
20040066754 Hottinen et al. Apr 2004 A1
20040066761 Giannakis et al. Apr 2004 A1
20040066772 Moon et al. Apr 2004 A1
20040067756 Wager et al. Apr 2004 A1
20040072565 Nobukiyo et al. Apr 2004 A1
20040076185 Kim et al. Apr 2004 A1
20040077345 Turner et al. Apr 2004 A1
20040077379 Smith et al. Apr 2004 A1
20040081073 Walton et al. Apr 2004 A1
20040087325 Cheng et al. May 2004 A1
20040095907 Agee et al. May 2004 A1
20040097215 Abe et al. May 2004 A1
20040097240 Chen et al. May 2004 A1
20040098505 Clemmensen et al. May 2004 A1
20040105489 Kim et al. Jun 2004 A1
20040114618 Tong et al. Jun 2004 A1
20040120411 Walton et al. Jun 2004 A1
20040125792 Bradbury et al. Jul 2004 A1
20040128605 Sibecas et al. Jul 2004 A1
20040131007 Smee et al. Jul 2004 A1
20040131008 Zuniga et al. Jul 2004 A1
20040131038 Kim et al. Jul 2004 A1
20040131110 Alard et al. Jul 2004 A1
20040136344 Kim et al. Jul 2004 A1
20040156328 Walton et al. Aug 2004 A1
20040160914 Sarkar et al. Aug 2004 A1
20040160933 Odenwalder et al. Aug 2004 A1
20040162083 Chen et al. Aug 2004 A1
20040165564 Kim et al. Aug 2004 A1
20040166867 Hawe et al. Aug 2004 A1
20040166887 Laroia et al. Aug 2004 A1
20040170152 Nagao et al. Sep 2004 A1
20040170157 Kim et al. Sep 2004 A1
20040171384 Holma et al. Sep 2004 A1
20040171385 Haustein et al. Sep 2004 A1
20040178954 Vook et al. Sep 2004 A1
20040179480 Attar et al. Sep 2004 A1
20040179494 Attar et al. Sep 2004 A1
20040179506 Padovani et al. Sep 2004 A1
20040179627 Ketchum et al. Sep 2004 A1
20040181569 Attar et al. Sep 2004 A1
20040185792 Alexiou et al. Sep 2004 A1
20040190640 Dubuc et al. Sep 2004 A1
20040202257 Mehta et al. Oct 2004 A1
20040208138 Hayashi et al. Oct 2004 A1
20040218520 Aizawa et al. Nov 2004 A1
20040219819 Di Mascio et al. Nov 2004 A1
20040219919 Whinnett et al. Nov 2004 A1
20040224711 Panchal et al. Nov 2004 A1
20040228267 Agrawal et al. Nov 2004 A1
20040228313 Cheng et al. Nov 2004 A1
20040229615 Agrawal et al. Nov 2004 A1
20040240419 Abrishamkar et al. Dec 2004 A1
20040240572 Brutel et al. Dec 2004 A1
20040248604 Vaidyanathan et al. Dec 2004 A1
20040252529 Huber et al. Dec 2004 A1
20040252629 Hasegawa et al. Dec 2004 A1
20040252655 Lim et al. Dec 2004 A1
20040252662 Cho Dec 2004 A1
20040257979 Ro et al. Dec 2004 A1
20040264507 Cho et al. Dec 2004 A1
20040264585 Borran et al. Dec 2004 A1
20040264593 Shim et al. Dec 2004 A1
20050002412 Sagfors et al. Jan 2005 A1
20050002440 Alamouti et al. Jan 2005 A1
20050002467 Seo et al. Jan 2005 A1
20050002468 Walton et al. Jan 2005 A1
20050003782 Wintzell Jan 2005 A1
20050008091 Boutros et al. Jan 2005 A1
20050009486 Al-Dhahir et al. Jan 2005 A1
20050013263 Kim et al. Jan 2005 A1
20050025093 Yun et al. Feb 2005 A1
20050030886 Wu et al. Feb 2005 A1
20050030964 Tiedemann, Jr. et al. Feb 2005 A1
20050034079 Gunasekar et al. Feb 2005 A1
20050041611 Sandhu et al. Feb 2005 A1
20050041618 Wei et al. Feb 2005 A1
20050041750 Lau et al. Feb 2005 A1
20050041775 Batzinger et al. Feb 2005 A1
20050044206 Johansson et al. Feb 2005 A1
20050047517 Georgios et al. Mar 2005 A1
20050052991 Kadous et al. Mar 2005 A1
20050053081 Andersson et al. Mar 2005 A1
20050053151 Lin et al. Mar 2005 A1
20050063298 Ling et al. Mar 2005 A1
20050068921 Liu Mar 2005 A1
20050073976 Fujii Apr 2005 A1
20050085195 Tong et al. Apr 2005 A1
20050085236 Gerlach et al. Apr 2005 A1
20050111397 Attar et al. May 2005 A1
20050113100 Oprescu-Surcobe et al. May 2005 A1
20050122898 Jang et al. Jun 2005 A1
20050128683 Watanabe et al. Jun 2005 A1
20050128983 Kim et al. Jun 2005 A1
20050135324 Kim et al. Jun 2005 A1
20050135498 Yee Jun 2005 A1
20050141624 Lakshmipathi et al. Jun 2005 A1
20050147024 Jung et al. Jul 2005 A1
20050147025 Auer et al. Jul 2005 A1
20050152484 Sandhu et al. Jul 2005 A1
20050157807 Shim et al. Jul 2005 A1
20050159162 Park Jul 2005 A1
20050164709 Balasubramanian et al. Jul 2005 A1
20050165949 Teague Jul 2005 A1
20050174981 Heath, Jr. et al. Aug 2005 A1
20050175070 Grob et al. Aug 2005 A1
20050180311 Wang et al. Aug 2005 A1
20050180313 Kim et al. Aug 2005 A1
20050181799 Laroia et al. Aug 2005 A1
20050192011 Hong et al. Sep 2005 A1
20050195733 Walton et al. Sep 2005 A1
20050195852 Vayanos et al. Sep 2005 A1
20050195886 Lampinen et al. Sep 2005 A1
20050201296 Vannithamby et al. Sep 2005 A1
20050204247 Guo et al. Sep 2005 A1
20050207367 Onggosanusi et al. Sep 2005 A1
20050215196 Krishnan et al. Sep 2005 A1
20050215251 Krishnan et al. Sep 2005 A1
20050226204 Uehara et al. Oct 2005 A1
20050239465 Lee et al. Oct 2005 A1
20050243791 Park et al. Nov 2005 A1
20050246548 Laitinen Nov 2005 A1
20050249266 Brown et al. Nov 2005 A1
20050254416 Laroia et al. Nov 2005 A1
20050254467 Li et al. Nov 2005 A1
20050254477 Lee et al. Nov 2005 A1
20050254556 Fujii et al. Nov 2005 A1
20050259005 Chiang et al. Nov 2005 A1
20050259723 Blanchard et al. Nov 2005 A1
20050259757 Wu et al. Nov 2005 A1
20050265220 Erlich et al. Dec 2005 A1
20050265293 Ro et al. Dec 2005 A1
20050265470 Kishigami et al. Dec 2005 A1
20050271012 Agrawal et al. Dec 2005 A1
20050276347 Mujtaba et al. Dec 2005 A1
20050276348 Vandenameele Dec 2005 A1
20050277423 Sandhu et al. Dec 2005 A1
20050281029 Inamoto et al. Dec 2005 A1
20050281290 Khandekar et al. Dec 2005 A1
20050282500 Wang et al. Dec 2005 A1
20050286408 Jin et al. Dec 2005 A1
20050289256 Cudak et al. Dec 2005 A1
20060002451 Fukuta et al. Jan 2006 A1
20060013285 Kobayashi et al. Jan 2006 A1
20060018336 Sutivong et al. Jan 2006 A1
20060018347 Agrawal et al. Jan 2006 A1
20060018397 Sampath et al. Jan 2006 A1
20060026344 Sun Hsu et al. Feb 2006 A1
20060029289 Yamaguchi et al. Feb 2006 A1
20060034164 Ozluturk et al. Feb 2006 A1
20060034173 Teague et al. Feb 2006 A1
20060039332 Kotzin Feb 2006 A1
20060039344 Khan Feb 2006 A1
20060039500 Yun et al. Feb 2006 A1
20060040655 Kim et al. Feb 2006 A1
20060045003 Choi et al. Mar 2006 A1
20060050770 Wallace et al. Mar 2006 A1
20060056340 Hottinen et al. Mar 2006 A1
20060057958 Ngo et al. Mar 2006 A1
20060067421 Walton et al. Mar 2006 A1
20060078075 Stamoulis et al. Apr 2006 A1
20060083159 Laroia et al. Apr 2006 A1
20060083183 Teague et al. Apr 2006 A1
20060092054 Li et al. May 2006 A1
20060093065 Thomas et al. May 2006 A1
20060104333 Rainbolt et al. May 2006 A1
20060104381 Menon et al. May 2006 A1
20060109814 Kuzminskiy et al. May 2006 A1
20060111054 Pan et al. May 2006 A1
20060111148 Mukkavilli et al. May 2006 A1
20060114858 Walton et al. Jun 2006 A1
20060120469 Maltsev et al. Jun 2006 A1
20060120471 Learned et al. Jun 2006 A1
20060126491 Ro et al. Jun 2006 A1
20060133269 Prakash et al. Jun 2006 A1
20060133455 Agrawal et al. Jun 2006 A1
20060133521 Sampath et al. Jun 2006 A1
20060140289 Mandyam et al. Jun 2006 A1
20060153239 Julian et al. Jul 2006 A1
20060155534 Lin et al. Jul 2006 A1
20060156199 Palanki et al. Jul 2006 A1
20060172704 Nishio et al. Aug 2006 A1
20060189321 Oh et al. Aug 2006 A1
20060203708 Sampath et al. Sep 2006 A1
20060203794 Sampath et al. Sep 2006 A1
20060203891 Sampath et al. Sep 2006 A1
20060203932 Palanki et al. Sep 2006 A1
20060209670 Gorokhov et al. Sep 2006 A1
20060209732 Gorokhov et al. Sep 2006 A1
20060209754 Ji et al. Sep 2006 A1
20060209764 Kim et al. Sep 2006 A1
20060209973 Gorokhov et al. Sep 2006 A1
20060215777 Krishnamoorthi Sep 2006 A1
20060218459 Hedberg Sep 2006 A1
20060223449 Sampath et al. Oct 2006 A1
20060233124 Palanki Oct 2006 A1
20060233131 Gore et al. Oct 2006 A1
20060262754 Andersson et al. Nov 2006 A1
20060270427 Shida et al. Nov 2006 A1
20060274836 Sampath et al. Dec 2006 A1
20060280114 Osseiran et al. Dec 2006 A1
20060285485 Agrawal et al. Dec 2006 A1
20060285515 Julian et al. Dec 2006 A1
20060286974 Gore et al. Dec 2006 A1
20060286982 Prakash et al. Dec 2006 A1
20060286995 Onggosanusi et al. Dec 2006 A1
20060291371 Sutivong et al. Dec 2006 A1
20060292989 Gerlach et al. Dec 2006 A1
20070004430 Hyun et al. Jan 2007 A1
20070005749 Sampath Jan 2007 A1
20070009011 Coulson Jan 2007 A1
20070019596 Barriac et al. Jan 2007 A1
20070025345 Bachl et al. Feb 2007 A1
20070041311 Baum et al. Feb 2007 A1
20070041457 Kadous et al. Feb 2007 A1
20070047485 Gorokhov et al. Mar 2007 A1
20070047495 Ji et al. Mar 2007 A1
20070049218 Gorokhov et al. Mar 2007 A1
20070053282 Tong et al. Mar 2007 A1
20070053383 Choi et al. Mar 2007 A1
20070060178 Gorokhov et al. Mar 2007 A1
20070064669 Classon et al. Mar 2007 A1
20070070952 Yoon et al. Mar 2007 A1
20070071147 Sampath et al. Mar 2007 A1
20070097853 Khandekar et al. May 2007 A1
20070097889 Wang et al. May 2007 A1
20070097897 Teague et al. May 2007 A1
20070097908 Khandekar et al. May 2007 A1
20070097909 Khandekar et al. May 2007 A1
20070097910 Ji et al. May 2007 A1
20070097922 Parekh et al. May 2007 A1
20070097927 Gorokhov et al. May 2007 A1
20070097942 Gorokhov et al. May 2007 A1
20070097981 Papasakellariou et al. May 2007 A1
20070098050 Khandekar et al. May 2007 A1
20070098120 Wang et al. May 2007 A1
20070099666 Astely et al. May 2007 A1
20070110172 Faulkner et al. May 2007 A1
20070115795 Gore et al. May 2007 A1
20070149194 Das et al. Jun 2007 A1
20070149228 Das Jun 2007 A1
20070159969 Das et al. Jul 2007 A1
20070160115 Palanki et al. Jul 2007 A1
20070165738 Barriac et al. Jul 2007 A1
20070177631 Popovic et al. Aug 2007 A1
20070177681 Choi et al. Aug 2007 A1
20070183303 Pi et al. Aug 2007 A1
20070183386 Muharemovic et al. Aug 2007 A1
20070207812 Borran et al. Sep 2007 A1
20070211616 Khandekar et al. Sep 2007 A1
20070211667 Agrawal et al. Sep 2007 A1
20070230324 Li et al. Oct 2007 A1
20070242653 Yang et al. Oct 2007 A1
20070263743 Lee et al. Nov 2007 A1
20070280336 Zhang et al. Dec 2007 A1
20070281702 Lim et al. Dec 2007 A1
20080039129 Li et al. Feb 2008 A1
20080063099 Laroia et al. Mar 2008 A1
20080095223 Tong et al. Apr 2008 A1
20080095262 Ho et al. Apr 2008 A1
20080151829 Khandekar et al. Jun 2008 A1
20080181139 Rangarajan et al. Jul 2008 A1
20080214222 Atarashi et al. Sep 2008 A1
20080253279 Ma et al. Oct 2008 A1
20080267157 Lee et al. Oct 2008 A1
20080299983 Kwak et al. Dec 2008 A1
20090003466 Taherzadehboroujeni et al. Jan 2009 A1
20090010351 Laroia et al. Jan 2009 A1
20090022098 Novak et al. Jan 2009 A1
20090041150 Tsai et al. Feb 2009 A1
20090110103 Maltsev et al. Apr 2009 A1
20090180459 Orlik et al. Jul 2009 A1
20090197646 Tamura et al. Aug 2009 A1
20090201826 Gorokhov et al. Aug 2009 A1
20090201872 Gorokhov et al. Aug 2009 A1
20090213750 Gorokhov et al. Aug 2009 A1
20090213950 Gorokhov et al. Aug 2009 A1
20090262641 Laroia et al. Oct 2009 A1
20090262699 Wengerter et al. Oct 2009 A1
20090285163 Zhang et al. Nov 2009 A1
20090287977 Chang et al. Nov 2009 A1
20100002570 Walton et al. Jan 2010 A9
20100135242 Nam et al. Jun 2010 A1
20100220800 Erell et al. Sep 2010 A1
20100232384 Farajidana et al. Sep 2010 A1
20100238902 Ji et al. Sep 2010 A1
20100254263 Chen et al. Oct 2010 A1
20110064070 Gore et al. Mar 2011 A1
20110235733 Laroia et al. Sep 2011 A1
20110235745 Laroia et al. Sep 2011 A1
20110235746 Laroia et al. Sep 2011 A1
20110235747 Laroia et al. Sep 2011 A1
20110255518 Agrawal et al. Oct 2011 A9
20110306291 Ma et al. Dec 2011 A1
20120002623 Khandekar et al. Jan 2012 A1
20120063441 Palanki Mar 2012 A1
20120120925 Kadous et al. May 2012 A1
20120140798 Kadous et al. Jun 2012 A1
20120140838 Kadous et al. Jun 2012 A1
20130016678 Laroia et al. Jan 2013 A1
20130208681 Gore et al. Aug 2013 A1
20130287138 Ma et al. Oct 2013 A1
20130315200 Gorokhov et al. Nov 2013 A1
Foreign Referenced Citations (431)
Number Date Country
2005319084 Apr 2010 AU
2348137 Nov 2001 CA
2477536 Sep 2003 CA
2540688 May 2005 CA
2577369 Mar 2006 CA
19931400 Dec 1994 CL
1997846 Jan 1998 CL
009531997 Jan 1998 CL
27102004 Aug 2005 CL
22892004 Sep 2005 CL
30862004 Oct 2005 CL
29932005 May 2006 CL
15202006 Dec 2006 CL
22032006 Feb 2007 CL
15212006 Mar 2007 CL
14922006 Apr 2007 CL
14892006 May 2007 CL
14902006 May 2007 CL
29032006 May 2007 CL
29062006 May 2007 CL
29042006 Jun 2007 CL
33882005 Jun 2007 CL
29022006 Jul 2007 CL
29082006 Oct 2007 CL
29012006 Jan 2010 CL
29072006 Jan 2010 CL
1252919 May 2000 CN
1267437 Sep 2000 CN
1267437 Sep 2000 CN
1284795 Feb 2001 CN
1296682 May 2001 CN
1344451 Apr 2002 CN
1344451 Apr 2002 CN
1346221 Apr 2002 CN
1383631 Dec 2002 CN
1386344 Dec 2002 CN
1402916 Mar 2003 CN
1424835 Jun 2003 CN
1132474 Dec 2003 CN
1467938 Jan 2004 CN
1487755 Apr 2004 CN
1520220 Aug 2004 CN
1525678 Sep 2004 CN
1636346 Jul 2005 CN
1642051 Jul 2005 CN
1642335 Jul 2005 CN
1647436 Jul 2005 CN
19800653 Jul 1999 DE
19800953 Jul 1999 DE
19957288 May 2001 DE
10240138 Aug 2003 DE
10254384 Jun 2004 DE
0488976 Jun 1992 EP
0568291 Nov 1993 EP
0740431 Oct 1996 EP
0786889 Jul 1997 EP
0805576 Nov 1997 EP
0807989 Nov 1997 EP
0844796 May 1998 EP
0981222 Feb 2000 EP
1001570 May 2000 EP
1047209 Oct 2000 EP
1061687 Dec 2000 EP
1091516 Apr 2001 EP
1093241 Apr 2001 EP
1148673 Oct 2001 EP
1180907 Feb 2002 EP
1187506 Mar 2002 EP
1204217 May 2002 EP
1255369 Nov 2002 EP
1267513 Dec 2002 EP
1074099 Feb 2003 EP
1286490 Feb 2003 EP
1335504 Aug 2003 EP
1351538 Oct 2003 EP
1376920 Jan 2004 EP
1392073 Feb 2004 EP
1434365 Jun 2004 EP
1441469 Jul 2004 EP
1445873 Aug 2004 EP
1465449 Oct 2004 EP
1478204 Nov 2004 EP
1507421 Feb 2005 EP
1513356 Mar 2005 EP
1531575 May 2005 EP
1533950 May 2005 EP
1538863 Jun 2005 EP
1542488 Jun 2005 EP
1601149 Nov 2005 EP
1643669 Apr 2006 EP
1898542 Mar 2008 EP
1941693 Jul 2011 EP
2584884 Jan 1987 FR
2279540 Jan 1995 GB
2348776 Oct 2000 GB
2412541 Sep 2005 GB
167573 Feb 2011 IL
201872 May 2012 IL
H04111544 Apr 1992 JP
4301931 Oct 1992 JP
H0746248 Feb 1995 JP
7336323 Dec 1995 JP
8116329 May 1996 JP
08288927 Nov 1996 JP
9008725 Jan 1997 JP
H09501548 Feb 1997 JP
9131342 May 1997 JP
9182148 Jul 1997 JP
09214404 Aug 1997 JP
9284200 Oct 1997 JP
10117162 May 1998 JP
H10210000 Aug 1998 JP
10322304 Dec 1998 JP
H11168453 Jun 1999 JP
11191756 Jul 1999 JP
11196109 Jul 1999 JP
11508417 Jul 1999 JP
11239155 Aug 1999 JP
11298954 Oct 1999 JP
11331927 Nov 1999 JP
2000102065 Apr 2000 JP
2000184425 Jun 2000 JP
2000511750 Sep 2000 JP
2000332724 Nov 2000 JP
2001016644 Jan 2001 JP
2001045573 Feb 2001 JP
2001057545 Feb 2001 JP
2001156732 Jun 2001 JP
2001238269 Aug 2001 JP
2001245355 Sep 2001 JP
2001249802 Sep 2001 JP
2001285927 Oct 2001 JP
2001521698 Nov 2001 JP
2001526012 Dec 2001 JP
2002026790 Jan 2002 JP
2002515203 May 2002 JP
2002290148 Oct 2002 JP
2002534925 Oct 2002 JP
2002534941 Oct 2002 JP
200318054 Jan 2003 JP
2003032218 Jan 2003 JP
2003500909 Jan 2003 JP
200369472 Mar 2003 JP
2003101515 Apr 2003 JP
2003169367 Jun 2003 JP
2003174426 Jun 2003 JP
2003199173 Jul 2003 JP
2003520523 Jul 2003 JP
2003249907 Sep 2003 JP
2003292667 Oct 2003 JP
2003318857 Nov 2003 JP
2003347985 Dec 2003 JP
2003348047 Dec 2003 JP
2003536308 Dec 2003 JP
2004007643 Jan 2004 JP
2004023716 Jan 2004 JP
2004048716 Feb 2004 JP
200472457 Mar 2004 JP
2004072157 Mar 2004 JP
2004096142 Mar 2004 JP
2004507950 Mar 2004 JP
2004153676 May 2004 JP
2004158901 Jun 2004 JP
2004162388 Jun 2004 JP
2004194262 Jul 2004 JP
2004201296 Jul 2004 JP
2004215022 Jul 2004 JP
2004221972 Aug 2004 JP
2004266818 Sep 2004 JP
2004529524 Sep 2004 JP
2004297276 Oct 2004 JP
2004297370 Oct 2004 JP
2004297756 Oct 2004 JP
2004534456 Nov 2004 JP
2004535106 Nov 2004 JP
2005006337 Jan 2005 JP
2005020530 Jan 2005 JP
2005502218 Jan 2005 JP
2005502218 Jan 2005 JP
2005506757 Mar 2005 JP
2005110130 Apr 2005 JP
2005130491 May 2005 JP
2005167502 Jun 2005 JP
2005197772 Jul 2005 JP
2005203961 Jul 2005 JP
2005521327 Jul 2005 JP
2005521358 Jul 2005 JP
2005236678 Sep 2005 JP
2006505172 Feb 2006 JP
2006505230 Feb 2006 JP
2006506860 Feb 2006 JP
2006211537 Aug 2006 JP
2006518173 Aug 2006 JP
2006524930 Nov 2006 JP
2007500486 Jan 2007 JP
2007503790 Feb 2007 JP
2007519281 Jul 2007 JP
2007520309 Jul 2007 JP
2007525043 Aug 2007 JP
2007527127 Sep 2007 JP
2008505587 Feb 2008 JP
2008535398 Aug 2008 JP
4188372 Nov 2008 JP
2008546314 Dec 2008 JP
04694628 Jun 2011 JP
0150275 Nov 1998 KR
20000060428 Oct 2000 KR
100291476 Mar 2001 KR
20010056333 Apr 2001 KR
20010087715 Sep 2001 KR
20030007965 Jan 2003 KR
20030035969 May 2003 KR
20040063057 Jul 2004 KR
200471652 Aug 2004 KR
20040103441 Dec 2004 KR
20050061559 Jun 2005 KR
20050063826 Jun 2005 KR
100606099 Jul 2006 KR
95121152 Dec 1997 RU
2141168 Nov 1999 RU
2141706 Nov 1999 RU
2159007 Nov 2000 RU
2162275 Jan 2001 RU
2183387 Jun 2002 RU
2192094 Oct 2002 RU
2197778 Jan 2003 RU
2201033 Mar 2003 RU
2207723 Jun 2003 RU
2208913 Jul 2003 RU
2210866 Aug 2003 RU
2216101 Nov 2003 RU
2216103 Nov 2003 RU
2216105 Nov 2003 RU
2225080 Feb 2004 RU
2235429 Aug 2004 RU
2235432 Aug 2004 RU
2237379 Sep 2004 RU
2238611 Oct 2004 RU
2242091 Dec 2004 RU
2003125268 Feb 2005 RU
2250564 Apr 2005 RU
2257008 Jul 2005 RU
2267224 Dec 2005 RU
2005129079 Feb 2006 RU
2285338 Oct 2006 RU
2285351 Oct 2006 RU
2292655 Jan 2007 RU
2335864 Oct 2008 RU
2349043 Mar 2009 RU
1320883 Jun 1987 SU
508960 Nov 2002 TW
510132 Nov 2002 TW
200302642 Aug 2003 TW
200401572 Jan 2004 TW
I232040 May 2005 TW
248266 Jan 2006 TW
200718128 May 2007 TW
WO9408432 Apr 1994 WO
WO-9521494 Aug 1995 WO
WO9613920 May 1996 WO
WO9701256 Jan 1997 WO
WO9737456 Oct 1997 WO
WO-9746033 Dec 1997 WO
WO9800946 Jan 1998 WO
WO-9814026 Apr 1998 WO
WO9837706 Aug 1998 WO
WO9848581 Oct 1998 WO
WO9853561 Nov 1998 WO
WO9854919 Dec 1998 WO
WO-9944313 Sep 1999 WO
WO-9944383 Sep 1999 WO
9952250 Oct 1999 WO
WO9953713 Oct 1999 WO
9960729 Nov 1999 WO
WO-9959265 Nov 1999 WO
0004728 Jan 2000 WO
WO0002397 Jan 2000 WO
WO0033503 Jun 2000 WO
0041542 Jul 2000 WO
WO0070897 Nov 2000 WO
WO01001596 Jan 2001 WO
WO0117125 Mar 2001 WO
WO0126269 Apr 2001 WO
WO-0139523 May 2001 WO
WO0145300 Jun 2001 WO
WO-0148969 Jul 2001 WO
WO-0158054 Aug 2001 WO
WO-0160106 Aug 2001 WO
0165637 Sep 2001 WO
WO0169814 Sep 2001 WO
WO0182543 Nov 2001 WO
WO-0182544 Nov 2001 WO
WO-0189112 Nov 2001 WO
WO0193505 Dec 2001 WO
0204936 Jan 2002 WO
WO0207375 Jan 2002 WO
WO0215616 Feb 2002 WO
WO0219746 Mar 2002 WO
0233848 Apr 2002 WO
WO0231991 Apr 2002 WO
0245293 Jun 2002 WO
WO0245456 Jun 2002 WO
WO0249305 Jun 2002 WO
WO0249306 Jun 2002 WO
WO0249306 Jun 2002 WO
WO0249385 Jun 2002 WO
WO02049305 Jun 2002 WO
WO02060138 Aug 2002 WO
WO02065675 Aug 2002 WO
WO02082689 Oct 2002 WO
WO02082743 Oct 2002 WO
WO02089434 Nov 2002 WO
WO02093782 Nov 2002 WO
WO02093819 Nov 2002 WO
02099995 Dec 2002 WO
WO02100027 Dec 2002 WO
WO03001696 Jan 2003 WO
WO03001761 Jan 2003 WO
WO03003617 Jan 2003 WO
WO03019819 Mar 2003 WO
WO03030414 Apr 2003 WO
WO03034644 Apr 2003 WO
WO03043262 May 2003 WO
WO03043369 May 2003 WO
03049409 Jun 2003 WO
03058871 Jul 2003 WO
03069816 Aug 2003 WO
WO03067783 Aug 2003 WO
WO03069832 Aug 2003 WO
WO03073646 Sep 2003 WO
WO03075479 Sep 2003 WO
WO03085876 Oct 2003 WO
WO03088538 Oct 2003 WO
WO03094384 Nov 2003 WO
WO03103331 Dec 2003 WO
WO2004002047 Dec 2003 WO
WO2004004370 Jan 2004 WO
WO2004008671 Jan 2004 WO
WO2004008681 Jan 2004 WO
WO2004015912 Feb 2004 WO
WO2004016007 Feb 2004 WO
WO2004021605 Mar 2004 WO
WO2004023834 Mar 2004 WO
2004028037 Apr 2004 WO
2004032443 Apr 2004 WO
WO2004030238 Apr 2004 WO
2004038984 May 2004 WO
2004040825 May 2004 WO
WO2004038954 May 2004 WO
WO2004038972 May 2004 WO
WO2004038988 May 2004 WO
WO2004040690 May 2004 WO
WO2004040827 May 2004 WO
WO2004047354 Jun 2004 WO
WO2004049618 Jun 2004 WO
WO2004051872 Jun 2004 WO
2004056022 Jul 2004 WO
WO2004062255 Jul 2004 WO
WO2004064294 Jul 2004 WO
WO2004064295 Jul 2004 WO
WO2004066520 Aug 2004 WO
WO2004068721 Aug 2004 WO
WO2004073276 Aug 2004 WO
WO2004075023 Sep 2004 WO
WO2004075442 Sep 2004 WO
WO2004075448 Sep 2004 WO
WO2004075468 Sep 2004 WO
WO2004075596 Sep 2004 WO
WO2004077850 Sep 2004 WO
WO2004084509 Sep 2004 WO
WO2004086706 Oct 2004 WO
WO2004086711 Oct 2004 WO
WO2004095730 Nov 2004 WO
WO2004095851 Nov 2004 WO
WO2004095854 Nov 2004 WO
WO2004098072 Nov 2004 WO
WO2004098222 Nov 2004 WO
WO2004102815 Nov 2004 WO
WO2004102816 Nov 2004 WO
2004114564 Dec 2004 WO
2004114615 Dec 2004 WO
WO2004105272 Dec 2004 WO
WO2004114549 Dec 2004 WO
2005002253 Jan 2005 WO
2005011163 Feb 2005 WO
2005018270 Feb 2005 WO
WO2005015795 Feb 2005 WO
WO2005015797 Feb 2005 WO
WO2005015810 Feb 2005 WO
WO2005015941 Feb 2005 WO
WO2005020488 Mar 2005 WO
WO2005020490 Mar 2005 WO
WO2005022811 Mar 2005 WO
WO2005025110 Mar 2005 WO
WO2005032004 Apr 2005 WO
2005043780 May 2005 WO
WO2005043855 May 2005 WO
WO2005046080 May 2005 WO
2005055465 Jun 2005 WO
WO2005055484 Jun 2005 WO
WO2005055527 Jun 2005 WO
WO2005060192 Jun 2005 WO
WO2005065062 Jul 2005 WO
WO2005069538 Jul 2005 WO
WO2005074184 Aug 2005 WO
2005086440 Sep 2005 WO
WO2005096538 Oct 2005 WO
WO2005122628 Dec 2005 WO
2006007292 Jan 2006 WO
WO2006019710 Feb 2006 WO
WO-2006026344 Mar 2006 WO
WO2006044487 Apr 2006 WO
2006062356 Jun 2006 WO
2006069301 Jun 2006 WO
WO2006069300 Jun 2006 WO
WO2006069397 Jun 2006 WO
WO2006077696 Jul 2006 WO
WO-2006096784 Sep 2006 WO
WO-2006099349 Sep 2006 WO
WO2006099545 Sep 2006 WO
WO2006099577 Sep 2006 WO
WO2006127544 Nov 2006 WO
WO-2006134032 Dec 2006 WO
WO-2006138196 Dec 2006 WO
WO-2006138573 Dec 2006 WO
WO2006138581 Dec 2006 WO
2007022430 Feb 2007 WO
WO-2007024934 Mar 2007 WO
WO2007024935 Mar 2007 WO
WO2007025160 Mar 2007 WO
WO-2007051159 May 2007 WO
Non-Patent Literature Citations (129)
Entry
Schnell, M. et al., “Application of IFDMA to Mobile Radio Transmission,” Universal Personal Commmunications, 1998, IEEE1998 International Conference, Florence, Italy, Oct. 5-9, 1998, pp. 1267-1272, XP010314992.
Keller, et al., “Adaptive Multicarrier Modulation: A Convenient Framework for Time-Frequency Processing in Wireless Communications,” Proceedings of the IEEE, vol. 88, No. 5, May 2000, pp. 611-640.
Schnell, et al., “A Promising New Wideband Multiple-Access Scheme for Future Mobile Communications Systems,” European Transactions on Telecommunications, Wiley & Sons, Chichester, GB, vol. 10, No. 4, Jul. 1999, pp. 417-427.
Tellado, “Multicarrier Modulation with Low Par,” Kluwer Academic, Dordrecht, NL, XP-002199500, 2000, pp. 6-11 and 55-60.
Wang, et al., “Improving performance of multi-user OFDM systems using bit-wise interleaver” Electronics Letters, IEE Stevenage, GB, vol. 37, No. 19, Sep. 13, 2001, pp. 1173-1174, XP006017222.
Yun, et al., “Performance of an LDPC-Coded Frequency-Hopping OFDMA System Based on Resource Allocation in the Uplink” Vehicular Technology Conference, 2004. VTC 2004-Spring. 2004 IEEE 59th Milan, Italy, May 17-19, 2004, Piscataway, NJ, USA, vol. 4, May 17, 2004, pp. 1925-1928, XP010766497.
3GPP TS 33.220 V.1.1.0 XX,XX, “3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; Generic Authentication Architecture (GAA); Generic Bootstrapping Architecture (Release 6)” Feb. 9, 2004, pp. 1-17, figure 4, XP002996023.
3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Physical Layer Aspects for Evolved UTRA (Release 7), 3GPP TR 25.814 v0.3.1 (Nov. 2005).
Bahai, Saltzberg: “System Architecture,” Multi-Carrier Digital Communications, Kluwer Academic, New York, NY, XP-002199501, 1999, pp. 17-21.
Bingham: “Other Types of MCM,” ADSL, VDSL, and Multicarrier Modulation, John Wiley & Sons, New York, XP-002199502. 2000, pp. 111-113.
Blum et al, “On Optimum MIMO with antenna selection,” IEEE International Conference on Communications: Conference Proceedings, vol. 1, Apr. 28, 2002, pp. 386-390.
Catreux, S. et al.: “Simulation results for an interference-limited multiple input multiple output cellular system”., Global Telecommunications Conference, 2000. GLOBECOM '00. IEEE. Dec. 1, 2000. vol. 2, pp. 1094-1096 http://ieeexplore.ieee.org/ie15/7153/19260/00891306.pdf?tp=&isnumber=19260&arnumber=8913063&punumber=7153.
Chennakeshu, et al. “Capacity Analysis of a TDMA-Based Slow-Frequency—Hopped Cellular System,” IEEE Transaction on Vehicular Technology, vol. 45., No. 3 Aug. 1996, pp. 531-542.
Chiani, et al. “Outage Evaluation for Slow Frequency-Hopping Mobile Radio Systems” IEEE Transactions on Communications, vol. 47, No. 12, Dec. 1999, pp. 1865-1874.
Choi, et al., “Design of the Optimum Pilot Pattern for Channel Estimation in OFDM Systems,” Global Telecommunications Conference, IEEE Communications Society, Globecom, Dallas, Texas (2004), p. 3661-3665.
Chung, S. et al.: “Low complexity algorithm for rate and power quantization in extended V-Blast” VTC Fall 2001. IEEE 54th. Vehicular Technology Conference Proceedings. Atlantic City, NJ, Oct. 7-11, 2001, vol. 1 of 4, pp. 910-914, Conf. 54.
Czylwik: “Comparison Between Adaptive OFDM and Single Carrier Modulation with Frequency Domain Equalization,” IEEE 47th Vehicular Technology Conference, vol. 2, May 4-7, 1997, pp. 865-869.
Das et al., “On the Reverse Link Interference Structure for Next Generation Cellular Systems,” Global Telecommunications Conference, 2004. GLOBECOM '04, IEEE, vol. 5 IEEE Nov. 29-Dec. 3, 2004, pp. 3068-3072.
Dierks, et al., “The TLS Protocol”, Version 1.0, Network Working Group, Request for Comments 2246, pp. 1-80 (Jan. 1999).
Dinis R; Falconer D; Tong Lam C; Sabbaghian M: “A Multiple Access Scheme for the Uplink of Broadband Wireless Systems” Global.
Don Torrieri, “Cellular Frequency-Hopping CDMA Systems,” IEEE Vehicular Technology Conference, May 16, 1999, pp. 919-925, vol. 2.
El Gamal, et al.: “Universal Space-Time Coding,” IEEE Transactions on Information Theory, vol. 49, Issue 5, pp. 1097-1119, XP011074756, ISSN: 0018-9448, May 2003.
Hermann Rohling et al., : “Performance Comparison of Different Multiple Access Schemes for the Downlink of an OFDM Communication System”, Vehicular Technology Conference, 1997, 47th IEEE, vol. 3, May 3-7, 1997, pp. 1365-1369.
Hill, et al., “Cyclic Shifting and Time Inversion of Partial Transmit Sequences to Reduce the Peak-to-Average Power Ratio in OFDM,” IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, vol. 2, Sep. 18, 2000, Piscataway, NJ, pp. 1256-1259.
Hochwald et al., “Achieving near-capacity on a multiple-antenna channel,” IEEE Transactions on Communications, IEEE Service Center, Piscataway, New Jersey, vol. 51, No. 3, pp. 389-399 (2003).
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.
International Search Report and Written Opinion—PCT/US06/031147, International Search Authority—European Patent Office, Feb. 2, 2007.
J.S. Chow and J.M. Cioffi: “A cost-effective maximum likelihood reciever for multicarrier systems”, Proc. IEEE Int. Conf. on Comm., pp. 948-952, Jun. 1992.
Kaleh: “Channel Equalization for Block Transmission Systems,” IEEE Journal on Selected Areas in Communications, vol. 13, No. 1, Jan. 1995, pp. 110-121.
Kappes, J.M., and Sayegh, S.1., “Programmable Demultiplexer/Demodulator Processor,” COMSAT Laboratories, IEEE, 1990, pp. 230-234.
Karsten Bruninghaus et al., : “Multi-Carrier Spread Spectrum and It's relationship to Single-Carrier Transmission”, Vehicular technology Conference, 1998, VTC 98, 48th IEEE, vol. 3, May 18-21, 1998, pp. 2329-2332.
Kiessling et al, “Short-term and long-term diagonalization of correlated MIMO channels with adaptive modulation” IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, vol. 2, Sep. 15, 2002, pp. 593-597.
Kim, et al. “Performance of TDMA System With SFH and 2-bit Differentially Detected GMSK Over Rayleigh Fading Channel,” IEEE Vehicular Technology Conference, Apr. 28, 1996, pp. 789-793.
Kishiyama et al., Investigation of optimum pilot channel structure for VSF-OFCDM broadband wireless access in forward link, VTC 2003-Spring, The 57th IEEE Semiannual Vehicular Technology Conference, Proceedings JEJU, Korea, Apr. 22-25, 2003, pp. 139-144.
Kostic, et al. “Dynamic Frequency Hopping in Wireless Cellular Systems-Simulations of Full-Replacement and Reduced-Overhead Methods,” IEEE Vehicular Technology Conference, May 16, 1999, pp. 914-918.
Kostic, et al. “Fundamentals of Dynamic Frequency Hopping in Cellular Systems,” IEEE Journal on Selected Areas in Communications, vol. 19, No. 11, Nov. 2001, pp. 2254-2266.
Kousa, M. et al: “Adaptive Binary Coding for Diversity Communication Systems” IEEE International Conference on Personal Wireless Communications Proceedings, pp. 80-84, XP000992269, 1997.
Lacroix, et al.: “A Study of OFDM Parameters for High Data Rate Radio LAN's,” 2000 IEEE 51st Vehicular Technology Conference Proceedings, vol. 2, May 15-18, 2000, pp. 1075-1079.
Leon, et al., “Cyclic Delay Diversity for Single Carrier-Cyclic Prefix Systems,” Conference Record of the Thirty-Ninth Asilomar Conference on Signals, Systems and Computers, Oct. 28, 2005, Piscataway, NJ, pp. 519-523.
Lott: “Comparison of Frequency and Time Domain Differential Modulation in an OFDM System for Wireless ATM,” 1999 IEEE 49th Vehicular Technology Conference, vol. 2, Jul. 1999, pp. 877-883.
Mignone, et al.: “CD3-OFDM: A New Channel Estimation Method to Improve the Spectrum Efficiency in Digital Terrestrial Television Systems,” International Broadcasting Convention, Sep. 14-18, 1995 Conference Publication No. 413, IEE 1995, pp. 122-128.
Naofal Al-Dhahir: “A Bandwidth-Optimized Reduced-Complexity Equalized Multicarrier Transceiver”, IEEE Transactions on Communications, vol. 45, No. 8, Aug. 1997.
Naofal Al-Dhahir: “Optimum Finite-Length Equalization for Multicarrier Transceivers”, IEEE Trans. On Comm., pp. 56-64, Jan. 1996.
Nassar et al., “Introduction of Carrier Interference to Spread Spectrum Multiple Access,” Wireless Communications and Systems, 1999 Emerging Technologies Symposium, IEEE, Apr. 12-13, 1999, pp. 1-5.
Natarajan, et al., “High-Performance MC-CDMA via Carrier Interferometry Codes,” IEEE Transactions on Vehicular Technology, 2001, vol. 50 (issue 6).
Nokia, “Uplink Considerations for UTRA LTE”, 3GPP TSG RAN WG1#40bis, Beijing, CN, R1-050251, 3GPP, Apr. 4, 2005, pp. 1-9.
NTT DoCoMo, “Downlink Multiple Access Scheme for Evolved UTRA”, 3GPP R1-050249, 3GPP, Apr. 4, 2005, pp. 1-8.
Prasad, N. et al.: “Analysis of Decision Feedback Detection for MIMO Rayleigh Fading Channels and Optimum Allocation of Transmitter Powers and QAM Constellations,” pp. 1-10, 39th Annual Conference on Comm. Control and Comput., Monticello, IL Oct. 2001.
Qualcomm Europe: “Description and link simulations for OFDMA based E-UTRA uplink” 3GPP Draft; R1-051100, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre ; 650, Route Des Lucioles ; F-06921 Sophia-Antipolis Cedex ; France, vol. RAN WG1, no. San Diego, USA; 20051004, Oct. 4, 2005, pp. 1-10, XP050100715.
S. Nishimura et al., “Downlink Nullforming by a Receiving Antenna Selection for a MIMO/SDMA Channel”, Technical Search Report of Electric Information Communication Academic Conference, Feb. 28, 2002, vol. 101, No. 683, pp. 17-22, RCS 2001-286.
Sandeep Chennakeshu et al., “A comparison of diversity schemes for a mixed-mode slow frequency-hopped cellular system,” Global Telecommunications Conference, 1993, including a Communications Theory Mini-Conference. Technical Program Conference Record, IEEE in Houston. GLOBECOM '93., IEEE, Nov. 29, 1993, pp. 1749-1753, vol. 3.
Sari, et al., “Transmission Techniques for Digital Terrestrial TV Broadcasting,” IEEE Communications Magazine, Feb. 1995, pp. 100-109.
Schnell et al., “Application of IFDMA to Mobile Radio Transmission”, IEEE 1998 International Conference on Universal Personal Communications, vol. 2, Oct. 5-9, 1998, pp. 1267-1272.
Schnell et al.,: “A Promising New Wideband Multiple-Access Scheme for Future Mobile Communications Systems” European Transactions on Telecommunications, vol. 10, No. 4, Jul. 1999, pp. 417-427.
Shattil et al., “Array Control Systems for Multicarrier Protocols Using a Frequency-Shifted Feedback Cavity”, Radio and Wireless Conference EEE, Aug. 1-4, 1999, pp. 215-218.
Sorger U., et al., “Interleaved FDMA—A New Spread-Spectrum Multiple-Access Scheme, XP010284733,” Communications, Conference Record, IEEE, Atlanta, GA, 1998, 1013-1017.
Tellambura, “Use of m-sequences for OFDM Peak-to-Average Power Ratio Reduction,” Electronics Letters, vol. 33, No. 15, Jul. 17, 1997, pp. 1300-1301.
Widdup, B. et al., “A highly-parallel VLSI architecture for a list sphere detector,” IEEE International Conference, Paris, France, vol. 5, pp. 2720-2725 (2004).
Wiesel, A. et al.: “Efficient implementation of sphere demodulation” Signal Processing Advances in Wireless Communications, 2003. SPAWC 200 3. 4th IEEE Workshop on Rome. Italy Jun. 15-18, 2003, Piscataway, NJ, USA, IEEE, US, Jun. 15, 2003, pp. 36-40, XP010713463.
Xiaodong, et al., “M-Sequences for OFDM Peak-to-Average Power Ratio Reduction and Error Correction,” Electronics Letters, vol. 33, Issue 7, Mar. 27, 1997, pp. 554-555.
Zekri, et al., “DMT Signals with Low Peak-to-Average Power Ratio,” Proceedings, IEEE International Symposium on Computers and Communications, 1999, Jul. 6-8, 1999, pp. 362-368.
B. Sklar: “The process of thus correcting the channel-induced distortion is called equalization”, Digital Communications, PTR Prentice Hall, Upper Saddle River, New Jersey, 1998, Formatting and Baseband Transmission, Chap. 2, Section 2.11.2, pp. 104-106.
Dinis R; Falconer D; Tong Lam C; Sabbaghian M: “A Multiple Access Scheme for the Uplink of Broadband Wireless Systems” Global Telecommunications Conference, 2004. GLOBECOM '04. IEEE Dallas, TX, USA Nov. 29-Dec. 3, 2004, vol. 6, pp. 3808-3812, XP010758449 Piscataway , NJ, USA, IEEE.
Taiwan Search Report—TW095129021—TIPO—May 24, 2011.
Das, Arnab, et al. “Adaptive, asynchronous incremental redundancy (A-IR) with fixed transmission time intervals TTI for HSDPA.” IEEE, pp. 10-83-1087, year 2002.
Digital cellular telecommunications system (Phase 2+); Mobile radio interface layer 3 specification (GSM 04.08 version 7.7.1 Release 1998); ETSI EN 300 940 V7.7.1 (Oct. 2000), pp. 1,2,91-93.
Favre et al: “Self-Adaptive Transmission Procedure” IBM Technical Disclosure Bulletin, IBM Corporation, Sep. 1976, vol. 19, No. 4, pp. 1283-1284, New York, New York.
Fuchs, et al., “A Novel Tree-Based Scheduling Algorithm for the Downlink of Multi-User MIMO Systems with ZF Beamforming,” IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005, Proceedings, Philadelphia, PA, pp. 1121-1124.
Groe, et al., “CDMA Mobile Radio Design,” Sep. 26, 2001, Artech House, Norwood, MA 02062, pp. 257-259.
John B. Groe, Lawrence E. Larson, “CDMA Mobile Radio Design” Sep. 26, 2001, Artech House, Norwood, MA02062 580530, XP002397967, pp. 157-159.
Laroia, R. et al: “An integrated approach based on cross-layer optimization—Designing a mobile broadband wireless access network” IEEE Signal Processing Magazine, IEEE Service Center, Piscataway, NJ, US, vol. 21, No. 5, Sep. 2004, pp. 20-28, XP011118149.
Lau, et al., “On the Design of MIMO Block-Fading Channels with Feedback-Link Capacity Constraint,” IEEE Transactions on Communications, IEEE Service Center, Piscataway, NJ, US, v. 52, No. 1, Jan. 2004, pp. 62-70, XP001189908.
Lettieri et al: “Adaptive frame length control for improving wireless link throughput, range, and energy efficiency”, INFOCOM 98, 17th Annual Joint Conference of the IEEE Computer and Communications Societies, Mar. 29-Apr. 2, 1998, pp. 564-571, vol. 2, IEEE San Francisco, CA, New York, New York.
Molisch, et al., MIMO systems with antenna selection, IEEE Microwave Magazine, URL: http://ieeexplore.ieee.org/iel5/6668/28677/01284943.pdf, Retrieved on Dec. 8, 2006, pp. 46-56 (2004).
NTT DoCoMo, et al.: “Orthogonal Common Pilot Channel and Scrambling Code in Evolved UTRA Downlink,” 3GPP TSG RAN WG1 #42 on LTE, pp. 1-8 (Aug.-Sep. 2005).
TIA/EIA/IS-2000 “Standards for CDMA2000 Spread Spectrum Systems” Version 1.0 Jul. 1999.
TIA/EIA/IS-95 “Mobile Station-Base Station Compatibility Standard for Dual-Mode Wideband Spread Spectrum Cellular System” Jul. 1993.
TIA-1121.001 “Physical Layer for Ultra Mobile Broadband (UMB) Air Interface Specification,” 3GPP2 C.S0084-001-0, Version 2.0 (Aug. 2007).
TIA-1121.002 “Medium Access Control Layer for Ultra Mobile Broadband (UMB) Air Interface Specification,” 3GPP2 C.S0084-002-0, Version 2.0 (Aug. 2007).
Tomcik, J.: “MBFDD and MBTDD Wideband Mode: Technology Overview,” IEEE 802.20 Working Group Mobile Broadband Wireless Access, Jan. 2006, pp. 1-109, XP002429968.
Tomcik, J.: “QFDD Technology Overview Presentation,” IEEE 802.20 Working Group on Mobile Broadband Wireless Access, Slides/pp. 1-73, Nov. 15, 2005 and Oct. 28, 2005.
Toufik I et al., “Channel allocation algorithms for multi-carrier systems”, Vehicular Technology Conference, 2004. VTC2004-Fall. 2004 IEEE 60th Los Angeles, CA, USA Sep. 26-29, 2004, pp. 1129-1133, XP010786798, ISBN: 07-7803-8521-7.
“European Search Report—EP10011743, Search Authority—Munich Patent Office, Dec. 20, 2010”.
European Search Report—EP10012081, Search Authority—Munich Patent Office, Dec. 17, 2010.
European Search Report—EP10012082, Search Authority—Munich Patent Office, Dec. 20, 2010.
European Search Report—EP10012083, Search Authority—Munich Patent Office, Dec. 30, 2010.
Guo, K. et al.: “Providing end-to-end QoS for multimedia applications in 3G wireless networks,” Proceedings vol. 5242, SPIE ITCom 2003 Conf. Internet Multimedia Management Systems IV, Nov. 26, 2003, pp. 1-14, DOI: 10.1117/12.514061.
Sumii, Kenji et al.: “A Study on Computational Complexity Reduction of Iterative Decoding for Turbo-coded MIMO-SDM Using Sphere Decoding,” Technical Report of IEICE. RCS, Nov. 9, 2010, vol. 104, No. 675, pp. 43-48.
Taiwanese Search Report—095139893—TIPO—Dec. 30, 2010.
Tomcik, T.: “QTDD Performance Report 2,” IEEE C802.20-05/88, IEEE 802.20 Working Group on Mobile Broadband Wireless Access, <http://ieee802.org/20/>, pp. 1-56, XP002386798 (Nov. 15, 2005).
Translation of Office Action in Chinese Application 2006800295980 corresponding to U.S. Appl. No. 11/260,895, citing CN1346221 and CN1383631 dated Feb. 16, 2011.
Translation of Office Action in Japan application 2008-538193 corresponding to U.S. Appl. No. 11/261,065, citing JP11196109, JP10322304 and JP09008725 dated Mar. 8, 2011.
Translation of Office Action in Korean application 10-2007-7031029 corresponding to U.S. Appl. No. 11/260,931, citing US20030202491 and KR20040063057 dated Jan. 28, 2011.
Translation of Office Action in Canadian application 2625987 corresponding to U.S. Appl. No. 11/261,065, citing CA2557369 dated Apr. 12, 2011.
Translation of Office Action in Chinese application 200680040236.1 corresponding to U.S. Appl. No. 11/261,065, citing US20040048609 and CN1402916 dated Feb. 18, 2011.
Translation of Office Action in Chinese application 200680048265.2 corresponding to U.S. Appl. No. 11/260,931, citing US6904097, WO2004095851, CN1344451 dated Jan. 26, 2011.
Translation of Office Action in Chinese application 200680048832.4 corresponding to U.S. Appl. No. 11/261,158, citing CN1132474 dated Dec. 31, 2010.
Translation of Office Action in Japanese Application 2008-514880 corresponding to U.S. Appl. No. 11/445,377, citing JP2007519281 and JP2006505172 dated Nov. 9, 2010.
Translation of Office Action in Japanese application 2008-528103 corresponding to U.S. Appl. No. 11/260,924, citing JP2005502218, JP2004534456, JP2003348047, JP2003199173, JP2004529524, JP11508417, JP2001238269, JP2005130491 and JP2003500909 dated Feb. 8, 2011.
Translation of Office Action in Japanese Application 2008-529216 corresponding to U.S. Appl. No. 11/261,159, citing GB2348776 , WO2004098222, WO2005065062 and WO2004102815.Dated Jan. 11, 2011.
Translation of Office Action in Japanese application 2008-538181 corresponding to U.S. Appl. No. 11/511,735, citing WO04064295, JP2002515203, JP8288927, JP7336323 and JP200157545 dated Jan. 25, 2011.
Yongmei Dai,; Sumei Sun; Zhongding Lei; Yuan Li.: “A List Sphere Decoder based turbo receiver for groupwise space time trellis coded (GSTTC) systems,” 2004 IEEE 59th Vehicular Technology Conference, vol. 2, pp. 804-808, May 17, 2004, doi: 10.1109/VETECS.2004.1388940.
Alcatel-Lucent, et al., “Dedicated Reference Signals for Precoding in E-UTRA Downlink” 3GPP Draft; R1-071718, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre; 650, Route Des Lucioles; F-06921 Sophia-Antipolis Cedex; France, vol. RAN WG1, No. St. Julian; Apr. 3, 2007, XP050105640 [retrieved on Apr. 3, 2007].
Bengtsson, M. et at, “A Generalization of Weighted Subspace Fitting to Full-Rank Models”, IEEE Transactions on Signal Processing, IEEE Service Center, New York, NY, US, vol. 49, No. 5, pp. 1002-1012, May 1, 2001.
Dai, Y. et al., “A List Sphere Decoder based turbo receiver for groupwise space time trellis coded (GSTTC) systems,” 2004 IEEE 59th Vehicular Technology Conference, vol. 2, pp. 804-808, May 17, 2004, doi: 10.1109/VETECS.2004.1388940.
Dammann, A. et al., “Beamforming in Combination with Space-Time Diversity for Broadband OFDM Systems”, ICC 2002. 2002 IEEE International Conference on Communications. Apr. 28-May 2, 2002, pp. 165-171, XP010589479.
Guo, K. Et al., “Providing end-to-end QoS for multimedia applications in 3G wireless networks,” Proceedings vol. 5242, SPIE ITCom 2003 Conf. Internet Multimedia Management Systems IV, Nov. 26, 2003, pp. 1-14, DOI: 10.1117/12.514061.
Ken Murakami et al., “Status Toward Standardization at IEEE 802.3ah and items on the construction of GE-PON system ,” Technical Report of the Institute of Electronics, Information and Communication Engineers, Jun. 13, 2003, vol. 103, No. 124, pp. 1-6, IN2003-24.
Maniatis, I. et al., “Pilots for joint channel estimation in multi-user OFDM mobile radio systems,” 2002 IEEE Seventh International Symposium on Spread Spectrum Techniques and Applications, Prague, Czech Republic, Sep. 2, 2002, pp. 44-48, XP010615562.
Physical Channels and Multiplexing in Evolved UTRA Downlink TSG-RAN Working Group 1 Meeting, XX, XX, vol. RI-050590, Jun. 20, 2005, pp. 1-24, XP003006923 the whole document.
Siemens, “Evolved UTRA uplink scheduling and frequency reuse” [online], 3GPP TSG-RAN WG1 # 41 R1-050476, Internet <URL:http://www.3gpp.org/ftp/tsg—ran/WG1—RL1/TSGR1—41/Docs/R1-050476.zip>, May 9, 2005.
Sumii, Kenji, et al., “A Study on Computational Complexity Reduction of Iterative Decoding for Turbo-coded MIMO-SDM Using Sphere Decoding,” Technical Report of IEICE. RCS, Nov. 9, 2010, vol. 104, No. 675, pp. 43-48.
Tomcik, Jim: “QFDD Technology Overview Presentation,” IEEE 802.20 Working Group on Mobile Broadband Wireless Access, [Online] Nov. 15, 2005, pp. 1-73, XP002467626.
Viswanath, P. et al, “Opportunistic Beamforming Using Dumb Antennas” IEEE Transactions on Information Theory, IEEE USA, vol. 48, No. 6, Jun. 2002, pp. 1277-1294, XP002314708 ISSN: 0018-9448 abstract right-hand column, paragraph 1.
Voltz, P. J.,“Characterization of the optimum transmitter correlation matrix for MIMO with antenna subset selection”, IEEE Transactions on Communications, vol. 51, No. 11, pp. 1779-1782, (Nov. 1, 2003).
Yatawatta, S. et al., “Energy Efficient Channel Estimation in MIMO Systems”, 2005 IEEE International Conference on Acoustics, Speech, and Signal Processing, Mar. 18-23, 2005, Philadelphia, vol. 4, pp. 317-320, Mar. 18, 2005.
Miorandi D., et al., “Analysis of master-slave protocols for real-time industrial communications over IEEE 802.11 WLANs” Industrial Informatics, 2004. Indin '04, 2nd IEEE International Conference on Berlin, Germany Jun. 24-26, 2004. Piscataway, NJ, USA IEEE, Jun. 24, 2004, pp. 143-148, XP010782619, ISBN 0789385136, Para 3, point B.
Anonymous: “3GPP TS 36.211 V8.0.0; Evolved Universal Terrestrial Radio Access (E-UTRA); Physical channels and modulation (Release 8)” 3rd Generation Partnership Project; Technical Specification Group Radio Access Network, [Online] 2007, XP002520076 Retrieved from the Internet: URL:http://www.Sgpp.org/ftp/Specs/html-i nfo/36211.htm> [retrieved on Sep. 27, 2007] Section 5.
Jim Tomcik, QFDD and QTDD: Technology Overview, IEEE 802.20 Working Group on Mobile Broadband Wireless Access, Oct. 28, 2005, pp. 48-50, URL, http://www.IEEE802.org/20/contribs/C802.20-05-68.zip.
NOKIA: “Compact signalling of multi-code allocation for HSDPA”, version 2, 3GPP R1-02-0018, Jan. 11, 2002.
Sethi M, et al., “Code Reuse DS-CDMA- A Space Time Approach”, Proceedings of the 2002 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), pp. 2297-2300, May 13-17, 2002.
Samsung: “Uplink Transmission and Multiplexing for EUTRA”, 3GPP Draft; R1-050605 UL Multiplexing, Jun. 16, 2005, XP050111420.
Bhushan N., “UHDR Overview”, C30-20060522-037, Denver, CO, May 22, 2006, pp. 1-115.
Tachikawa (Editor); “W-CDMA Mobile Communication Systems,” John Wiley & Sons Ltd., Japan, Maruzen: pp. 82-213, Jun. 25, 2001.
LG Electronics: “PAPR comparison of uplink MA schemes”, 3GPP TSG RAN WG1 Meeting #41, R1-050475, May, 9-13, 2005, pp. 6.
Motorola,“Uplink Numerology and Frame Structure”, 3GPP TAG RAN1 #41 Meeting R1-050397, May 13, 2005.
Samsung Electonics Co. Ltd.; “Uplink Multiple Access and Multiplexing for Evolved UTRA”, R1-050439, May 3, 2005, pp. 1-22, XP55018616, Retrieved from the Internet: URL:http://www.3gpp.org/ftp/tsg—ran/VVG1—R1/TSGR1/DOCS/ [retrieved on Feb. 7, 2012].
Tomcik J., “QFDD and QTDD: Proposed Draft Air Interface Specification,” IEEE C802.20-05/69, IEEE 802.20 Working Group on Mobile Broadband Wireless Access, Oct. 28, 2005, P.1-6,1-7,1-16,6-65,7-11,7-33,7-37-7-55,9-21,9-22,9-24-9-32.
Digital cellular telecommunications system (Phase 2+); General Packet Radio Service (GPRS); Mobile Station (MS)-Base Station System (BSS)interface; Radio Link Control/Medium Access Control (RLC/MAC) protocol (GSM 04.60 version 8.4.1 Release 1999), 3GPP Standard; ETSI EN 301 349, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre; 650, Route Des Lucioles; F-06921 Sophia-Antipolis Cedex; France, No. V8.4.1, Oct. 1, 2000, pp. 1-243, XP050358534.
Related Publications (1)
Number Date Country
20070041404 A1 Feb 2007 US
Provisional Applications (3)
Number Date Country
60706639 Aug 2005 US
60710503 Aug 2005 US
60710428 Aug 2005 US