Signaling method in an OFDM multiple access system

Information

  • Patent Grant
  • 11032035
  • Patent Number
    11,032,035
  • Date Filed
    Monday, May 20, 2019
    5 years ago
  • Date Issued
    Tuesday, June 8, 2021
    3 years ago
Abstract
A method for reducing the peak-to-average ratio in an OFDM communication signal is provided. The method includes defining a constellation having a plurality of symbols, defining a symbol duration for the OFDM communication signal, and defining a plurality of time instants in the symbol duration. A plurality of tones are allocated to a particular communication device, and a discrete signal is constructed in the time domain by mapping symbols from the constellation to the time instants. A continuous signal is generated by applying an interpolation function to the discrete signal such that the continuous signal only includes sinusoids having frequencies which are equal to the allocated tones.
Description
TECHNICAL FIELD

This invention relates to an orthogonal frequency division multiplexing (OFDM) communication system, and more particularly to an OFDM communication system for a multiple access communication network.


BACKGROUND

Orthogonal frequency division multiplexing (OFDM) is a relatively well known multiplexing technique for communication systems. OFDM communication systems can be used to provide multiple access communication, where different users are allocated different orthogonal tones within a frequency bandwidth to transmit data at the same time. In an OFDM communication system, the entire bandwidth allocated to the system is divided into orthogonal tones. In particular, for a given symbol duration T available for user data transmission, and a given bandwidth W, the number of available orthogonal tones F is given by WT. The spacing between the orthogonal tones A is chosen to be 1/T, thereby making the tones orthogonal. In addition to the symbol duration T which is available for user data transmission, an additional period of time Tc can be used for transmission of a cyclic prefix. The cyclic prefix is prepended to each symbol duration T and is used to compensate for the dispersion introduced by the channel response and by the pulse shaping filter used at the transmitter. Thus, although a total symbol duration of T+Tc is employed for transmitting an OFDM symbol, only the symbol duration T is available for user data transmission and is therefore called an OFDM symbol duration.


In prior OFDM techniques, an OFDM signal is first constructed in the frequency domain by mapping symbols of a constellation to prescribed frequency tones. The signal constructed in the frequency domain is then transformed to the time domain by an inverse discrete Fourier transform (IDFT) or inverse fast Fourier transform (IFFT) to obtain the digital signal samples to be transmitted. In general, symbols of the constellation have a relatively low peak-to-average ratio property. For example, symbols of a QPSK constellation all have the same amplitude. However, after being transformed by the IDFT or IFFT, the resultant time domain signal samples are the weighted sum of all the symbols, and therefore generally do not preserve the desirable low peak-to-average ratio property. In particular, the resulting time domain signal typically has a high peak-to-average ratio.


Existing techniques for implementing OFDM communication systems can be highly inefficient due to the relatively high peak-to-average ratio when compared with other signaling schemes, such as single carrier modulation schemes. As a result, existing OFDM techniques are not well suited for a wireless multiple access communication network with highly mobile users because the high peak-to-average ratio of the transmitted signal requires a large amount of power at the base station and at the wireless device. The large power requirements result in short battery life and more expensive power amplifiers for handheld wireless communication devices or terminals. Accordingly, it is desirable to provide an OFDM technique which reduces the peak-to-average ratio of the signal to be transmitted, while simultaneously taking advantage of the larger communication bandwidth offered by an OFDM communication system.


SUMMARY

In one aspect of the communication system, power consumption associated with generating and transmitting OFDM signals is reduced as compared to the prior OFDM systems discussed above. The OFDM signaling method includes defining a constellation having a plurality of symbols, defining the symbol duration for the OFDM communication signal, and defining a plurality of time instants in the symbol duration. In a given symbol duration, a plurality of tones in the symbol duration are allocated to a particular transmitter and the signal to be transmitted is represented by a vector of data symbols from the symbol constellation. The symbols are first directly mapped to the prescribed time instants in the symbol duration. A continuous signal is then constructed by applying continuous interpolation functions to the mapped symbols such that the values of the continuous signal at the prescribed time instants are respectively equal to the mapped symbols and the frequency response of the continuous signal only contains sinusoids at the allocated tones. Finally the digital signal, which is to be transmitted, consists of samples of the continuous signal. Alternatively, the digital signal can be generated directly by applying discrete interpolation functions to the mapped symbols. As symbols from the constellation generally have good peak-to-average ratio property, proper choices of allocated frequency tones, prescribed time instants and interpolation functions can result in a minimized peak-to-average ratio of the continuous function and the digital signal samples.


In one implementation the method of directly generating the digital signal samples is to multiply the symbol vector consisting of symbols to be transmitted with a constant matrix, where the constant matrix is determined by the allocated frequency tones and the prescribed time instants. The matrix can be precomputed and stored in a memory.


In one aspect, a transmitter associated with the communication system is allocated a number of contiguous tones and the prescribed time instants are equally-spaced time instants over the entire OFDM symbol duration.


In another aspect, the transmitter is allocated a number of equally-spaced tones and the prescribed time instants are equally-spaced time instants over a fraction of the OFDM symbol duration.


In the above aspects, in addition to the general method, the digital signal samples can be constructed by expanding the mapped symbols to a prescribed set of time instants from minus infinity to plus infinity and interpolating the expanded set of the mapped symbols with a sinc function. Equivalently, the digital signal samples can also be generated by a series of operations including discrete Fourier transformation, zero insertion, and inverse discrete Fourier transformation.


To further reduce the peak-to-average ratio of the digital signal samples obtained through interpolation, when symbols of the constellation are mapped to the prescribed time instants, the constellations used by two adjacent time instants are offset by π/4.


In another aspect of the system, the real and the imaginary components of the resultant digital sample vector are cyclically offset before the cyclic prefix is added. In yet another aspect of the communication system, the intended transmitter is allocated more tones than the number of symbols to be transmitted. Symbols of the constellation are directly mapped to prescribed equally-spaced time instants. The digital signal samples are constructed by expanding the mapped symbols to a prescribed set of time instants from minus infinity to plus infinity and interpolating the expanded set of the mapped symbols with a function whose Fourier transformation satisfies the Nyquist zero intersymbol interference criterion, such as raised cosine functions. The digital signal samples can also be generated by a series of operations including discrete Fourier transformation, windowing, and inverse discrete Fourier transformation.


The details of one or more embodiments of the invention are set forth in the accompanying drawings and the description below. Other features, objects, and advantages of the invention will be apparent from the description and drawings, and from the claims.





DESCRIPTION OF DRAWINGS


FIG. 1 is a block diagram of an OFDM system.



FIG. 2A is a block diagram of an interpolation system used by the OFDM system of FIG. 1.



FIG. 2B is a block diagram of another interpolation system used by the OFDM system of FIG. 1.



FIG. 3A is a graph showing symbols mapped to prescribed time instants in the time domain according to the OFDM technique implemented by the system of FIG. 1.



FIG. 3B is a graph showing the frequency domain response of the graph of FIG. 3B.



FIG. 4A shows an implementation technique for producing a digital signal sample vector using time domain symbol mapping in the case where the allocated tones are contiguous.



FIG. 4B is a block diagram showing a communication system for producing a digital signal sample vector in the case where the allocated frequency tones are contiguous.



FIG. 4C is a graph showing the mapping of the symbols to the prescribed time instants, the expansion of the mapped symbols, and the use of a sinc function to interpolate the expanded symbols.



FIG. 4D is a graph showing the large peak-to-average ratio of the resulting digital signal sample vector when the symbols are mapped in the frequency domain in the prior OFDM systems.



FIG. 4E is a graph showing the reduced peak-to-average ratio of the resulting digital signal sample vector when the symbols are mapped in the time domain using the technique of FIGS. 4A-4C.



FIG. 5A shows another implementation technique for producing the digital signal sample vector using time domain symbol mapping in the case where the allocated tones are equally spaced in frequency.



FIG. 5B is a block diagram showing a communication system for producing a digital signal sample vector in the case where the allocated frequency tones are equally spaced.



FIG. 5C is a graph showing the mapping of the symbols to the prescribed time instants, the expansion of the mapped symbols, and the use of a sinc function to interpolate the symbols.



FIG. 5D is a graph showing the reduced peak-to-average ratio of the resulting digital signal sample vector when the symbols are mapped in the time domain using the technique of FIGS. 5A-5C.



FIG. 6 is a graph showing π/4 symbol rotation.



FIG. 7 shows the use of a cyclic shift of the real and imaginary signal components.



FIG. 8A is a graph showing application of a windowing function in the frequency domain to further reduce the peak-to-average ratio.



FIG. 8B is a block diagram showing a technique using more tones than the number of symbols to be transmitted for producing a digital signal sample vector.



FIG. 8C is a graph showing the use of an interpolation function corresponding to the window function of FIG. 8B to the symbols mapped to the prescribed time instants.



FIG. 8D is a graph showing the reduced peak-to-average ratio of the resulting digital signal sample vector when the symbols are mapped in the time domain using the technique of FIGS. 8A-8C.





Like reference symbols in the various drawings indicate like elements.


DETAILED DESCRIPTION

Referring to FIG. 1, an orthogonal frequency division multiplexing (OFDM) communication system 10 is shown. OFDM communication system 10 receives a first constellation of symbols {Bi} 12 and provides the symbols to a symbol-to-symbol mapping circuit 14, that produces a second constellation of complex symbols {Ci} 16. The complex symbols 16 represent data or a stream of data to be transmitted by the OFDM communication system, and may be chosen from a variety of symbol constellations including, but not limited to phase shift keying (PSK) and quadrature amplitude modulation (QAM) symbol constellations. The symbol-to-symbol mapping performed by the mapping circuit 14 is an optional step performed by the OFDM communication system 10.


Next, a time instant mapping circuit 18 maps each complex symbol 16 to a prescribed time instant within a given OFDM symbol duration. The mapping operation is performed in the time domain such that the mapping circuit 18 generates a discrete signal of mapped symbols within the time domain symbol duration. The output of the mapping circuit 18 is provided to an interpolation circuit 20, that produces a series of digital signal samples {Si} 22. The digital signal samples 22 are formed by sampling a continuous signal, which is constructed by applying one or more predetermined continuous interpolation functions to the mapped complex symbols 19. Alternatively, the digital signal samples 22 are formed by directly applying one or more predetermined discrete interpolation functions to the mapped complex symbols 19. When using the technique of applying discrete interpolation functions, no intermediate continuous signal is generated and the step of sampling the continuous signal is not necessary. The operation of the interpolation circuit 20 is described in greater detail below. A cyclic prefix circuit 24 receives the series of digital signal samples 22 from the interpolation circuit 20 and prepends a cyclic prefix to the digital signal samples 22. The cyclic prefix circuit 24 operates to copy and prepend the last portion of the digital signal sample vector S 22 to the beginning of the OFDM symbol duration. The resulting digital signal samples 22 with the prepended cyclic prefix are converted to an analog signal by a digital to analog converter 28. The resulting analog signal is further processed by a pulse shaping filter 30, the output of which is modulated to a carrier frequency, and amplified by a power amplifier unit 32 for transmission through an antenna 34.


In one implementation of the OFDM communication system 10, the symbol-to-symbol mapping circuit 14, the time instant mapping circuit 18, the interpolation circuit 20, and the cyclic prefix circuit 24 are implemented in a digital signal processor (DSP) 26, and may include a combination of hardware modules and/or software modules. These circuits 14, 18, 20, and 24 can also be implemented as separate discrete circuits within the OFDM communication system 10.


The details of the interpolation circuit 20 are shown in FIG. 2A. The interpolation circuit 20 includes an interpolation function module 21 that applies one or more continuous interpolation functions to the discrete signal of mapped symbols 19 to generate a continuous signal in which signal variation between adjacent symbols is minimized. Thus, the continuous signal has a low peak-to-average ratio. The interpolation functions may be precomputed and stored in an interpolation function memory 23 connected to the interpolation function module 21. A frequency tone and time instant allocation circuit 27 is connected to the interpolation function memory 23 and defines an allocated tone set selected from frequency tones distributed over a predetermined bandwidth associated with the OFDM communication system 10. The allocated tone set is then provided to the interpolation function memory 23. The frequency tone and time instant allocation circuit 27 also defines the prescribed time instants distributed over the time domain symbol duration, which can also be stored in the interpolation function memory 23 for use by the interpolation function module 21 as well as other modules within the DSP 26. The interpolation circuit 20 also includes a sampling circuit 25 for receiving and sampling the continuous signal at discrete time instants distributed over the time domain symbol duration to generate the vector of digital signal samples 22. Alternatively, in FIG. 2B the interpolation function module 21 applies one or more discrete interpolation functions to the discrete signal of mapped symbols 19 to directly generate the digital signal sample vector 22, in which case the sampling circuit 25 (of FIG. 2A) is not needed. Through applying the discrete interpolation functions, the interpolation function module 21 effectively combines the processing steps of applying the continuous interpolation functions and sampling the intermediate continuous signal.



FIG. 3A graphically depicts the signal processing steps performed by the various circuits of the DSP 26. More specifically, FIG. 3A shows the construction of the signal to be transmitted in a given OFDM time domain symbol duration 40. The time domain symbol duration 40 is a time interval from 0 to T. For purposes of the following description, the OFDM symbol duration T does not include the cyclic prefix. The signal to be transmitted in the symbol duration 40 is represented by complex symbols C1, C2, C3, . . . , CM 16 that are mapped to the prescribed time instants, where M denotes the number of symbols to be transmitted in the symbol duration 40.


In one implementation, the OFDM communication system 10 is a multiple access communication system where the entire bandwidth available to all transmitters within the system is divided into F orthogonal frequency tones, f1, f2, . . . , fF. In the given symbol duration 40, a particular transmitter operating within a multiple access communication system is allocated M frequency tones fi(1), fi(2), . . . , fi(M), which is a subset of f1, f2, . . . , fF, (the total number of frequency tones) in order to transmit the signal. As part of this implementation, the number of tones allocated to a particular transmitter is equal to the number of symbols to be transmitted by that transmitter. Later in FIG. 8A, the number of allocated tones can be greater than the number of symbols to be transmitted. The remaining frequency tones can be used by other transmitters within the communication system. This technique allows OFDM communication system 10 to operate as a multiple access communication system.


The complex data symbols C1, C2, C3, . . . , CM 16 are first mapped to t1, t2, t3, . . . , tM, respectively, where t1, t2, t3, . . . , tM are M prescribed time instants within the time domain symbol duration 40. The mapping operation generates a discrete signal of mapped symbols. It should be noted that the number of prescribed time instants is equal to the number of symbols M to be transmitted. As described above, the symbol mapping occurs in the time domain. Continuous interpolation functions 42 are then applied to the discrete signal of mapped symbols 16 to generate a continuous function CF(t) for tin the time interval from 0 to T.


The interpolation functions 42 are constructed such that the values of the continuous function CF(t) at time instants t1, t2, t3, . . . , tM are respectively equal to C1, C2, C3, . . . , CM and the frequency response of the continuous function CF(t) contains only sinusoids at the allocated tones. Therefore, CF(t) is constructed as







CF


(
t
)


=




k
=
1

M




A
k



e

J





2

π






f

i


(
k
)




t









where J=√{square root over (−1)} and coefficients Ak are given by







[




A
1











A
M




]

=



[




e

J





2

π






f

i


(
1
)





t
1









e

J





2

π






f

i


(
M
)





t
1





















e

J





2

π






f

i


(
1
)





t
M









e

J





2

π






f

i


(
M
)





t
M






]


-
1




[




C
1











C
M




]







Thus, each coefficient Ak is generated by multiplying a matrix of predetermined sinusoids with the single column of data symbols C1, C2, C3, . . . , CM 16.



FIG. 3B shows the frequency response of the continuous function CF(t).


More specifically, FIG. 3B shows that the frequency response of the continuous function is non-zero only at the allocated frequency tones fi(1), fi(2), . . . , fi(M), and is zero at all other frequency tones.


The output of the DSP 26 is a vector of digital signal samples S 22, which are the samples of the continuous function CF(t) at discrete time instants 0, T/N, 2T/N, . . . , T(N−1)/N, that is, S1=CF(0), S2=CF(T/N), S3=CF(2T/N), . . . , SN=CF(T(N−1)/N), where N is the number of discrete time instants in the vector of digital signal samples 22. In a general form, t1, . . . , tM may not necessarily be equal to any of the time instants 0, T/N, 2T/N . . . , T(N−1)/N. Therefore, while the digital signal samples S 22 may occur at the time instants t1, . . . , tM, the OFDM communication system 10 does not require that the time instants 0, T/N, 2T/N . . . , T(N−1)/N be equal to t1, . . . , tM.


In another implementation of OFDM communication system 10, the digital signal samples S 22 may be generated by the DSP 26 by directly multiplying a matrix of precomputed sinusoidal waveforms Z, operating as discrete interpolation functions, with the discrete signal of mapped symbols C in order to satisfy the transformation function S=ZC according to the following:









S
=


[




S
1











S
N




]

=



[




e

J





2

π






f

i


(
1
)




0








e

J





2

π






f

i


(
M
)




0




















e

J





2

π






f

i


(
1
)




T



N
-
1

N









e

J





2

π






f

i


(
M
)




T



N
-
1

N






]



[




A
1











A
M




]


=



[




e

J





2

π






f

i


(
1
)




0








e

J





2

π






f

i


(
M
)




0




















e

J





2

π






f

i


(
1
)




T



N
-
1

N









e

J





2

π






f

i


(
M
)




T



N
-
1

N






]



[




e

J





2

π






f

i


(
1
)





t
1









e

J





2

π






f

i


(
M
)





t
1





















e

J





2

π






f

i


(
1
)





t
M









e

J





2

π






f

i


(
M
)





t
M






]



-
1









[




C
1











C
M




]


=
ZC





where C represents the symbol vector, and the matrix Z represents the product of the two matrices in the second line of the above equation. Each column (i) of matrix Z represents the interpolation function 42 of a corresponding symbol Ci to generate the digital signal samples S 22. As such, the matrix Z can be pre-computed and stored in the interpolation function memory 23 of the interpolation circuit 20 (FIG. 2B). The interpolation circuit 20 then applies the discrete interpolation functions 42 defined by the matrix Z to the discrete signal of mapped complex symbols C 16 in order to satisfy the criteria of S=ZC and to generate the vector of digital signal samples 22.


The purpose of constructing the signal in the time domain is to directly map the symbols 16, which have a desirable low peak-to-average ratio property, to the prescribed time instants within the symbol duration 40. Appropriate interpolation functions 42 are selected to obtain the continuous function CF(t) and the digital signal samples 22 such that the desirable low peak-to-average ratio property of the symbols 16 is substantially preserved for the continuous function and for the digital signal samples 22. The peak-to-average ratio property of the resulting (interpolated) continuous function CF(t) and the digital signal samples 22 is dependent upon the interpolation functions 42, the choice of allocated frequency tones fi(1), fi(2), . . . , fi(M) from the set of tones, and the prescribed time instants t1, . . . , tM.


Referring to FIG. 4A, one implementation of the OFDM communication system 10 allocates tones fi(1), fi(2), . . . , fi(M) to the transmitter associated with the communication system that are a subset of contiguous tones in the tone set f1, f2, . . . , fF. Therefore, fi(k)=f0+(k−1)Δ, for k=1, . . . , M, where M is the number of symbols. If the OFDM communication system 10 is a multiple access system, each transmitter associated with the communication system is allocated a non-overlapping subset of frequency tones. For purposes of description, let f0=0. The construction for the other cases where f0≠0 can be similarly obtained.


Complex symbols C1, . . . , CM 16 are mapped in the time domain to the following time instants tk=(k−1)T/M, for k=1, . . . , M. As part of this implementation, the prescribed time instants t1, . . . , tM are equally-spaced time instants uniformly distributed over the entire OFDM symbol duration 40 as shown in the first time domain graph of FIG. 4A. Given the choice of the allocated frequency tones and prescribed time instants, the matrix Z, which is used to generate the digital signal samples S as discussed in FIGS. 3A-3B, can be simplified to






Z
=




1
M



[




e

J





2

π






f

i


(
1
)




0








e

J





2

π






f

i


(
M
)




0




















e

J





2

π






f

i


(
1
)




T



N
-
1

N









e

J





2

π






f

i


(
M
)




T



N
-
1

N






]




[




e


-
J






2

π






f

i


(
1
)





t
1









e


-
J






2

π






f

i


(
1
)





t
M





















e


-
J






2

π






f

i


(
M
)





t
1









e


-
J






2

π






f

i


(
M
)





t
M






]


.





The second time domain graph of FIG. 4A shows the resulting digital signal sample vector S 22 after the interpolation circuit 20 applies the interpolation functions 42 defined by the matrix Z to the complex symbols 16 according to the expression S=ZC. As part of this implementation, the sampling module 25 is not generally used as the digital signal sample vector S 22 is directly generated from the discrete signal of mapped symbols using the transformation function S=ZC.


Turning to FIG. 4B, a digital processing system 50 provides another technique for obtaining the vector of digital signal samples S. A DFT circuit 52 receives a discrete signal of complex data symbols Ci, and calculates the frequency responses A1, . . . , AM, at tones fi(1), fi(2), . . . , fi(M), through an M-point discrete Fourier transform (DFT). The vector [A1, . . . , AM] 54 output by the DFT circuit 52 is then expanded to a new vector of length N (the total number of time instants in the discrete signal vector S) by zero insertion at block 56. More specifically, this process involves putting the kth symbol Ak to the i(k)th element of the new vector, for k=1, . . . , M, where fi(k) is the kth tone allocated to the transmitter, and inserting zeros in all the remaining elements. Finally, an IDFT circuit 58 performs an N-point inverse discrete Fourier transform on the resulting vector (after zero insertion) to obtain the digital signal sample vector S. The collective procedure of DFT, zero insertion and IDFT is one way of implementing the discrete interpolation functions.


Turning to FIG. 4C, another technique for obtaining the digital signal samples S is shown. For simplicity of description, it is assumed that the allocated contiguous tones fi(1), fi(2), . . . , fi(M) are centered at frequency 0. The construction for the other cases where the allocated tones are not centered at frequency 0 can be similarly obtained. As with FIG. 4A, the prescribed time instants t1, . . . , tM are equally-spaced time instants uniformly distributed over the entire OFDM symbol duration 40.


The complex symbols C1, . . . , CM are first mapped in the time domain to time instants t1, . . . tM respectively. Next, the mapped symbols C1, . . . , CM are leftwards and rightwards shifted and replicated to an expanded set of prescribed time instants, which is a superset of t1, . . . tM and consists of an infinite number of equally-spaced time instants covering the time interval from −∞ to +∞. This technique creates an infinite series of mapped symbols C. The continuous function CF(t) is then constructed by interpolating the infinite series of mapped symbols using a sinc interpolation function 60. Mathematically, the above steps construct the continuous function CF(t) as







CF


(
t
)


=




i
=
1

M




{


C
i






k
=

-







sin






c
(


t
-

t
i

-
kT

,

T
M


)




}

.







where sinc(a,b)=sin(πa/b)/(πa/b). The sine interpolation function 60 can also be precomputed and stored in the interpolation function memory 23. As discussed in FIG. 3A the digital signal samples S 22 are the samples of the continuous function CF(t) at time instants 0, T/N, . . . , T(N−1)/N. In FIGS. 4A-4C, if N is a multiple of M, then S1+(k−1)N/M=Ck, for k=1, . . . , M. It should be noted that the continuous function CF(t) only applies to the symbol duration 40 from 0 to T. The use of time interval from −∞ to +∞ is solely for the purpose of mathematically constructing CF(t). The discrete interpolation functions, which combine the continuous interpolation functions and the sampling function, can be derived easily from the above description.


For comparison purposes, FIG. 4D illustrates the resulting peak-to-average ratio for a digital signal sample vector S 62 and its associated transmitted OFDM signal 64 produced by symbols 16 where the signal is constructed in the frequency domain. As described above, this known technique of mapping the symbols 16 in the frequency domain produces a large signal variation in the transmitted OFDM signal 64 and results in a large peak-to-average ratio.



FIG. 4E illustrates the resulting small signal variation and low peak-to-average ratio of the digital signal sample vector S 66 associated with the transmitted OFDM signal 68. As will be appreciated by comparing FIGS. 4D and 4E, mapping the constellation of complex symbols 16 in the time domain produces an OFDM signal 68 having a significantly reduced peak-to-average ratio.



FIG. 5A shows a second implementation of the OFDM communication system 10, and serves to further generalize the system shown in FIGS. 4A-4C. As part of OFDM system 10, tones, fi(1), fi(2), . . . , fi(M), allocated to the transmitter associated with the communication system, are a subset of equally-spaced tones in the tone set f1, f2, . . . , fF. Therefore, fi(k)=f0+(k−1)LΔ, for k=1, . . . , M, and L is a positive integer number representing the spacing between two adjacent allocated frequency tones. When L=1, this implementation is equivalent to the implementation technique described in FIGS. 4A-4C. For the sake of description, let f0=0. The construction for the other cases where f0≠0 can be similarly obtained.


In this case where the allocated tones are equally-spaced tones, the constructed continuous function CF(t) is identical in each of the L time intervals, [0,T/L), [T/L,2T/L), . . . , and [(L−1)T/L, T/L). As part of this technique, symbols C1, . . . , CM 16 are mapped to the following time instants tk=(k−1)T/M/L, for k=1, . . . , M. In this implementation, the prescribed time instants t1, . . . , tM are equally-spaced time instants uniformly distributed over a fraction (1/L) of the symbol duration 70. As a comparison, in the case of allocated contiguous tones (FIG. 4A), the prescribed time instants are equally-spaced and distributed over the entire symbol duration, as discussed with respect to FIG. 4A.


The procedure for obtaining the digital signal samples S 22 described in FIG. 4A can also be applied with respect to FIG. 5A. More specifically, the digital signal sample vector S is the product of matrix Z (defining the discrete interpolation functions) and the symbol vector C. Given the choice of the allocated frequency tones and prescribed time instants, the matrix Z, which is used to generate the digital signal samples 22 from the discrete signal of mapped symbols, can be simplified to the same formula as in FIG. 4A with the only change in the definition off fi(1), fi(2), . . . , fi(M) and t1, . . . , tM.


In FIG. 5B, the procedure of obtaining the digital signal sample vector S 22 described in FIG. 4B can also be applied to the case of allocated frequency tones that are equally spaced tones. More specifically, a digital processing system 100 provides another technique for obtaining the vector of digital signal samples S. A DFT circuit 102 receives a discrete signal of complex data symbols Ci and calculates the frequency responses A1, . . . , AM, at tones fi(1), fi(2), . . . , fi(M), through an M-point discrete Fourier transform (DFT). The vector [A1, . . . AM] 104 output by the DFT circuit 102 is then expanded to a new vector of length N (the total number of time instants in the digital signal sample vector S) by zero insertion at block 106. More specifically, this process involves putting the kth symbol Ak to the i(k)th element of the new vector, for k=1, . . . , M, where fi(k) is the kth tone allocated to the transmitter, and inserting zeros in all the remaining elements. Finally, an IDFT circuit 108 performs an N-point inverse discrete Fourier transform on the resulting vector (after zero insertion) to obtain the time domain digital signal sample vector S. The collective procedure of DFT, zero insertion and IDFT is one way of implementing the discrete interpolation functions.



FIG. 5C is the counterpart of FIG. 4C, where symbols C1, . . . , CM are first mapped to t1, . . . , tM respectively over a fraction (1/L) of the symbol duration 70. The symbol mapping is also performed in the time domain. Next the mapped symbols C1, . . . , CM are leftwards and rightwards shifted and replicated to an expanded set of prescribed time instants from −∞ to +∞ which creates an infinite series of symbols. The continuous function CF(t) is then constructed by interpolating the infinite series of mapped symbols with a sinc interpolation function 72. Thus, the continuous function CF(t) includes the digital signal samples mapped to the prescribed time instants as well as digital sample points between the prescribed time instants. Mathematically, the above steps construct the continuous function as







CF


(
t
)


=




i
=
1

M




{


C
i






k
=

-







sin






c


(


t
-

t
i

-

kT


1
L



,


T
M



1
L



)





}

.







With continued reference to FIG. 5C, each sinc interpolation function 72 is narrower and therefore decays faster than the sinc interpolation function 60 shown in FIG. 4C. The sinc interpolation function 72 can also be precomputed and stored in the interpolation function memory 23 for use by the interpolation function module 21. The digital sample vector S 22 can be obtained in the same technique shown in FIG. 4C. In FIGS. 5A and 5C, if N is a multiple of ML, then S1+(k−1)N/M/L+(j−1)N/L=Ck, for k=1, . . . , M, and j=1, . . . , L. The discrete interpolation functions, which combine the continuous interpolation functions and the sampling function, can be derived easily from the above description.



FIG. 5D illustrates the resulting small signal variation and low peak-to-average ratio of the digital signal sample vector S 74 associated with the transmitted OFDM signal 76. As will be appreciated by comparing FIGS. 4D and 5D, mapping the constellation of complex symbols 16 in the time domain produces an OFDM signal 76 having a significantly lower peak-to-average ratio.


Referring now to FIG. 6, a π/4 symbol rotation technique is used to further reduce the peak-to-average ratio of the transmitted OFDM signal. At an OFDM symbol duration, if symbols B1, . . . , BM of the constellation are to be transmitted, symbols B1, . . . , BM are mapped to another block of complex symbols C1, . . . , CM, where each odd number symbol remains unchanged and each even number symbol is phase rotated by π/4. For example, if symbols B1, . . . , BM belong to a QPSK constellation {0, π/2, π, π3/2}, the odd number symbols Ck still belong to the same QPSK constellation, while after being phase rotated the even number symbols Ck belong to another QPSK constellation {π/4, π3/4, π5/4, π7/4}. Symbols C1, . . . , CM are then used to construct the digital signal samples 22 in the time domain as described above with respect to FIGS. 3A-5C.


With reference to FIG. 7, another technique for reducing the peak-to-average ratio is shown, which introduces a cyclic offset of the real and imaginary signal components. This technique involves a first step of offsetting the imaginary components of the digital signal samples S 22, which have been generated using the technique of FIGS. 3A-5C, by an integer number of samples. If necessary, the technique then involves a second step of adjusting the timing by a fraction of a sample period between the real and the imaginary signal components in the transmit path.


At an OFDM symbol duration, if the digital signal samples S1, S2, . . . , SN have been obtained using the method as described in FIGS. 3A-5C, the digital signal sample vector S is then mapped to another vector S′ as follows. The real component of digital signal sample S′k is equal to that of digital signal sample Sk. The imaginary component of digital signal sample S′k is equal to that of digital signal sample Sj where index j=(k+d−1)mod N+1, for k=1, . . . , N, with mod representing a module operation. The parameter d is an integer representing the cyclic offset, in terms of number of samples, between the real and imaginary components.


In one implementation, the value of d is determined by







N

2





LM


,





where L is discussed in FIG. 5A. In one aspect of this technique, d is chosen to be close to







N

2





LM


.





For example, d can be the integer closest to







N

2





LM


,





the largest integer not greater than







N

2





LM


,





or the smallest integer not smaller than







N

2





LM


.





In one example, d is chosen to be the largest integer not greater than







N

2





LM


.





This example can be easily extended for other choices of d.


The digital signal sample vector S′ is then passed to the cyclic prefix prepender circuit 24, as shown in FIG. 1. Therefore, the operation of half symbol cyclic shifting is carried out before the operation of prepending the cyclic prefix, such as that performed by the cyclic prefix circuit 24 of FIG. 1.


Not specifically shown in FIG. 7, when or after the sample vector S′ and the cyclic prefix are outputted to the digital to analog converter 28, the imaginary components are further delayed by an amount of








(


N

2





LM


-
d

)



T
N


,





which is a fraction of a sample period T/N.


As a variation of the technique shown in FIG. 7 (not specifically shown), another technique for achieving a similar result can be used to eliminate the second step of adjusting timing by a fraction of a sample period between the real and the imaginary signal components in the transmit path. As part of this technique, the real and the imaginary components of the desired digital signal samples S 22 are generated separately as described by the following.


A first series of digital signal samples 22 are generated using the technique of FIGS. 3A-5C. The real components of the desired digital signal samples 22 are equal to those of the first series of samples. A second series of digital signal samples 22 are generated using the technique of FIGS. 3A-5C except for the following changes. The imaginary components of the desired digital signal samples are equal to those of the second series of samples. In the general method described in FIGS. 3, 4A, and 5A, the matrix








[




e

J





2





π






f

i


(
1
)




0








e

J





2





π






f

i


(
M
)




0




















e

J





2





π






f

i


(
1
)




T



N
-
1

N









e

J





2





π






f

i


(
M
)




T



N
-
1

N






]






is changed to









[




e

J





2





π







f

i


(
1
)





(

0
-

T

2





LM



)










e

J





2





π







f

i


(
M
)





(

0
-

T

2





LM



)






















e

J





2





π







f

i


(
1
)





(


T



N
-
1

N


-

T

2





LM



)










e

J





2





π







f

i


(
M
)





(


T



N
-
1

N


-

T

2





LM



)







]

.





In the block diagram method described with regard to FIG. 4B, an additional operation is required after zero insertion (block 56) and before N-point IDFT (block 58), where each element k in the expanded length N vector is phase rotated by







e


-
J






2





π






f
k



T

2





LM




.




Referring to FIGS. 8A-8D, another technique for further reducing the peak-to-average ratio is implemented by allocating more frequency tones than the number of complex symbols to be transmitted in a symbol duration 40. In FIGS. 3-7, the number of tones allocated to the transmitter associated with the communication system is equal to the number of symbols to be transmitted in a given OFDM symbol duration. Compared with the other techniques described with respect to the previous figures, the technique of FIGS. 8A-8D requires additional overhead of bandwidth to transmit the same number of complex symbols.


For example, if the communication system 10 is allocated M+Mex contiguous frequency tones, fi(1), fi(2), . . . , fi(M+Mex), and M symbols C1, . . . , CM of the constellation are to be transmitted at an OFDM symbol duration, from the comparison of FIGS. 4A and 5A, the case of allocated contiguous tones can be easily extended to the case of allocated equally-spaced tones. As part of this implementation of the OFDM communication system 10, Mex is a positive number representing the number of excess tones to be used and is assumed to be an even number. Therefore, the allocated tone








f

i


(
k
)



=


f
0

+


(

k
-


M
ex

2

-
1

)


Δ



,





for k=1, . . . M+Mex. For purposes of description, let f0=0. The construction for the other cases where f0≠0 can be similarly obtained.


As with the technique described with respect to FIG. 4A, the prescribed time instants are tk=(k−1)T/M, for k=1, . . . , M, that is, the prescribed time instants t1, . . . , tM are equally-spaced time instants in the symbol duration 40.


As part of this technique shown in FIG. 8A, P(f) is a smooth windowing function 90 in the frequency domain, which is non-zero only over interval [fi(1), fi(M+Mex)]. In addition, P(f) 90 also satisfies the Nyquist zero intersymbol interference criterion, i.e.,










k
=

-







P


(

f
-

kM





Δ


)



=
1





for any frequency f, where □ is the spacing between adjacent tones.



FIG. 8B shows the block diagram of the technique. As described above, a symbol-to-symbol mapping is optionally performed to generate a discrete signal of mapped complex symbols C1, . . . , CM, 16. The frequency responses A1, . . . , AM 84 are calculated through an M-point discrete Fourier transform (DFT) of the complex symbols 16 at block 82. At block 86, vector [A1, . . . , AM] 84 is cyclically expanded to a new vector A′ of length N and windowed with a windowing function 90 as follows:

A′kAg(k)*P((k−1)□+f1)

where index g(k)=mod(k−i(1)−Mex/2,M)+1, for k=1, . . . , N.


At block 88, the digital signal sample vector S is obtained by taking an N-point inverse discrete Fourier transform (IDFT) of the new vector A′. Finally, the cyclic prefix is added by cyclic prefix circuit 24 as described above with regard to FIG. 1.


To provide additional insight to the above signal construction technique, assume that the allocated tones fi(1), fi(2), . . . , fi(M+Mex) are centered at frequency 0. In FIG. 8C (as with FIG. 4C), symbols C1, . . . , CM are first mapped to equally-spaced time instants in the symbol duration 40, and are then leftwards and rightwards shifted and replicated from −∞ to +∞. What is different from FIG. 4C is that a different interpolation function 92, which is determined by the windowing function 90, is used to generate the continuous function,

CF(t)=Σi=1MCiΣk=−∞p(t−ti−kT)

where p(t) 92 is the time domain response of P(f) 90. As with FIG. 4C, the digital signal samples are obtained by letting t=0, . . . , T(N−1)/N.


In one exemplary aspect of this technique, if a raised cosine windowing function is used, i.e.,







P


(
f
)


=

{





T
M











i

f








f



<


(

1
-
β

)



M

2





T











T

2





M




{

1
+

cos


[



π





T


β





M




(



f


-



(

1
-
β

)


M


2





T



)


]



}











if






(

1
-
β

)



M

2





T






f





(

1
+
β

)



M

2

T









0









if







f



>


(

1
+
β

)



M

2





T













where β=(Mex+2)/M represents the percentage of excess tone overhead, then, the interpolation function p(t) 92 is given by







p


(
t
)


=



sin


(

π






tM
/
T


)



π






tM
/
T







cos


(

π





β






tM
/
T


)



1
-

4






β
2



t
2




M
2

/

T
2





.







As β increases, the interpolation function p(t) 92 decays faster, thereby reducing the probability of having large peak at samples between ti.



FIG. 8D shows the resulting small signal variation and low peak-to-average ratio of the digital signal sample vector S 94 associated with the transmitted OFDM signal 96. As will be appreciated, mapping the constellation symbols 16 in the time domain produces an OFDM signal 96 having a significantly lower peak-to-average signal ratio.


A number of embodiments of the invention have been described. Nevertheless, it will be understood that various modifications may be made without departing from the spirit and scope of the invention. Accordingly, other embodiments are within the scope of the following claims.

Claims
  • 1. A method of wireless communication, comprising: mapping received data symbols to a discrete signal of complex data symbols;receiving the discrete signal of complex data symbols;calculating, based on the received discrete signal of complex data symbols, frequency responses corresponding to tones through an M-point DFT;outputting a frequency response vector of length M;expanding the frequency response vector of length M to a new vector of length N by inserting zero-value symbols corresponding to tones other than tones allocated to a transmitter;performing an N-point inverse discrete Fourier transform operation on the new vector of length N after zero insertion to obtain a vector of digital signal samples; andpre-pending a cyclic prefix to the vector of digital signal samples.
  • 2. The method of claim 1, further comprising generating a digital-to-analog converted OFDM-based signal using the vector of digital signal samples with the pre-pended cyclic prefix for transmission.
  • 3. The method of claim 1, wherein the tones are allocated tones available for transmission.
  • 4. The method of claim 1, wherein the allocated tones are contiguous, and wherein the new vector of length N is larger than the frequency response vector of length M, and wherein the allocated tones are equally spaced.
  • 5. The method of claim 1, wherein the new vector of length N includes entries corresponding to the tones other than the tones allocated to the transmitter.
  • 6. The method of claim 1, wherein the discrete signal of complex data symbols includes odd numbered symbols and even numbered symbols, the mapping further comprising phase rotating each even numbered symbol by π/4.
  • 7. An apparatus for wireless communication, comprising: a symbol-to-symbol mapping circuit for mapping received data symbols to a discrete signal of complex data symbols;a digital signal processor (DSP), the DSP configured for: receiving the discrete signal of complex data symbols;calculating, based on the received discrete signal of complex data symbols, frequency responses corresponding to tones through an M-point DFT;outputting a frequency response vector of length M;expanding the frequency response vector of length M to a new vector of length N by inserting zero-value symbols corresponding to tones other than tones allocated to a transmitter;performing an N-point inverse discrete Fourier transform operation on the new vector of length N after zero insertion to obtain a vector of digital signal samples; andpre-pending a cyclic prefix to the vector of digital signal samples.
  • 8. The apparatus of claim 7, further comprising a digital-to-analog converter for generating an OFDM-based signal using the vector of digital signal samples with the pre-pended cyclic prefix for transmission.
  • 9. The apparatus of claim 7, wherein the tones are allocated tones available for transmission.
  • 10. The apparatus of claim 7, wherein the allocated tones are contiguous, and wherein the new vector of length N is larger than the frequency response vector of length M, and wherein the allocated tones are equally spaced.
  • 11. The apparatus of claim 7, wherein the new vector of length N includes entries corresponding to the tones other than the tones allocated to the transmitter.
  • 12. The apparatus of claim 7, wherein the discrete signal of complex data symbols includes odd numbered symbols and even numbered symbols, and wherein symbol-to-symbol mapping circuit is further adapted for phase rotating each even numbered symbol by π/4.
  • 13. An apparatus for wireless communication, in a system comprising: a processor;memory in electronic communication with the processor; andinstructions stored in the memory and operable, when executed by the processor, to cause the apparatus to: map received data symbols to a discrete signal of complex data symbols;receive the discrete signal of complex data symbols;calculate, based on the received discrete signal of complex data symbols, frequency responses corresponding to tones through an M-point DFT;output a frequency response vector of length M;expand the frequency response vector to a new vector of length N by inserting zero-value symbols corresponding to tones other than tones allocated to a transmitter;perform an N-point inverse discrete Fourier transform operation on the new vector of length M after zero insertion to obtain the vector of digital samples; andpre-pend a cyclic prefix to the vector of the digital signal samples.
  • 14. The apparatus of claim 13, wherein the instructions are further executable by the processor to generate an OFDM-based signal using the vector of digital signal samples with the pre-pended cyclic prefix for transmission.
  • 15. The apparatus of claim 13, wherein the tones are allocated tones available for transmission.
  • 16. The apparatus of claim 13, wherein the allocated tones are contiguous, and wherein the new vector of length N is larger than the frequency response vector of length M, and wherein the allocated tones are equally spaced.
  • 17. The apparatus of claim 13, wherein the new vector of length N includes entries corresponding to the tones other than the tones allocated to the transmitter.
  • 18. The apparatus of claim 13, wherein the discrete signal of complex data symbols includes odd numbered symbols and even numbered symbols, and wherein the instructions are further executable by the processor to adapt for phase rotating each even numbered symbol by π/4.
CROSS-REFERENCE TO RELATED APPLICATIONS

The present application is a continuation of U.S. patent application Ser. No. 15/226,181, filed on Aug. 2, 2016, now allowed, which is a continuation of U.S. patent application Ser. No. 13/619,460, filed Sep. 14, 2012, now issued as U.S. Pat. No. 9,426,012 on Aug. 23, 2016, which is a continuation of U.S. patent application Ser. No. 13/158,170, filed Jun. 10, 2011, now issued as U.S. Pat. No. 8,295,154 on Oct. 23, 2012, which is a continuation of U.S. patent application Ser. No. 12/171,155, filed Jul. 10, 2008, now issued as U.S. Pat. No. 8,014,271 on Sep. 6, 2011, which is a continuation of U.S. patent application Ser. No. 09/805,887, filed on Mar. 15, 2001, now issued as U.S. Pat. No. 7,295,509 on Nov. 13, 2007 which is hereby expressly incorporated by reference and which claims the benefit of U.S. Provisional Patent Application Ser. No. 60/230,937 filed Sep. 13, 2000, and titled “SIGNALING METHOD IN AN OFDM MULTIPLE ACCESS WIRELESS SYSTEM,” which is also incorporated by reference.

US Referenced Citations (822)
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 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
5384410 Kettner Jan 1995 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
5469471 Wheatley, III Nov 1995 A
5491727 Petit Feb 1996 A
5513379 Benveniste et al. Apr 1996 A
5539748 Raith Jul 1996 A
5548582 Brajal et al. Aug 1996 A
5553069 Ueno et al. Sep 1996 A
5583869 Grube et al. Dec 1996 A
5594738 Crisler et al. Jan 1997 A
5604744 Andersson et al. Feb 1997 A
5610908 Shelswell et al. Mar 1997 A
5612978 Blanchard et al. Mar 1997 A
5625876 Gilhousen et al. Apr 1997 A
5644634 Xie et al. Jul 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
5790516 Gudmundson et al. Aug 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. Jul 1999 A
5933421 Alamouti et al. Aug 1999 A
5949814 Odenwalder et al. Sep 1999 A
5953325 Willars Sep 1999 A
5955992 Shattil Sep 1999 A
5956642 Larsson et al. Sep 1999 A
5995992 Eckard Nov 1999 A
5999826 Whinnett Dec 1999 A
6002942 Park 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
6064692 Chow May 2000 A
6067315 Sandin May 2000 A
6075350 Peng Jun 2000 A
6075797 Thomas Jun 2000 A
6076114 Wesley Jun 2000 A
6088345 Sakoda et al. Jul 2000 A
6088592 Doner et al. Jul 2000 A
6108323 Gray Aug 2000 A
6108550 Wiorek et al. Aug 2000 A
6112094 Dent Aug 2000 A
6128776 Kang 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
6229795 Pankaj 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 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 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
6393295 Butler et al. May 2002 B1
6401062 Murashima Jun 2002 B1
6430163 Mustajaervi Aug 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 Apr 2003 B1
6542743 Soliman Apr 2003 B1
6546248 Jou et al. Apr 2003 B1
6563806 Yano et al. May 2003 B1
6563881 Sakoda et al. May 2003 B1
6577739 Hurtig 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
6628673 McFarland et al. Sep 2003 B1
6636568 Kadous Oct 2003 B2
6654339 Bohnke et al. Nov 2003 B1
6654431 Barton et al. Nov 2003 B1
6657949 Jones et al. Dec 2003 B1
6658258 Chen et al. Dec 2003 B1
6662024 Walton et al. Dec 2003 B2
6674787 Dick et al. Jan 2004 B1
6674810 Cheng Jan 2004 B1
6675012 Gray Jan 2004 B2
6678318 Lai Jan 2004 B1
6690951 Cuffaro et al. Feb 2004 B1
6693952 Chuah et al. Feb 2004 B1
6694147 Viswanath 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 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 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 et al. Sep 2004 B2
6802035 Catreux et al. Oct 2004 B2
6804307 Popovic Oct 2004 B1
6807146 McFarland 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
6907270 Blanz Jun 2005 B1
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
6928062 Krishnan et al. Aug 2005 B2
6934266 Dulin et al. Aug 2005 B2
6934275 Love et al. Aug 2005 B1
6934340 Dollard Aug 2005 B1
6940827 Li et al. Sep 2005 B2
6940842 Proctor, Jr. Sep 2005 B2
6940845 Benveniste Sep 2005 B2
6940917 Menon 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
7027523 Jalali et al. Apr 2006 B2
7031742 Chen et al. Apr 2006 B2
7039356 Nguyen 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
7047016 Walton 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
7092670 Tanaka 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 Sep 2006 B2
7106319 Ishiyama Sep 2006 B2
7113808 Hwang et al. Sep 2006 B2
7120134 Tiedemann et al. Oct 2006 B2
7120395 Tong et al. Oct 2006 B2
7126928 Tiedemann 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 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 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
7170876 Wei 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
7200177 Miyoshi Apr 2007 B2
7209712 Holtzman Apr 2007 B2
7212564 Parizhsky et al. May 2007 B2
7215979 Nakagawa et al. May 2007 B2
7221680 Vijayan et al. May 2007 B2
7230941 Odenwalder et al. Jun 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 Aug 2007 B2
7257167 Lau Aug 2007 B2
7257406 Ji Aug 2007 B2
7257423 Iochi Aug 2007 B2
7260153 Nissani 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 Nov 2007 B2
7302009 Walton 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
7346018 Holtzman et al. Mar 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 Jun 2008 B2
7392014 Baker et al. Jun 2008 B2
7394865 Borran et al. Jul 2008 B2
7403470 Lane 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 Aug 2008 B2
7418043 Shattil Aug 2008 B2
7418241 Bao et al. Aug 2008 B2
7418246 Kim et al. Aug 2008 B2
7420939 Laroia et al. Sep 2008 B2
7423991 Cho et al. Sep 2008 B2
7426426 Van Baren 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 Nov 2008 B1
7450532 Chae et al. Nov 2008 B2
7450548 Haustein et al. Nov 2008 B2
7453801 Taneja 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
7477618 Chen et al. Jan 2009 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 Mar 2009 B2
7508748 Kadous Mar 2009 B2
7508842 Baum et al. Mar 2009 B2
7512096 Kuzminskiy et al. Mar 2009 B2
7512412 Mese 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 Nov 2009 B2
7623442 Laroia 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
7706350 Gorokhov et al. Apr 2010 B2
7720000 Yoshida et al. May 2010 B2
7724777 Sutivong et al. May 2010 B2
7768979 Sutivong et al. Aug 2010 B2
7813322 Laroia et al. Oct 2010 B2
7852746 Jalali Dec 2010 B2
7873002 Cai Jan 2011 B2
7899497 Kish et al. Mar 2011 B2
7916624 Laroia Mar 2011 B2
7924699 Laroia Apr 2011 B2
7990843 Laroia et al. Aug 2011 B2
7990844 Laroia et al. Aug 2011 B2
8014271 Laroia Sep 2011 B2
8031583 Classon et al. Oct 2011 B2
8045512 Khandekar et al. Oct 2011 B2
8077692 Khandekar et al. Dec 2011 B2
8095141 Teague et al. Jan 2012 B2
8098568 Laroia Jan 2012 B2
8098569 Laroia Jan 2012 B2
8199634 Laroia et al. Jun 2012 B2
8208420 Liu et al. Jun 2012 B2
8218425 Laroia Jul 2012 B2
8223627 Laroia Jul 2012 B2
8295154 Laroia Oct 2012 B2
8331463 Jayaraman et al. Dec 2012 B2
8400979 Smee et al. Mar 2013 B2
8446892 Ji et al. May 2013 B2
8462859 Sampath et al. Jun 2013 B2
8477684 Khandekar et al. Jul 2013 B2
8488507 Luft et al. Jul 2013 B2
8547951 Ji et al. Oct 2013 B2
8565194 Gorokhov et al. Oct 2013 B2
8582509 Khandekar et al. Nov 2013 B2
8582548 Gore et al. Nov 2013 B2
8599945 Sampath Dec 2013 B2
8611284 Agrawal et al. Dec 2013 B2
8644292 Gorokhov et al. Feb 2014 B2
8681764 Gore et al. Mar 2014 B2
8693405 Ji et al. Apr 2014 B2
8787347 Gorokhov et al. Jul 2014 B2
8811306 Callard et al. Aug 2014 B2
8831607 Borran et al. Sep 2014 B2
8842619 Khandekar et al. Sep 2014 B2
8879511 Agrawal et al. Nov 2014 B2
8885628 Palanki et al. Nov 2014 B2
8917654 Palanki Dec 2014 B2
9130810 Laroia et al. Sep 2015 B2
9426012 Laroia et al. Aug 2016 B2
9426013 Laroia et al. Aug 2016 B2
10313069 Laroia Jun 2019 B2
20010024427 Suzuki Sep 2001 A1
20010030948 Tiedemann Oct 2001 A1
20010053140 Choi et al. Dec 2001 A1
20010055294 Motoyoshi Dec 2001 A1
20020015405 Sepponen et al. Feb 2002 A1
20020018157 Zhang et al. Feb 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 Jul 2002 A1
20020128035 Jokinen et al. Sep 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
20020193146 Wallace et al. Dec 2002 A1
20030002464 Rezaiifar et al. Jan 2003 A1
20030027579 Sydon 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
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 Apr 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
20030142648 Semper Jul 2003 A1
20030147371 Choi et al. Aug 2003 A1
20030161821 Santana Ribeiro Aug 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 et al. Oct 2003 A1
20030224798 Willenegger et al. Dec 2003 A1
20030228850 Hwang Dec 2003 A1
20030235255 Ketchum et al. Dec 2003 A1
20040002364 Trikkonen et al. Jan 2004 A1
20040015692 Green et al. Jan 2004 A1
20040017785 Zelst Jan 2004 A1
20040048609 Kosaka Mar 2004 A1
20040058687 Kim et al. Mar 2004 A1
20040066761 Giannakis et al. Apr 2004 A1
20040066772 Moon 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
20040087325 Cheng et al. May 2004 A1
20040097215 Abe et al. May 2004 A1
20040098505 Clemmensen 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
20040136344 Kim et al. Jul 2004 A1
20040136349 Walton et al. Jul 2004 A1
20040156328 Walton et al. Aug 2004 A1
20040160914 Sarkar Aug 2004 A1
20040160933 Odenwalder et al. Aug 2004 A1
20040166867 Hawe 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
20040179480 Attar et al. Sep 2004 A1
20040179494 Attar 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
20040202257 Mehta et al. Oct 2004 A1
20040208138 Hayashi et al. Oct 2004 A1
20040219819 Di Mascio Nov 2004 A1
20040219919 Whinnett et al. Nov 2004 A1
20040224711 Panchal et al. Nov 2004 A1
20040228313 Cheng et al. Nov 2004 A1
20040229615 Agrawal Nov 2004 A1
20040240419 Abrishamkar et al. Dec 2004 A1
20040240572 Brutel et al. Dec 2004 A1
20040248604 Vaidyanathan 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 et al. Feb 2005 A1
20050034079 Gunasekar et al. Feb 2005 A1
20050041611 Sandhu Feb 2005 A1
20050041618 Wei et al. Feb 2005 A1
20050041750 Lau 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 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
20050073973 Laroia et al. Apr 2005 A1
20050073976 Fujii Apr 2005 A1
20050075073 Kadous et al. Apr 2005 A1
20050084000 Krauss et al. Apr 2005 A1
20050085195 Tong et al. Apr 2005 A1
20050085197 Laroia et al. Apr 2005 A1
20050085236 Gerlach et al. Apr 2005 A1
20050088959 Kadous Apr 2005 A1
20050111397 Attar et al. May 2005 A1
20050113100 Oprescu-Surcobe et al. May 2005 A1
20050120097 Walton et al. Jun 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
20050138671 Love et al. Jun 2005 A1
20050141624 Lakshmipathi et al. Jun 2005 A1
20050147024 Jung et al. Jul 2005 A1
20050147025 Auer 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 et al. Jul 2005 A1
20050174981 Heath 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 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 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 Dec 2005 A1
20050281290 Khandekar et al. Dec 2005 A1
20050282500 Wang et al. Dec 2005 A1
20050286408 Jin et al. Dec 2005 A1
20050286465 Zhuang 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 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
20060034163 Gore et al. Feb 2006 A1
20060034164 Ozluturk 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 Feb 2006 A1
20060045003 Choi et al. Mar 2006 A1
20060046643 Izumikawa 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
20060089104 Kaikkonen 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
20060107171 Skraparlis 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
20060146764 Takemoto et al. Jul 2006 A1
20060146867 Lee et al. Jul 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
20060193294 Jorswieck 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
20060233222 Reial 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
20070011550 Agrawal et al. Jan 2007 A1
20070019596 Barriac et al. Jan 2007 A1
20070025345 Bachl et al. Feb 2007 A1
20070041311 Baum et al. Feb 2007 A1
20070041404 Palanki 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
20070081507 Koo et al. Apr 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 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
20070211668 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
20080075094 Ahn et al. Mar 2008 A1
20080095223 Tong et al. Apr 2008 A1
20080095262 Ho et al. Apr 2008 A1
20080108355 Oleszcsuk May 2008 A1
20080151829 Khandekar et al. Jun 2008 A1
20080181139 Rangarajan et al. Jul 2008 A1
20080181168 Han 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
20080285500 Zhang et al. Nov 2008 A1
20080299983 Kwak et al. Dec 2008 A1
20090003466 Taherzadehboroujeni et al. Jan 2009 A1
20090010351 Laroia et al. Jan 2009 A1
20090017753 Kim 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
20090116420 Jeong et al. May 2009 A1
20090129501 Mehta et al. May 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
20090225695 Kang et al. Sep 2009 A1
20090252078 Lim et al. Oct 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
20100002582 Luft et al. Jan 2010 A1
20100135242 Nam et al. Jun 2010 A1
20100173644 Koyanagi Jul 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
20110110310 Cai May 2011 A1
20110189946 Fukuzawa et al. Aug 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
20110269394 Mildh et al. Nov 2011 A1
20110306291 Ma et al. Dec 2011 A1
20110310814 Callard et al. Dec 2011 A1
20120002623 Khandekar et al. Jan 2012 A1
20120044814 Natarajan et al. Feb 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
20120236781 Liu et al. Sep 2012 A1
20120250603 Huang et al. Oct 2012 A1
20120307668 Wiemann et al. Dec 2012 A1
20130016678 Laroia et al. Jan 2013 A1
20130045674 Koyanagi Feb 2013 A1
20130070664 Nagata et al. Mar 2013 A1
20130150047 Zhang et al. Jun 2013 A1
20130201902 Nagata et al. Aug 2013 A1
20130208681 Gore et al. Aug 2013 A1
20130273836 Lim et al. Oct 2013 A1
20130287138 Ma et al. Oct 2013 A1
20130315200 Gorokhov et al. Nov 2013 A1
20140036763 Borran et al. Feb 2014 A1
20140247898 Laroia et al. Sep 2014 A1
20140376518 Palanki et al. Dec 2014 A1
20160344520 Laroia et al. Nov 2016 A1
Foreign Referenced Citations (734)
Number Date Country
2348137 Nov 2001 CA
2577369 Mar 2006 CA
19931400 Dec 1994 CL
8461997 Jan 1998 CL
27102004 Aug 2005 CL
22892004 Sep 2005 CL
30862004 Oct 2005 CL
15202006 Dec 2006 CL
15212006 Mar 2007 CL
14922006 Apr 2007 CL
14892006 May 2007 CL
14902006 May 2007 CL
29062006 May 2007 CL
33882005 Jun 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
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
1402916 Mar 2003 CN
1424835 Jun 2003 CN
1132474 Dec 2003 CN
1132474 Dec 2003 CN
1467938 Jan 2004 CN
1467938 Jan 2004 CN
1487755 Apr 2004 CN
1487755 Apr 2004 CN
1520220 Aug 2004 CN
1525678 Sep 2004 CN
1525678 Sep 2004 CN
1642051 Jul 2005 CN
1642051 Jul 2005 CN
1642335 Jul 2005 CN
1642335 Jul 2005 CN
1647436 Jul 2005 CN
19800653 Jul 1999 DE
19800653 Jul 1999 DE
19800953 Jul 1999 DE
19800953 Jul 1999 DE
19957288 May 2001 DE
19957288 May 2001 DE
10240138 Aug 2003 DE
10254384 Jun 2004 DE
10254384 Jun 2004 DE
0488976 Jun 1992 EP
0568291 Nov 1993 EP
0568291 Nov 1993 EP
0740431 Oct 1996 EP
0740431 Oct 1996 EP
0786889 Jul 1997 EP
0786889 Jul 1997 EP
0805576 Nov 1997 EP
0805576 Nov 1997 EP
0807989 Nov 1997 EP
0807989 Nov 1997 EP
0844796 May 1998 EP
0844796 May 1998 EP
0872068 Oct 1998 EP
0872068 Oct 1998 EP
A2 Oct 1998 EP
0971515 Jan 2000 EP
0971515 Jan 2000 EP
0981222 Feb 2000 EP
0981222 Feb 2000 EP
1001570 May 2000 EP
1028563 Aug 2000 EP
1030489 Aug 2000 EP
1047209 Oct 2000 EP
1061687 Dec 2000 EP
1091516 Apr 2001 EP
1093241 Apr 2001 EP
1172983 Jan 2002 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
0971515 Sep 2004 EP
0971515 Sep 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
1542488 Jun 2005 EP
1601149 Nov 2005 EP
1643669 Apr 2006 EP
1898542 Mar 2008 EP
2584884 Jan 1987 FR
2279540 Jan 1995 GB
2348776 Oct 2000 GB
2412541 Sep 2005 GB
H04111544 Apr 1992 JP
H04111544 Apr 1992 JP
4301931 Oct 1992 JP
4301931 Oct 1992 JP
H0746248 Feb 1995 JP
H0746248 Feb 1995 JP
7336323 Dec 1995 JP
7336323 Dec 1995 JP
8116329 May 1996 JP
8116329 May 1996 JP
08288927 Nov 1996 JP
9008725 Jan 1997 JP
9008725 Jan 1997 JP
9131342 May 1997 JP
9182148 Jul 1997 JP
9182148 Jul 1997 JP
09214404 Aug 1997 JP
9284200 Oct 1997 JP
9284200 Oct 1997 JP
10117162 May 1998 JP
H10210000 Aug 1998 JP
H10210000 Aug 1998 JP
10322304 Dec 1998 JP
H11168453 Jun 1999 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
2000022618 Jan 2000 JP
2000102065 Apr 2000 JP
2000184425 Jun 2000 JP
2000511750 Sep 2000 JP
2000511750 Sep 2000 JP
2000332724 Nov 2000 JP
2001016644 Jan 2001 JP
2001016644 Jan 2001 JP
2001045573 Feb 2001 JP
2001045573 Feb 2001 JP
2001057545 Feb 2001 JP
2001057545 Feb 2001 JP
2001156732 Jun 2001 JP
2001156732 Jun 2001 JP
2001238269 Aug 2001 JP
2001238269 Aug 2001 JP
2001245355 Sep 2001 JP
2001245355 Sep 2001 JP
2001249802 Sep 2001 JP
2001285927 Oct 2001 JP
2001285927 Oct 2001 JP
2001521698 Nov 2001 JP
2001521698 Nov 2001 JP
2001526012 Dec 2001 JP
2002026790 Jan 2002 JP
2002111556 Apr 2002 JP
2002111556 Apr 2002 JP
2002290148 Oct 2002 JP
2002290148 Oct 2002 JP
2002534925 Oct 2002 JP
2002534925 Oct 2002 JP
2002538696 Nov 2002 JP
2002538696 Nov 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
2003169367 Jun 2003 JP
2003174426 Jun 2003 JP
2003199173 Jul 2003 JP
2003199173 Jul 2003 JP
2003235072 Aug 2003 JP
2003235072 Aug 2003 JP
2003249907 Sep 2003 JP
2003249907 Sep 2003 JP
2003292667 Oct 2003 JP
2003292667 Oct 2003 JP
2003318857 Nov 2003 JP
2003318857 Nov 2003 JP
2003347985 Dec 2003 JP
2003348047 Dec 2003 JP
2003536308 Dec 2003 JP
2003536308 Dec 2003 JP
2004007643 Jan 2004 JP
2004007643 Jan 2004 JP
2004023716 Jan 2004 JP
2004048716 Feb 2004 JP
2004048716 Feb 2004 JP
200472457 Mar 2004 JP
2004072157 Mar 2004 JP
2004072157 Mar 2004 JP
2004096142 Mar 2004 JP
2004507151 Mar 2004 JP
2004507151 Mar 2004 JP
2004507950 Mar 2004 JP
2004507950 Mar 2004 JP
2004153676 May 2004 JP
2004158901 Jun 2004 JP
2004158901 Jun 2004 JP
2004162388 Jun 2004 JP
2004162388 Jun 2004 JP
2004194262 Jul 2004 JP
2004194262 Jul 2004 JP
2004201296 Jul 2004 JP
2004201296 Jul 2004 JP
2004215022 Jul 2004 JP
2004215022 Jul 2004 JP
2004221972 Aug 2004 JP
2004266818 Sep 2004 JP
2004529524 Sep 2004 JP
2004529524 Sep 2004 JP
2004297276 Oct 2004 JP
2004297276 Oct 2004 JP
2004297370 Oct 2004 JP
2004297370 Oct 2004 JP
2004297756 Oct 2004 JP
2004297756 Oct 2004 JP
2005006337 Jan 2005 JP
2005006337 Jan 2005 JP
2005020530 Jan 2005 JP
2005502218 Jan 2005 JP
2005502218 Jan 2005 JP
2005506757 Mar 2005 JP
2005506757 Mar 2005 JP
2005110130 Apr 2005 JP
2005110130 Apr 2005 JP
2005130491 May 2005 JP
2005130491 May 2005 JP
2005167502 Jun 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
2005236678 Sep 2005 JP
2006505172 Feb 2006 JP
2006506860 Feb 2006 JP
2006506860 Feb 2006 JP
2006211537 Aug 2006 JP
2006211537 Aug 2006 JP
2006524930 Nov 2006 JP
2006524930 Nov 2006 JP
2007519281 Jul 2007 JP
2007520309 Jul 2007 JP
2007520309 Jul 2007 JP
2007527127 Sep 2007 JP
2008505587 Feb 2008 JP
2008505587 Feb 2008 JP
2008535398 Aug 2008 JP
4188372 Nov 2008 JP
4188372 Nov 2008 JP
0150275 Jun 1998 KR
0150275 Jun 1998 KR
20000060428 Oct 2000 KR
100291476 Mar 2001 KR
100291476 Mar 2001 KR
20010056333 Apr 2001 KR
20010087715 Sep 2001 KR
20010087715 Sep 2001 KR
20030007965 Jan 2003 KR
20030035969 May 2003 KR
20030035969 May 2003 KR
20040063057 Jul 2004 KR
200471652 Aug 2004 KR
20040103441 Dec 2004 KR
20040103441 Dec 2004 KR
20050063826 Jun 2005 KR
20050063826 Jun 2005 KR
100606099 Jul 2006 KR
95121152 Dec 1997 RU
2141168 Nov 1999 RU
2141168 Nov 1999 RU
2141706 Nov 1999 RU
2141706 Nov 1999 RU
2159007 Nov 2000 RU
2159007 Nov 2000 RU
2162275 Jan 2001 RU
2162275 Jan 2001 RU
2183387 Jun 2002 RU
2183387 Jun 2002 RU
2192094 Oct 2002 RU
2197778 Jan 2003 RU
2197778 Jan 2003 RU
2201033 Mar 2003 RU
2201033 Mar 2003 RU
2207723 Jun 2003 RU
2207723 Jun 2003 RU
2208913 Jul 2003 RU
2210866 Aug 2003 RU
2210866 Aug 2003 RU
2216101 Nov 2003 RU
2216101 Nov 2003 RU
2216103 Nov 2003 RU
2216103 Nov 2003 RU
2216105 Nov 2003 RU
2216105 Nov 2003 RU
2225080 Feb 2004 RU
2225080 Feb 2004 RU
2235429 Aug 2004 RU
2235432 Aug 2004 RU
2235432 Aug 2004 RU
2237379 Sep 2004 RU
2237379 Sep 2004 RU
2238611 Oct 2004 RU
2238611 Oct 2004 RU
2242091 Dec 2004 RU
2242091 Dec 2004 RU
2250564 Apr 2005 RU
2267224 Dec 2005 RU
2285351 Oct 2006 RU
2285351 Oct 2006 RU
2335864 Oct 2008 RU
2335864 Oct 2008 RU
2349043 Mar 2009 RU
2349043 Mar 2009 RU
1320883 Jun 1987 SU
510132 Nov 2002 TW
200401572 Jan 2004 TW
I232040 May 2005 TW
248266 Jan 2006 TW
200718128 May 2007 TW
9408432 Apr 1994 WO
WO-9408432 Apr 1994 WO
1995001032 Jan 1995 WO
WO-1995001032 Jan 1995 WO
1995021494 Aug 1995 WO
WO-1995021494 Aug 1995 WO
9613920 May 1996 WO
WO-9613920 May 1996 WO
9701256 Jan 1997 WO
WO-9701256 Jan 1997 WO
9737456 Oct 1997 WO
WO-9737456 Oct 1997 WO
1997044983 Nov 1997 WO
WO-1997044983 Nov 1997 WO
9746033 Dec 1997 WO
WO-9746033 Dec 1997 WO
9800946 Jan 1998 WO
WO-9800946 Jan 1998 WO
1998014026 Apr 1998 WO
WO-1998014026 Apr 1998 WO
WO-9837706 Aug 1998 WO
9848581 Oct 1998 WO
1998044639 Oct 1998 WO
WO-9848581 Oct 1998 WO
WO-1998044639 Oct 1998 WO
9853561 Nov 1998 WO
WO-9853561 Nov 1998 WO
1998054919 Dec 1998 WO
WO-1998054919 Dec 1998 WO
9941871 Aug 1999 WO
WO-9941871 Aug 1999 WO
9944383 Sep 1999 WO
99044313 Sep 1999 WO
WO-9944383 Sep 1999 WO
WO-99044313 Sep 1999 WO
9952250 Oct 1999 WO
9953667 Oct 1999 WO
9953713 Oct 1999 WO
WO-9952250 Oct 1999 WO
WO-9953667 Oct 1999 WO
WO-9953713 Oct 1999 WO
9837706 Nov 1999 WO
9960729 Nov 1999 WO
99059265 Nov 1999 WO
WO-9960729 Nov 1999 WO
WO-99059265 Nov 1999 WO
9965155 Dec 1999 WO
WO-9965155 Dec 1999 WO
0002397 Jan 2000 WO
0004728 Jan 2000 WO
WO-0002397 Jan 2000 WO
WO-0004728 Jan 2000 WO
0033503 Jun 2000 WO
WO-0033503 Jun 2000 WO
2000041542 Jul 2000 WO
WO-2000041542 Jul 2000 WO
0051389 Aug 2000 WO
WO-0051389 Aug 2000 WO
0070897 Nov 2000 WO
WO-0070897 Nov 2000 WO
2001001596 Jan 2001 WO
WO-2001001596 Jan 2001 WO
2001017125 Mar 2001 WO
WO-2001017125 Mar 2001 WO
0126269 Apr 2001 WO
WO-0126269 Apr 2001 WO
0139523 May 2001 WO
WO-0139523 May 2001 WO
01045300 Jun 2001 WO
WO-01045300 Jun 2001 WO
0148969 Jul 2001 WO
2001052588 Jul 2001 WO
WO-0148969 Jul 2001 WO
WO-2001052588 Jul 2001 WO
0158054 Aug 2001 WO
2001060106 Aug 2001 WO
WO-0158054 Aug 2001 WO
WO-2001060106 Aug 2001 WO
0165637 Sep 2001 WO
0169814 Sep 2001 WO
WO-0165637 Sep 2001 WO
WO-0169814 Sep 2001 WO
0182543 Nov 2001 WO
0189112 Nov 2001 WO
01825544 Nov 2001 WO
WO-0182543 Nov 2001 WO
WO-0182544 Nov 2001 WO
WO-0189112 Nov 2001 WO
0195427 Dec 2001 WO
200193505 Dec 2001 WO
WO-0195427 Dec 2001 WO
WO-200193505 Dec 2001 WO
0204936 Jan 2002 WO
2002007375 Jan 2002 WO
WO-0204936 Jan 2002 WO
WO-2002007375 Jan 2002 WO
0215432 Feb 2002 WO
2002015616 Feb 2002 WO
WO-0215432 Feb 2002 WO
WO-2002015616 Feb 2002 WO
0219746 Mar 2002 WO
2002023743 Mar 2002 WO
WO-0219746 Mar 2002 WO
WO-2002023743 Mar 2002 WO
0231991 Apr 2002 WO
0233848 Apr 2002 WO
WO-0231991 Apr 2002 WO
WO-0233848 Apr 2002 WO
0245293 Jun 2002 WO
0245456 Jun 2002 WO
0249305 Jun 2002 WO
0249306 Jun 2002 WO
0249385 Jun 2002 WO
WO-0245293 Jun 2002 WO
WO-0245456 Jun 2002 WO
WO-0249305 Jun 2002 WO
WO-0249306 Jun 2002 WO
WO-0249385 Jun 2002 WO
2002060138 Aug 2002 WO
2002065675 Aug 2002 WO
2002067461 Aug 2002 WO
WO-2002060138 Aug 2002 WO
WO-2002065675 Aug 2002 WO
WO-2002067461 Aug 2002 WO
02082689 Oct 2002 WO
02082743 Oct 2002 WO
WO-02082689 Oct 2002 WO
WO-02082743 Oct 2002 WO
2002089434 Nov 2002 WO
2002091597 Nov 2002 WO
2002093782 Nov 2002 WO
2002093819 Nov 2002 WO
WO-2002089434 Nov 2002 WO
WO-2002091597 Nov 2002 WO
WO-2002093782 Nov 2002 WO
WO-2002093819 Nov 2002 WO
02100027 Dec 2002 WO
2002099995 Dec 2002 WO
WO-02100027 Dec 2002 WO
WO-2002099995 Dec 2002 WO
03001696 Jan 2003 WO
03001981 Jan 2003 WO
03003617 Jan 2003 WO
2003001761 Jan 2003 WO
WO-03001696 Jan 2003 WO
WO-03001981 Jan 2003 WO
WO-03003617 Jan 2003 WO
WO-2003001761 Jan 2003 WO
03019819 Mar 2003 WO
WO-03019819 Mar 2003 WO
03030414 Apr 2003 WO
03034644 Apr 2003 WO
WO-03030414 Apr 2003 WO
WO-03034644 Apr 2003 WO
03041300 May 2003 WO
03043262 May 2003 WO
2003043369 May 2003 WO
WO-03041300 May 2003 WO
WO-03043262 May 2003 WO
WO-2003043369 May 2003 WO
03049409 Jun 2003 WO
WO-03049409 Jun 2003 WO
03058871 Jul 2003 WO
WO-03058871 Jul 2003 WO
03067783 Aug 2003 WO
03069816 Aug 2003 WO
03069832 Aug 2003 WO
WO-03067783 Aug 2003 WO
WO-03069816 Aug 2003 WO
WO-03069832 Aug 2003 WO
03073646 Sep 2003 WO
03075479 Sep 2003 WO
WO-03073646 Sep 2003 WO
WO-03075479 Sep 2003 WO
03085876 Oct 2003 WO
03088538 Oct 2003 WO
WO-03085876 Oct 2003 WO
WO-03088538 Oct 2003 WO
03094384 Nov 2003 WO
WO-03094384 Nov 2003 WO
03103331 Dec 2003 WO
04002047 Dec 2003 WO
2004002011 Dec 2003 WO
WO-03103331 Dec 2003 WO
WO-04002047 Dec 2003 WO
WO-2004002011 Dec 2003 WO
04004370 Jan 2004 WO
2004008671 Jan 2004 WO
2004008681 Jan 2004 WO
WO-04004370 Jan 2004 WO
WO-2004008671 Jan 2004 WO
WO-2004008681 Jan 2004 WO
04016007 Feb 2004 WO
2004015912 Feb 2004 WO
WO-04016007 Feb 2004 WO
WO-2004015912 Feb 2004 WO
2004021605 Mar 2004 WO
2004023834 Mar 2004 WO
WO-2004021605 Mar 2004 WO
WO-2004023834 Mar 2004 WO
2004028037 Apr 2004 WO
2004030238 Apr 2004 WO
2004032443 Apr 2004 WO
WO-2004028037 Apr 2004 WO
WO-2004030238 Apr 2004 WO
WO-2004032443 Apr 2004 WO
04038954 May 2004 WO
04040825 May 2004 WO
2004038972 May 2004 WO
2004038984 May 2004 WO
2004038988 May 2004 WO
2004040690 May 2004 WO
2004040827 May 2004 WO
WO-04038954 May 2004 WO
WO-04040825 May 2004 WO
WO-2004038972 May 2004 WO
WO-2004038984 May 2004 WO
WO-2004038988 May 2004 WO
WO-2004040690 May 2004 WO
WO-2004040827 May 2004 WO
2004047354 Jun 2004 WO
2004049618 Jun 2004 WO
2004051872 Jun 2004 WO
WO-2004047354 Jun 2004 WO
WO-2004049618 Jun 2004 WO
WO-2004051872 Jun 2004 WO
04064294 Jul 2004 WO
2004056022 Jul 2004 WO
2004062255 Jul 2004 WO
2004064295 Jul 2004 WO
WO-04064294 Jul 2004 WO
WO-2004056022 Jul 2004 WO
WO-2004062255 Jul 2004 WO
WO-2004064295 Jul 2004 WO
04066520 Aug 2004 WO
04073276 Aug 2004 WO
2004068721 Aug 2004 WO
WO-04066520 Aug 2004 WO
WO-04073276 Aug 2004 WO
WO-2004068721 Aug 2004 WO
04075448 Sep 2004 WO
04084509 Sep 2004 WO
2004075023 Sep 2004 WO
2004075442 Sep 2004 WO
2004075468 Sep 2004 WO
2004075596 Sep 2004 WO
2004077850 Sep 2004 WO
WO-04075448 Sep 2004 WO
WO-04084509 Sep 2004 WO
WO-2004075023 Sep 2004 WO
WO-2004075442 Sep 2004 WO
WO-2004075468 Sep 2004 WO
WO-2004075596 Sep 2004 WO
WO-2004077850 Sep 2004 WO
2004086706 Oct 2004 WO
2004086711 Oct 2004 WO
WO-2004086706 Oct 2004 WO
WO-2004086711 Oct 2004 WO
2004095730 Nov 2004 WO
2004095851 Nov 2004 WO
2004095854 Nov 2004 WO
2004098072 Nov 2004 WO
2004098222 Nov 2004 WO
2004102815 Nov 2004 WO
2004102816 Nov 2004 WO
WO-2004095730 Nov 2004 WO
WO-2004095851 Nov 2004 WO
WO-2004095854 Nov 2004 WO
WO-2004098072 Nov 2004 WO
WO-2004098222 Nov 2004 WO
WO-2004102815 Nov 2004 WO
WO-2004102816 Nov 2004 WO
2004105272 Dec 2004 WO
2004114549 Dec 2004 WO
2004114564 Dec 2004 WO
2004114615 Dec 2004 WO
WO-2004105272 Dec 2004 WO
WO-2004114549 Dec 2004 WO
WO-2004114564 Dec 2004 WO
WO-2004114615 Dec 2004 WO
2005002253 Jan 2005 WO
WO-2005002253 Jan 2005 WO
05015797 Feb 2005 WO
05018270 Feb 2005 WO
2005011163 Feb 2005 WO
2005015795 Feb 2005 WO
2005015810 Feb 2005 WO
2005015941 Feb 2005 WO
WO-05015797 Feb 2005 WO
WO-05018270 Feb 2005 WO
WO-2005011163 Feb 2005 WO
WO-2005015795 Feb 2005 WO
WO-2005015810 Feb 2005 WO
WO-2005015941 Feb 2005 WO
2005020488 Mar 2005 WO
2005020490 Mar 2005 WO
2005022811 Mar 2005 WO
2005025110 Mar 2005 WO
WO-2005020488 Mar 2005 WO
WO-2005020490 Mar 2005 WO
WO-2005022811 Mar 2005 WO
WO-2005025110 Mar 2005 WO
2005032004 Apr 2005 WO
WO-2005032004 Apr 2005 WO
05043855 May 2005 WO
2005043780 May 2005 WO
2005046080 May 2005 WO
WO-05043855 May 2005 WO
WO-2005043780 May 2005 WO
WO-2005046080 May 2005 WO
05060192 Jun 2005 WO
2005055465 Jun 2005 WO
2005055484 Jun 2005 WO
2005055527 Jun 2005 WO
WO-05060192 Jun 2005 WO
WO-2005055465 Jun 2005 WO
WO-2005055484 Jun 2005 WO
WO-2005055527 Jun 2005 WO
2005065062 Jul 2005 WO
2005069538 Jul 2005 WO
WO-2005065062 Jul 2005 WO
WO-2005069538 Jul 2005 WO
2005074184 Aug 2005 WO
WO-2005074184 Aug 2005 WO
2005086440 Sep 2005 WO
WO-2005086440 Sep 2005 WO
05096538 Oct 2005 WO
WO-05096538 Oct 2005 WO
2005122628 Dec 2005 WO
WO-2005122628 Dec 2005 WO
2006007292 Jan 2006 WO
WO-2006007292 Jan 2006 WO
2006019710 Feb 2006 WO
WO-2006019710 Feb 2006 WO
06026344 Mar 2006 WO
WO-06026344 Mar 2006 WO
06044487 Apr 2006 WO
WO-06044487 Apr 2006 WO
06055718 May 2006 WO
WO-06055718 May 2006 WO
06069300 Jun 2006 WO
06069397 Jun 2006 WO
2006062356 Jun 2006 WO
2006069301 Jun 2006 WO
WO-06069300 Jun 2006 WO
WO-06069397 Jun 2006 WO
WO-2006062356 Jun 2006 WO
WO-2006069301 Jun 2006 WO
2006077696 Jul 2006 WO
WO-2006077696 Jul 2006 WO
2006096784 Sep 2006 WO
2006099349 Sep 2006 WO
2006099545 Sep 2006 WO
2006099577 Sep 2006 WO
WO-2006096784 Sep 2006 WO
WO-2006099349 Sep 2006 WO
WO-2006099545 Sep 2006 WO
WO-2006099577 Sep 2006 WO
2006127544 Nov 2006 WO
WO-2006127544 Nov 2006 WO
06138196 Dec 2006 WO
2006130541 Dec 2006 WO
2006134032 Dec 2006 WO
2006138555 Dec 2006 WO
2006138573 Dec 2006 WO
2006138581 Dec 2006 WO
WO-06138196 Dec 2006 WO
WO-2006130541 Dec 2006 WO
WO-2006134032 Dec 2006 WO
WO-2006138555 Dec 2006 WO
WO-2006138573 Dec 2006 WO
WO-2006138581 Dec 2006 WO
2007022430 Feb 2007 WO
WO-2007022430 Feb 2007 WO
07024934 Mar 2007 WO
07025160 Mar 2007 WO
2007024935 Mar 2007 WO
WO-07024934 Mar 2007 WO
WO-07025160 Mar 2007 WO
WO-2007024935 Mar 2007 WO
07051159 May 2007 WO
07051181 May 2007 WO
07051186 May 2007 WO
07051192 May 2007 WO
2007051125 May 2007 WO
2007051154 May 2007 WO
2007051184 May 2007 WO
2007051190 May 2007 WO
2007051194 May 2007 WO
WO-07051159 May 2007 WO
WO-07051181 May 2007 WO
WO-07051186 May 2007 WO
WO-07051192 May 2007 WO
WO-2007051125 May 2007 WO
WO-2007051154 May 2007 WO
WO-2007051184 May 2007 WO
WO-2007051190 May 2007 WO
WO-2007051194 May 2007 WO
Non-Patent Literature Citations (285)
Entry
International Search Report—PCT/US01/028315, International Search Authority—European Patent Office, dated Jun. 21, 2002.
International Search Report—PCT/US06/008455, International Search Authority—European Patent Office, dated Jul. 5, 2006.
International Search Report—PCT/US06/014878, International Search Authority—European Patent Office, dated Aug. 25, 2006.
International Search Report—PCT/US06/021207 International Search Authority—European Patent Office, dated Sep. 21, 2006.
International Search Report—PCT/US06/021379—International Search Authority, European Patent Office—dated Oct. 16, 2006.
International Search Report—PCT/US06/023095—International Search Authority, European Patent Office—dated Oct. 10, 2006.
International Search Report—PCT/US06/023514, International Search Authority—ISA/US, dated Oct. 5, 2007.
International Search Report—PCT/US06/032860, International Search Authority—European Patent Office, dated Dec. 29, 2006.
International Search Report—PCT/US06/032900, International Search Authority—European Patent Office, dated May 3, 2007.
International Search Report—PCT/US06/060291, International Search Authority—European Patent Office—dated May 3, 2007.
International Search Report—PCT/US06/060327—International Search Authority, European Patent Office, dated Mar. 1, 2007.
International Search Report—PCT/US06/060333, International Search Authority—European Patent Office, dated Apr. 4, 2007.
International Search Report and Written Opinion—PCT/US06/003947, International Search Authority—European Patent Office, dated Jun. 12, 2006.
International Search Report and Written Opinion—PCT/US06/008986, International Search Authority—European Patent Office, dated Sep. 1, 2006.
International Search Report and Written Opinion—PCT/US06/008987, International Search Authority—European Patent Office, Sep. 1, 2006.
International Search Report and Written Opinion—PCT/US06/009707, International Search Authority—European Patent Office, dated Aug. 16, 2006.
International Search Report and Written Opinion—PCT/US06/009708, International Search Authority—European Patent Office, dated Sep. 19, 2006.
International Search Report and Written Opinion—PCT/US06/009757, International Search Authority—European Patent Office, dated Jul. 26, 2006.
International Search Report and Written Opinion—PCT/US06/012229, International Search Authority—European Patent Office, dated Jul. 18, 2006.
International Search Report and Written Opinion—PCT/US06/014879, International Search Authority—European Patent Office, dated Jan. 15, 2007.
International Search Report and Written Opinion—PCT/US06/021211, International Search Authority—European Patent Office, dated Sep. 25, 2006.
International Search Report and Written Opinion—PCT/US06/023514, International Search Authority—European Patent Office, dated Oct. 5, 2007.
International Search Report and Written Opinion—PCT/US06/031147, International Search Authority—European Patent Office, dated Feb. 2, 2007.
International Search Report and Written Opinion—PCT/US06/032901, International Search Authority—European Patent Office, dated Mar. 23, 2007.
International Search Report and Written Opinion—PCT/US06/033269, International Search Authority—European Patent Office, dated Feb. 22, 2007.
International Search Report and Written Opinion—PCT/US06/033801, International Search Authority—European Patent Office, dated Feb. 21, 2007.
International Search Report and Written Opinion—PCT/US06/033937, International Search Authority—European Patent Office, dated Apr. 12, 2007.
International Search Report and Written Opinion—PCT/US06/060286, International Search Authority—European Patent Office, dated May 2, 2007.
International Search Report and Written Opinion—PCT/US06/060292, International Search Authority—European Patent Office, dated Apr. 20, 2007.
International Search Report and Written Opinion—PCT/US06/060328, International Search Authority—European Patent Office, dated Mar. 30, 2007.
International Search Report and Written Opinion—PCT/US06/060332, International Search Authority—European Patent Office, dated Apr. 19, 2007.
International Search Report and Written Opinion—PCT/US06/060336, International Search Authority—European Patent Office, dated Mar. 2, 2007.
International Search Report and Written Opinion—PCT/US06/060340, International Search Authority—European Patent Office, dated Jun. 28, 2007.
International Search Report and Written Opinion—PCT/US06/060341, International Search Authority—European Patent Office, dated May 8, 2007.
International Search Report and Written Opinion—PCT/US06/061061, International Search Authority—European Patent Office, dated Feb. 20, 2008.
International Search Report and Written Opinion—PCT/US07/060195, International Search Authority—European Patent Office, dated Dec. 6, 2007.
International Search Report and Written Opinion—PCT/US07/086197, International Search Authority—European Patent Office, dated Jul. 21, 2008.
International Search Report and Written Opinion—PCT/US09/064871, International Searching Authority—European Patent Office, dated Feb. 17, 2010.
International Search Report and Written Opinion—PCT/US2010/027237—ISA/EPO—dated Jun. 11, 2010.
International Search Report, PCT/US05/024614, International Search Authority, European Patent Office—dated Oct. 20, 2005.
International Search Report—PCT/US2006/010962, International Search Authority—European Patent Office—dated Aug. 4, 2006.
International Search Report—PCT/US2006/060287, International Search Authority—European Patent Office—dated May 9, 2007.
“Introduction to cdma2000 Standards for Spread Spectrum Systems”,TIA/EIA/IS-2000 Standards for CDMA2000 Spread Spectrum Systems 3GPP2 C.S0001-0 Version 1.0, July 1999, 16 pages.
John B. Groe, Lawrence E. Larson, “CDMA Mobile Radio Design” Sep. 26, 2001 (Sep. 26, 2001), Artech House, Norwood, MA02062 580530, XP002397967, pp. 157-159.
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 Joumal on Selected Areas in Communications, vol. 13, No. 1, Jan. 1995, pp. 110-121.
Kappes, J.M., and Sayegh, S.I., “Programmable Demultiplexer/Demodulator Processor,” COMSAT Laboratories, IEEE, Mar. 11, 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.
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.
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.
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.
3GPP TS 36.211 V8.0.0; 3rd Generation Partnership Project;Technical Specification Group Radio Access Network; Evolved Universal Terrestrial Radio Access (E-UTRA); Physical channels and modulation (Release 8), [Online] 2007, pp. 1-50, XP002520076 Retrieved from the Internet: URL:http://wwwSgpporg/ftp/Specs/html-i nf o/36211htm> [retrieved on Sep. 27, 2007] Section 5.
3GPP TSG RAN WG1: “NTT DoCoMo, Physical Channels and Multiplexing in Evolved UTRA Downlink,” TSG-RAN Working Group 1 Meeting, XX, XX, No. R1-050590, Jun. 20-21, 2005, pp. 1-24, XP003006923.
3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Physical Layer Aspects for Evolved UTRA (Release 7), 3GPP TR 25814 v031 (Nov. 2005), pp. 1-57.
A. Gorokhov. “CDM/TDM control channel,” Aug. 2004.
A. Khandekar. “Packet Format Concept Review,” Sep. 2004.
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, Apr. 3, 2007 (Apr. 3, 2007), XP050105640 [retrieved on Apr. 3, 2007].
Bahai, Saltzberg: “System Architecture,” Multi-Carrier Digital Communications, Kluwer Academic, New York, NY, XP-002199501, 1999, pp. 17-21.
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.
Bhushan N., “UHDR Overview”, C30-20060522-037, Denver, CO, May 22, 2006, pp. 1-115.
Bingham: “Other Types of MCM,” ADSL, VDSL, and Multicarrier Modulation, John Wiley & Sons, New York, XP-002199502. 2000, pp. 111-113.
Blum, R. et al., “On Optimum MIMO with Antenna Selection,” IEEE International Conference on Communications: Conference Proceedings, vol. 1, Apr. 28, 2002, pp. 386-390.
Bonaccorso M., et al., “Reducing the Peak to Average Power Ratio in OFDM Systems”, Seventeenth Colloquium GRETSI, Vannes, Sep. 13-17, 1999, pp. 781-784.
Boutros et al, (US20050008091), Jan. 13, 2005; Sphere Decoding of Symbols Transmitted in a Telecommunication System.
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=891 3063&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. 1, 1996, pp. 531-542, XP000612951.
Chiani, et al., “Outage Evaluation for Slow Frequency-Hopping Mobile Radio Systems” IEEE Transactions on Communications, vol. 47, No. Dec. 12, 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.
D. Gore. “MIMO Channel Estimation Concept Review,” Sep. 2004.
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.
Das, Arnab, et al. “Adaptive, asynchronous incremental redundancy (A-IR) with fixed transmission time intervals TTI for HSDPA.” IEEE, Personal, Indoor and Mobile Radio Communications, 2002. The 13th IEEE International Symposium on, pp. 1083-1087.
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).
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 (Oct. 1, 2000), pp. 1-243, XP050358534.
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.
Dinis, R. et al.: “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, p. 3808-3812, XP010758449 Piscataway , NJ, USA, IEEE.
Don Torrieri, “Cellular Frequency-Hopping CDMA Systems,” IEEE Vehicular Technology Conference, May 16, 1999 (May 16, 1999), pp. 919-925, vol. 2.
El Gamal, H. et al., “Universal Space-Time Coding,” IEEE Transactions on Information Theory, vol. 49, Issue 5, pp. 1097-1119, XP011074756, ISSN: 0018-9448, May 2003.
European Search Report—EP13178709—Search Authority—Munich—dated Oct. 22, 2013.
European Search Report—EP07025189, Search Authority—Munich Patent Office, dated Mar. 6, 2008.
European Search Report—EP08012608 Search Authority—Munich Patent Office, dated Sep. 3, 2008.
European Search Report—EP08018386—Search Authority—The Hague—dated Jul. 18, 2014.
European Search Report—EP09169034—European Search Authority Berlindated Oct. 20, 2009.
European Search Report—EP10008766, Search Authority—Berlin Patent Office, Oct. 28, 2010.
European Search Report—EP10008767, Search Authority—Berlin Patent Office, dated Sep. 24, 2010.
European Search Report—EP10010615—Search Authority—Munich—dated Feb. 2, 2011.
European Search Report—EP10010903, Search Authority—Berlin Patent Office, dated Oct. 26, 2010.
European Search Report—EP10011743, Search Authority—Munich Patent Office, dated Dec. 20, 2010.
European Search Report—EP10012081, Search Authority—Munich Patent Office, dated Dec. 17, 2010.
European Search Report—EP10012082, Search Authority—Munich Patent Office, dated Dec. 20, 2010.
European Search Report—EP10012083, Search Authority—Munich Patent Office, dated Dec. 30, 2010.
European Search Report—EP10164128—Search Authority—Munich—dated Jun. 22, 2010.
European Search Report—EP10176007—Search Authority—The Hague—dated Jul. 18, 2014.
European Search Report—EP10184156—Search Authority—Munich—dated Jun. 14, 2012.
European Search Report—EP11007140—Search Authority—Munich—dated Oct. 28, 2011.
European Search Report—EP11007141—Search Authority—Munich—dated Oct. 31, 2011.
European Search Report—EP11158564—Search Authority—Munich—dated May 25, 2011.
European Search Report—EP18188777—Search Authority—Munich—dated Mar. 27, 2019.
European Search Report—EP14178034—Search Authority—Munich—dated Jun. 5, 2015.
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.
Frescura et al., “DSP Based OFDM Demodulator and Equalizer for Professional DVB-T Receivers,” IEEE Transactions on Broadcasting, Sep. 1999, pp. 323-332, vol. 45, No. 3, IEEE Service Center, Piscataway, NJ, USA, XP011083078, Issn: 0018-9316.
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, Philadelphia, pp. 1121-1124, Mar. 18-23, 2005.
Gallager, Robert “Information Theory and Reliable Communication” John Wiley and Sons, Inc. (1968).
Groe, J., et al., “CDMA Mobile Radio Design,” Sep. 26, 2001, Artech House, Inc. Norwood, MA, pp. 257-259.
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.
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 B., 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, Mar. 1, 2003.
Hochwald et al., (US 2003/0076890); Apr. 24, 2003; Method and Apparatus for Detection and Decoding of Signals Received From a Linear Propagation Channel.
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.
Institute for Infocomm Research et al., “Intra-Node B Macro Diversity based on Cyclic Delay Transmissions”, 3GPP TSG RAN WG1 #42 on LTE, R1-050795, Aug. 29-Sep. 2, 2005, pp. 1-5.
International Preliminary Exam Report—PCT/US01/028315, International Preliminary Examining Authority—US, dated Apr. 11, 2003.
International Preliminary Examination Report PCT/US01/028314, IPEA/US dated Apr. 23, 2003.
International Preliminary Report on Patentability—PCT/US06/008455, The International Bureau of WIPO, Geneva, Switzerland—dated Sep. 12, 2007.
International Preliminary Report on Patentability—PCT/US06/009707—The International Bureau of WIPO—Geneva, Switzerland—dated Sep. 18, 2007.
International Preliminary Report on Patentability—PCT/US06/009708—The International Bureau of WIPO—Geneva, Switzerland—dated Sep. 18, 2007.
International Preliminary Report on Patentability—PCT/US06/009757, The International Bureau of WIPO—Geneva, Switzerland, dated Sep. 18, 2007.
International Preliminary Report on Patentability—PCT/US06/012229—International Bureau of WIPO—Geneva, Switzerland, dated Oct. 3, 2007.
International Preliminary Report on Patentability—PCT/US06/014878, The International Bureau of WIPO—Geneva, Switzerland, dated Oct. 23, 2007.
International Preliminary Report on Patentability—PCT/US06/014879, The International Bureau of WIPO—Geneva, Switzerland, dated Oct. 23, 2007.
International Preliminary Report on Patentability—PCT/US06/021207—The International Bureau of WIPO, Geneva, Switzerland, dated Dec. 6, 2007.
International Preliminary Report on Patentability—PCT/US06/021211, International Bureau of WIPO—Geneva, Switzerland , dated Dec. 6, 2007.
International Preliminary Report on Patentability—PCT/US06/021379—The International Bureau of WIPO, Geneva, Switzerland—dated Dec. 6, 2007.
International Preliminary Report on Patentability—PCT/US06/023095—The International Bureau of WIPO, Geneva, Switzerland—dated Dec. 17, 2007.
International Preliminary Report on Patentability—PCT/US06/023514, International Bureau of WIPO, dated Dec. 17, 2007.
International Preliminary Report on Patentability—PCT/US06/032900—The International Bureau of WIPO, Geneva, Switzerland—dated Feb. 6, 2008.
International Preliminary Report on Patentability—PCT/US06/032901, The Internation Bureau of WIPO, Geneva, Switzerland—dated Feb. 26, 2008.
International Preliminary Report on Patentability—PCT/US06/033269—The International Bureau of WIPO, Geneva, Switzerland—dated Feb. 26, 2008.
International Preliminary Report on Patentability—PCT/US06/033801—International Bureau of WIPO, Geneva, Switzerland, dated Mar. 4, 2008.
International Preliminary Report on Patentability—PCT/US06/033937, The International Bureau of WIPO—Geneva, Switzerland, dated Mar. 4, 2008.
International Preliminary Report on Patentability—PCT/US06/060291, International Bureau of WIPO—Geneva, Switzerland , dated Apr. 29, 2008.
International Preliminary Report on Patentability—PCT/US06/060292, International Bureau of WIPO—Geneva, Switzerland, dated Apr. 29, 2008.
International Preliminary Report on Patentability—PCT/US06/060327, The International Bureau of WIPO—Geneva, Switzerland, dated Apr. 29, 2008.
International Preliminary Report on Patentability—PCT/US06/060328, The International Bureau of WIPO—Geneva, Switzerland—dated Apr. 29, 2008.
International Preliminary Report on Patentability—PCT/US06/060332, International Bureau of WIPO—Geneva, Switzerland, dated Apr. 29, 2008.
International Preliminary Report on Patentability—PCT/US06/060333—International Bureau of WIPO—Geneva, Switzerland, dated Apr. 29, 2008.
International Preliminary Report on Patentability—PCT/US06/060336—The International Bureau of WIPO—Geneva, Switzerland—dated Apr. 29, 2008.
International Preliminary Report on Patentability—PCT/US06/061061, The International Bureau of WIPO—Geneva, Switzerland, dated May 29, 2008.
International Preliminary Report on Patentability—PCT/US07/060195—International Bureau of WIPO, Geneva, Switzerland, dated Jul. 8, 2008.
International Preliminary Report on Patentability, PCT/US05/024614, IPEA, US—dated Oct. 27, 2006.
International Preliminary Report on Patentability—PCT/US06/060340, International Bureau of WIPO, Geneva Switzerland—dated Apr. 29, 2008.
International Preliminary Report on Patentability—PCT/US06/008986, International Bureau of WIPO, Geneva Switzerland dated Sep. 12, 2007.
International Preliminary Report on Patentability—PCT/US06/008987, International Bureau of WIPO, Geneva Switzerland—dated Sep. 12, 2007.
International Preliminary Report on Patentability—PCT/US06/060341, International Bureau of WIPO, dated Apr. 29, 2008.
International Preliminary Report on Patentability—PCT/US2006/010962, International Bureau of WIPO—dated Oct. 4, 2007.
International Preliminary Report on Patentability—PCT/US2006/060286, International Bureau of WIPO, dated Apr. 29, 2008.
International Preliminary Report on Patentability—PCT/US2006/060287, International Bureau of WIPO—dated Apr. 29, 2008.
International Search Report—PCT/US2001/028314 , International Search Authority—European Patent Office, dated Jun. 5, 2002.
International Search Report—PCT/US06/023514, International Search Authority—ISA/US, datd Oct. 5, 2007.
International Search Report and Written Opinion—PCT/US06/008987, International Search Authority—European Patent Office, dated Sep. 1, 2006.
Kaleh: “Channel Equalization for Block Transmission Systems,” IEEE Journal on Selected Areas in Communications, vol. 13, No. 1, Jan. 1995, pp. 110-121.
Kiessling, M. 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 (Apr. 28, 1996), pp. 789-794.
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 (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.
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 (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 (Jan. 2004), pp. 62-70, XP001189908.
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.
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.
LG Electronics: “PAPR comparison of uplink Ma schemes”, 3GPP TSG RAN WG1 Meeting #41, R1-050475, May 9-13, 2005, pp. 6.
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.
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.
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.
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.
Molisch, et al., MIMO systems with antenna selection, IEEE Microwave Magazine, Mar. 2004, pp. 46-56, XP002411128.
Motorola: “Uplink Numerology and Frame Structure”, 3GPP TAG RAN1 #41 Meeting R1-050397, 10 pages, May 13, 2005.
Naofal Al-Dhahir: “A Bandwidth-Optimized Reduced-Complexity Equalized Multicarrier Transceiver”, IEEE Transactions on Communications, vol. 45, No. 8, Aug. 1997, pp. 1-17.
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) pp. 1344-1353.
Nokia: “Compact signalling of multi-code allocation for HSDPA”, version 2,3GPP R1-02-0018, Jan. 11, 2002.
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-9.
NTT DoCoMo, et al., “Orthogonal Common Pilot Channel and Scrambling Code in Evolved UTRA Downlink,” 3GPP TSG RAN WG1 #42 on LTE (Original R1-050589), R1-050704, London UK, pp. 1-8, Aug. 29-Sep. 2, 2005.
OFDMA Phase II High Level Design, Jan. 2004.
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.
Wang Z., et al., “Wireless multicarrier communications,” IEEE Signal Processing Magazine, May 2000, pp. 29-48.
QFORGE Phase III Design Review, Apr. 2004.
Qualcomm Europe: “Description and link simulations for OFDMA based E-UTRA uplink” 3GPP Draft; R1-051100, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre; Sophia-Antipolis Cedex, France, vol. Ran WG1, No. San Diego, USA; Oct. 4, 2005, Oct. 4, 2005, pp. 1-10, XP050100715.
Qualcomm Europe, Description and link simulations of MIMO schemes for OFDMA based E-UTRA downlink evaluation, 3GPP TSG-RAN WG1 #42 R1-050903, 3GPP, Sep. 2, 2005.
Rohling, H 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.
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.
Sampath et al., “A Fourth-Generation MIMO-OFDM Broadband Wireless System: Design, Performance and Field Trial Results”, IEEE Communications Magazine, Sep. 1, 2002, pp. 143-149, vol. 40, No. 9, IEEE Service Center, XP011092922, ISSN: 0163-6804, DOI: 10.1109/MCOM.2002.1031841.
Samsung Electonics Co. Ltd.; “Uplink Multiple Access and Multiplexing for Evolved UTRA”, R1-050439, May 3, 2005 (May 3, 2005), pp. 1-22, XP55018616, Retrieved from the Internet: URL:http://www.3gpp.org/ftp/tsg_ran/WG1_R1/TSGR1 / DOCS / [retrieved on Feb. 7, 2012].
Samsung: “Uplink Transmission and Multiplexing for EUTRA”, 3GPP Draft; R1-050605 UL Multiplexing, Jun. 16, 2005, XP050111420.
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, M. et al., “A Promising New Wideband Multiple-Access Scheme for Future Mobile Communications Systems”, European Transactions on Telecommunications, Jul. 1, 1999, vol. 10, No. 4, pp. 417-427, Wiley & Sons, Chichester, GB, XP009069928, ISSN: 1 124-31 8X.
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.
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.
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.
Sklar, B., “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. 54,104-106.
Sommer D., et al., “Coherent OFDM transmission at 60 GHz”, Vehicular Technology Conference, 1999, VTC 1999—Fall, IEEE VTS 50th Amsterdam, Netherlands Sep. 19-22, 1999, Piscataway, NJ, USA,IEEE, US, vol. 3, Sep. 19, 1999 (Sep. 19, 1999), pp. 1545-1549, XP010353233, DOI: 10.1109/VETECF.1999.801553, ISBN: 978-0-7803-5435-7.
Sorger U., et al., “Interleaved FDMA—a new spread-spectrum multiple-access scheme” Communications, 1998. ICC 98. Conference Record. 1998 IEEE Internation Al Conference on Atlanta, GA, USA Jun. 7-11, 1998, New York, NY, USA, IEEE, US, vol. 2, Jun. 7, 1998 (Jun. 7, 1998), pp. 1013-1017, XP010284733 ISBN: 978-0-7803-4788-5.
<Span style=“font-family: calibri;”>Schmidt H., et al., “Reducing the Peak to Average Power Ratio of Multicarrier Signals by Adaptive Subcarrier Selection”, IEEE International Conference on Universal Personal Communications, 1998, ICUPC '98, Florence, Italy, vol. 2, Oct. 5-9, 1998, pp. 1-5.
Steiner B., “Performance aspects of an MC/JD-CDMA mobile radio system employing non-contiguous frequency bands”, IEEE, 49th Vehicular Technology Conference, Houston, TX, USA May 16-20, 1999, Piscataway, NJ, USA, IEEE, US, vol. 1, May 16, 1999 (May 16, 1999), pp. 30-34, XP010342028, DOI: 10.1109/VETEC.1999.778010, ISBN: 978-0-7803-5565-1, I. Introduction, II. System model, III.A. Test Symbol Based Approach, IV. Simulation results, figures 1,2.
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.
Supplementary European Search Report—EP06773361—Search Authority—The Hugue—dated Nov. 15, 2011.
T. Kadous “SIC/H-ARQ in MIMO systems,” Oct. 2003.
T. Suzuki , Rank prediction method in consideration of transmission diversity in a MIMO system, Technical study report of the Institute of Electronics, Information and Communication Engineers, Feb. 27, 2008, vol. 107, No. 518, pp. 281-286, RCS2007-233 (Mar. 2008).
Tachikawa (Editor); “W-CDMA Mobile Communication Systems,” John Wiley & Sons Ltd., Japan, Maruzen: pp. 82-213, Jun. 25, 2001.
Taiwan Search Report—TW094123763—TIPO—dated Aug. 8, 2011.
Taiwan Search Report—TW094145925—TIPO—dated Nov. 29, 2011.
Taiwan Search Report—TW095108014—TIPO—dated Mar. 8, 2012.
Taiwan Search Report—TW095108052—TIPO—dated Aug. 22, 2013.
Taiwan Search Report—TW095109023—TIPO—dated Feb. 2, 2012.
Taiwan Search Report—TW095109102—TIPO—dated Jan. 18, 2012.
Taiwan Search Report—TW095109223—TIPO—dated Nov. 1, 2013.
Taiwan Search Report—TW095129021—TIPO—dated May 24, 2011.
Taiwan Search Report—TW095130842—TIPO—dated Jun. 18, 2011.
Taiwan Search Report—TW096146164—TIPO—dated Jun. 1, 2011.
Taiwan Search Report—TW098139993—TIPO—dated Feb. 20, 2013.
Taiwan Search Report—TW099107480—TIPO—dated Apr. 11, 2013.
Taiwan Search Report—TW099110981—TIPO—dated Sep. 3, 2013.
Taiwan Search Report—TW101105728—TIPO—dated Nov. 13, 2013.
Taiwan Search Report—095139878—TIPO—dated Nov. 8, 2010.
Taiwan Search Report—095139893—TIPO—dated Dec. 30, 2010.
Taiwan Search Report—095139900—TIPO—dated Apr. 29, 2010.
Taiwan Search Report—095130842—TIPO—dated Jul. 30, 2010.
Taiwan Search Report—095142631—TIPO—dated Aug. 1, 2010.
Taiwan Search Report—096100636—TIPO—dated Aug. 4, 2010.
Telecommunications Industry Association, Mobile Station-Base Station Compatibility Standard for Dual-Mode Wideband Spread Spectrum Cellular System, TIA/EIA-95, Jul. 1993, 668 pages.
Tellado, “Multicarrier Modulation with Low Par,” Kluwer Academic, Dordrecht, NL, XP-002199500, 2000, pp. 6-11 and 55-60.
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.
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).
T.Kadous. “Implementation of Iterative Detection and Decoding in MIMO Systems,” May 2003.
Tomcik J., “MBFDD and MBTDD Wideband Mode: Technology Overview”, IEEE 802.20 Working Group on Mobile Broadband Wireless Access, pp. 1-109, Jan. 6, 2006, IEEE C802.20-05/68r1.
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.
Tomcik, J., “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.
Tomcik, J.: “QFDD Technology Overview Presentation,” IEEE C802.20-05-59r1, pp. 1-74, Internet Citation, [Online] Nov. 15, 2005,XP002422346, Retrieved from the Internet: URL:http://i eee802.org/20/Contribs/C802.20-05-59r1.pdf> [retrieved on Feb. 27, 2007].
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).
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, Piscataway, NJ, USA IEEE, Sep. 26, 2004, pp. 1129-1133, XP010786798.
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 U.S. Pat. No. 6,904,097, 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 Japan application 2008-510335 corresponding to U.S. Appl. No. 11/142,121, citing JP2001521698, JP11191756 and JP2001156732 dated Feb. 8, 2011.
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.
Tufvesson F., et al., “Pilot Assisted Channel Estimation for OFDM in Mobile Cellular Systems,” IEEE 47th Vehicular Technology Conference, Phoenix, May 4-7, 1997, IEEE Vehicular Technology Conference, NY, IEEE, US vol. 3, Conference 47,XP010229045, pp. 1639-1643.
Van De Beek J.J., et al., “Synchronization of a TDMA-OFDM frequency hopping system”, Vehicular Technology Conference, 1998, VTC 98, 48th IEEE Ottawa, Ontario, Canada May 18-21, 1998, New York, NY, USA, IEEE, US, vol. 2, May 18, 1998 (May 18, 1998), pp. 1290-1294, XP010287974, DOI: 10.1109/VETEC.1998.686447, ISBN: 978-0-7803-4320-7.
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.
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).
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.
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.
Written Opinion—PCT/US05/046742—International Search Authority, European Patent Office—dated Apr. 24, 2006.
Written Opinion—PCT/US06/008455, International Search Authority—European Patent Office, dated Jul. 5, 2006.
Written Opinion—PCT/US06/021207 International Search Authority—European Patent Office, dated Sep. 21, 2006.
Written Opinion—PCT/US06/021379—International Search Authority, European Patent Office—dated Oct. 16, 2006.
Written Opinion—PCT/US06/023095—International Search Authority, European Patent Office—dated Oct. 10, 2006.
Written Opinion—PCT/US06/032900, International Search Authority—European Patent Office, dated May 3, 2007.
Written Opinion—PCT/US06/060291, International Search Authority—European Patent Office, dated May 3, 2007.
Written Opinion—PCT/US06/060327—International Search Authority, European Patent Office, dated Mar. 1, 2007.
Written Opinion—PCT/US06/060333, International Search Authority—European Patent Office, dated Apr. 4, 2007.
Written Opinion, PCT/US05/024614, International Search Authority, European Patent Office—dated Oct. 20, 2005.
Written Opinion PCT/US06/014879 International Search Authority European Patent Office dated Oct. 19, 2007.
Written Opinion—PCT/US2006/010962, International Search Authority—European Patent Office—dated Aug. 4, 2006.
Written Opinion—PCT/US2006/060287, International Search Authority—European Patent Office—dated Apr. 4, 2008.
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.
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.
Yun et al., “Performance of an LDPC-Coded Frequency-Hopping QFDMA System Based on Resource Allocation in the Uplink” Vehicular Technology—Conference 2004. VTO 2004—Spring, 2004 IEEE 59th Milan, Italy May 17-19, 2004, Piscataway, NJ, USA, vol. 4, May 17, 2004. pp. 1925-1928. XP010766497.
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.
Zhang H., “A new space-time-frequency MIMO-OFDM scheme with cyclic delay diversity”, Frontiers of Mobile and Wireless Communication, 2004. Proceedings of the IEEE 6th Circuits and Systems Symposium on vol. 2, Jun. 2, 2004, pp. 647 to 650.
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.
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. 310-914, Conf. 54.
Das, Arnab, et al. “Adaptive, asynchronous incremental redundancy (A-IR) with fixed transmission time intervals TTI or HSDPA.” IEEE, Personal, Indoor and Mobile Radio Communications, 2002. The 13th IEEE International Symposium on, pp. 1083-1087.
Digital cellular telecommunications system (Phase 2+); Mobile radio interface layer 3 specification (GSM 04.08 version 1.7.1 Release 1998); ETSI EN 300 940 V7.7.1 (Oct. 2000), pp. 1,2,91-93.
European Search Report—EP10008766, Search Authority—Berlin Patent Office, dated Oct. 28, 2010.
European Search Report—EP10176007—Search Authority—The Hague—Jul. 18, 2014.
Schmidt H., et al., “Reducing the Peak to Average Power Ratio of Multicarrier Signals by Adaptive Subcarrier Selection”, IEEE International Conference on Universal Personal Communications, 1998, ICUPC '98, Florence, Italy, vol. 2, Oct. 5-9, 1998, pp. 1-5.
Siemens, “Evolved UTRA uplink scheduling and frequency reuse” [online], 3GPP TSG-RAN WG1 # 41 R1-050476, Internet , May 9, 2005.
Tomcik T., “QTDD Performance Report 2,” IEEE C802.20-05/88, IEEE 802.20 Working Group on Mobile Broadband Wireless Access, , pp. 1-56, XP002386798 (Nov. 15, 2005).
Related Publications (1)
Number Date Country
20190273586 A1 Sep 2019 US
Provisional Applications (1)
Number Date Country
60230937 Sep 2000 US
Continuations (5)
Number Date Country
Parent 15226181 Aug 2016 US
Child 16417427 US
Parent 13619460 Sep 2012 US
Child 15226181 US
Parent 13158170 Jun 2011 US
Child 13619460 US
Parent 12171155 Jul 2008 US
Child 13158170 US
Parent 09805887 Mar 2001 US
Child 12171155 US