Signaling method in an OFDM multiple access system

Information

  • Patent Grant
  • 7916624
  • Patent Number
    7,916,624
  • Date Filed
    Tuesday, April 13, 2010
    14 years ago
  • Date Issued
    Tuesday, March 29, 2011
    13 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 Δ 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 aspect, a digital processing system is defined that is utilized in a transmitter that generates a transmission signal having a first circuit that receives a discrete signal of complex data symbols, calculates a frequency response of the discrete signal, and outputs a first vector of length M, a second circuit that receives the vector of length M and generates a second vector of length N, wherein the second vector of length N includes elements of the first vector at positions corresponding to tones allocated to the transmitter, and a third circuit that receives the second vector and generates a digital time domain vector therefrom for transmission by the transmitter.


In one aspect, an apparatus that generates a transmission signal is defined which comprises means for receiving a discrete signal of complex data symbols, calculates a frequency response of the discrete signal, and outputs a first vector of length M, means for receiving the vector of length M and generates a second vector of length N, wherein the second vector of length N includes elements of the first vector at positions corresponding to tones allocated to a transmitter, and means for generating a digital time domain vector of the second vector for transmission by the transmitter.


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 t in 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





J





2





π






f

i


(
k
)




t









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







[




A
1











A
M




]

=



[






J





2





π






f

i


(
1
)





t
1











J





2





π






f

i


(
M
)





t
1























J





2





π






f

i


(
1
)





t
M











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




]







=




[






J





2





π






f

i


(
1
)




0










J





2





π






f

i


(
M
)




0






















J





2





π






f

i


(
1
)




T



N
-
1

N











J





2





π






f

i


(
M
)




T



N
-
1

N






]



[




A
1











A
M




]








=



[






J





2





π






f

i


(
1
)




0










J





2





π






f

i


(
M
)




0






















J





2





π






f

i


(
1
)




T



N
-
1

N











J





2





π






f

i


(
M
)




T



N
-
1

N






]












[






J





2





π






f

i


(
1
)





t
1











J





2





π






f

i


(
M
)





t
1























J





2





π






f

i


(
1
)





t
M











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



[






J





2





π






f

i


(
1
)




0










J





2





π






f

i


(
M
)




0






















J





2





π






f

i


(
1
)




T



N
-
1

N











J





2

π






f

i


(
M
)




T



N
-
1

N






]




[







-
J






2





π






f

i


(
1
)





t
1












-
J






2





π






f

i


(
1
)





t
M
























-
J






2





π






f

i


(
M
)





t
1












-
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 sinc 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 of 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 S1 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







[







J

2

π







f

i


(
1
)




0











J

2

π







f

i


(
M
)




0























J

2

π







f

i


(
1
)




T



N
-
1

N












J

2

π







f

i


(
M
)




T



N
-
1

N






]











is changed to







[







J

2

π








f

i


(
1
)





(

0
-

T

2

LM



)













J

2

π








f

i


(
M
)





(

0
-

T

2

LM



)

























J

2

π








f

i


(
1
)





(


T



N
-
1

N


-

T

2

LM



)













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










-

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′k=Ag(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(t) 90. As with FIG. 4C, the digital signal samples are obtained by letting t=0, T/N, 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



if





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. An apparatus for generating a vector of digital signal samples (S), the apparatus comprising: a processor; anda memory coupled to the processor, the memory including a set of instructions stored therein and executable by the processor toreceive a discrete signal of complex data symbols (C), calculate frequency responses (A1, . . . AM) corresponding to tones (f(1), . . . f(M)), through an M-point discrete Fourier transform (DFT), and output a vector [A1, . . . AM] of length M,expand the vector to a new vector of length N, and insert zero-value symbols corresponding to tones other than tones allocated to a transmitter,perform an N-point inverse discrete Fourier transform (IDFT) operation on the new vector after zero insertion to obtain the vector of digital signal samples (S);pre-pend a cyclic prefix to the vector of digital signal samples (S); andgenerate a signal representing the pre-pended vector digital signal samples (S) for transmission.
  • 2. The apparatus of claim 1, wherein the tones (f(1), . . . f(M)) are allocated tones available for transmission.
  • 3. The apparatus of claim 1, wherein the allocated tones are contiguous.
  • 4. The apparatus of claim 1, wherein the vector of length N is larger than the vector of length M.
  • 5. The apparatus of claim 1, wherein the allocated tones are equally spaced.
  • 6. The apparatus of claim 2, wherein the allocated tones are contiguous.
  • 7. The apparatus of claim 2, wherein the vector of length N is larger than the vector of length M.
  • 8. The apparatus of claim 2, wherein the allocated tones are equally spaced.
  • 9. The apparatus of claim 5, wherein the allocated tones are contiguous.
  • 10. The apparatus of claim 5, wherein the vector of length N is larger than the vector of length M.
  • 11. The apparatus of claim 9, wherein the vector of length N is larger than the vector of length M.
  • 12. The apparatus of claim 6, wherein the vector of length N is larger than the vector of length M.
  • 13. The apparatus of claim 12, wherein the allocated tones are equally spaced.
  • 14. The apparatus of claim 7, wherein the allocated tones are equally spaced.
  • 15. The apparatus of claim 7, wherein the allocated tones are contiguous.
  • 16. The apparatus of claim 8, wherein the allocated tones are contiguous.
  • 17. An apparatus for generating a vector of digital signal samples (S), the apparatus comprising: a processor; andat least one hardware module coupled to the processor and configured toreceive a discrete signal of complex data symbols (C), calculate frequency responses (A1, . . . AM) corresponding to tones (f(1), . . . f(M)), through an M-point discrete Fourier transform (DFT), and output a vector [A1, . . . AM] of length M,expand the vector [A1, . . . AM] to a new vector of length N, and insert zero-value symbols corresponding to tones other than tones allocated to a transmitter,perform an N-point inverse discrete Fourier transform (IDFT) operation on the new vector after zero insertion to obtain the vector of digital signal samples (S),pre-pend a cyclic prefix to the vector of digital signal samples (S); andgenerate a signal representing the pre-pended vector of digital signal samples (S) for transmission.
  • 18. The apparatus of claim 17, wherein the tones (f(1), . . . f(M)) are allocated tones available for transmission.
  • 19. The apparatus of claim 17, wherein the allocated tones are contiguous.
  • 20. The apparatus of claim 17, wherein the vector of length N is larger than the vector of length M.
  • 21. The apparatus of claim 17, wherein the allocated tones are equally spaced.
  • 22. The apparatus of claim 18, wherein the allocated tones are contiguous.
  • 23. The apparatus of claim 18, wherein the vector of length N is larger than the vector of length M.
  • 24. The apparatus of claim 18, wherein the allocated tones are equally spaced.
  • 25. The apparatus of claim 21, wherein the allocated tones are contiguous.
  • 26. The apparatus of claim 21, wherein the vector of length N is larger than the vector of length M.
  • 27. The apparatus of claim 25, wherein the vector of length N is larger than the vector of length M.
  • 28. The apparatus of claim 22, wherein the vector of length N is larger than the vector of length M.
  • 29. The apparatus of claim 28, wherein the allocated tones are equally spaced.
  • 30. The apparatus of claim 23, wherein the allocated tones are equally spaced.
  • 31. The apparatus of claim 23, wherein the allocated tones are contiguous.
  • 32. The apparatus of claim 24, wherein the allocated tones are contiguous.
CROSS-REFERENCE TO RELATED APPLICATIONS

The present application is a continuation of U.S. patent application Ser. No. 12/429,896, entitled “SIGNALING METHOD IN AN OFDM MULTIPLE ACCESS SYSTEM”, filed on Apr. 24, 2009, now pending, which is a continuation of U.S. patent application Ser. No. 11/186,490, entitled “SIGNALING METHOD IN AN OFDM MULTIPLE ACCESS SYSTEM”, filed on Jul. 20, 2005, now U.S. Pat. No. 7,623,442, which is a divisional of U.S. patent application Ser. No. 09/805,887, entitled “SIGNALING METHOD IN AN OFDM MULTIPLE ACCESS SYSTEM”, filed on Mar. 15, 2001, now U.S. Pat. No. 7,295,509, which claims priority to U.S. Provisional Application No. 60/230,937, entitled “SIGNALING METHOD IN AN OFDM MULTIPLE ACCESS WIRELESS SYSTEM”, filed on Sep. 13, 2000, all of which are assigned to the assignee hereof, and expressly incorporated herein by reference.

US Referenced Citations (242)
Number Name Date Kind
4393276 Steele Jul 1983 A
4747137 Matsunaga May 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
5491727 Petit Feb 1996 A
5513379 Benveniste et al. Apr 1996 A
5539748 Raith Jul 1996 A
5548582 Brajal et al. Aug 1996 A
5604744 Andersson et al. Feb 1997 A
5612978 Blanchard et al. Mar 1997 A
5625876 Gilhousen et al. Apr 1997 A
5726978 Frodigh et al. Mar 1998 A
5732113 Schmidl et al. Mar 1998 A
5768276 Diachina et al. Jun 1998 A
5790537 Yoon et al. Aug 1998 A
5812938 Gilhousen et al. Sep 1998 A
5815488 Williams et al. Sep 1998 A
5822368 Wang Oct 1998 A
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
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
6061337 Light et al. 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
6108323 Gray Aug 2000 A
6112094 Dent Aug 2000 A
6128776 Kang Oct 2000 A
6141317 Marchok et al. Oct 2000 A
6154484 Lee et al. Nov 2000 A
6175550 van Nee Jan 2001 B1
6175650 Sindhu et al. Jan 2001 B1
6215983 Dogan et al. Apr 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
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
6388998 Kasturia May 2002 B1
6393012 Pankaj May 2002 B1
6401062 Murashima Jun 2002 B1
6438369 Huang et al. Aug 2002 B1
6449246 Barton et al. Sep 2002 B1
6466800 Sydon et al. Oct 2002 B1
6473467 Wallace et al. Oct 2002 B1
6477317 Itokawa Nov 2002 B1
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
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
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
6636568 Kadous Oct 2003 B2
6654431 Barton et al. Nov 2003 B1
6657949 Jones, IV et al. Dec 2003 B1
6658258 Chen et al. Dec 2003 B1
6674787 Dick et al. Jan 2004 B1
6674810 Cheng Jan 2004 B1
6675012 Gray Jan 2004 B2
6678318 Lai Jan 2004 B1
6693952 Chuah et al. Feb 2004 B1
6701165 Ho et al. Mar 2004 B1
6704571 Moon Mar 2004 B1
6711400 Aura Mar 2004 B1
6717908 Vijayan et al. Apr 2004 B2
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
6778513 Kasapi et al. Aug 2004 B2
6802035 Catreux et al. Oct 2004 B2
6813284 Vayanos et al. Nov 2004 B2
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
6862271 Medvedev et al. Mar 2005 B2
6870808 Liu et al. Mar 2005 B1
6870826 Ishizu Mar 2005 B1
6904550 Sibecas et al. Jun 2005 B2
6907269 Yamaguchi et al. Jun 2005 B2
6909707 Rotstein et al. Jun 2005 B2
6909797 Romsdahl et al. Jun 2005 B2
6928047 Xia Aug 2005 B1
6934266 Dulin et al. Aug 2005 B2
6940845 Benveniste Sep 2005 B2
6954448 Farley et al. Oct 2005 B2
6954481 Laroia et al. Oct 2005 B1
6961364 Laroia et al. Nov 2005 B1
6985434 Wu et al. Jan 2006 B2
6985453 Lundby et al. Jan 2006 B2
6985466 Yun et al. Jan 2006 B1
7006529 Alastalo et al. Feb 2006 B2
7006557 Subrahmanya et al. Feb 2006 B2
7010048 Shattil Mar 2006 B1
7016318 Pankaj et al. Mar 2006 B2
7016425 Kraiem Mar 2006 B1
7050402 Schmidl et al. May 2006 B2
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
7095708 Alamouti et al. Aug 2006 B1
7099299 Liang et al. Aug 2006 B2
7099630 Brunner et al. Aug 2006 B2
7133460 Bae et al. Nov 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
7161971 Tiedemann, Jr. et al. Jan 2007 B2
7164696 Sano et al. Jan 2007 B2
7200177 Miyoshi Apr 2007 B2
7215979 Nakagawa et al. May 2007 B2
7248559 Ma et al. Jul 2007 B2
7248841 Agee et al. Jul 2007 B2
7280467 Smee et al. Oct 2007 B2
7289570 Schmidl et al. Oct 2007 B2
7292651 Li Nov 2007 B2
7295509 Laroia et al. Nov 2007 B2
7313086 Aizawa Dec 2007 B2
7313126 Yun et al. Dec 2007 B2
7313174 Alard et al. Dec 2007 B2
7313407 Shapira Dec 2007 B2
7327812 Auer Feb 2008 B2
7349371 Schein et al. Mar 2008 B2
7366520 Haustein et al. Apr 2008 B2
7379489 Zuniga et al. May 2008 B2
7403748 Keskitalo et al. Jul 2008 B1
7406119 Yamano et al. Jul 2008 B2
7406336 Astely et al. Jul 2008 B2
7418043 Shattil Aug 2008 B2
7447270 Hottinen Nov 2008 B1
7471963 Kim et al. Dec 2008 B2
7548506 Ma et al. Jun 2009 B2
7623442 Laroia et al. Nov 2009 B2
20010021650 Bilgic Sep 2001 A1
20010047424 Alastalo et al. Nov 2001 A1
20010055294 Motoyoshi Dec 2001 A1
20010055297 Benveniste Dec 2001 A1
20020000948 Chun et al. Jan 2002 A1
20020018157 Zhang et al. Feb 2002 A1
20020039912 Yamaguchi et al. Apr 2002 A1
20020058525 Kasapi et al. May 2002 A1
20020077152 Johnson et al. Jun 2002 A1
20020090004 Rinchiuso Jul 2002 A1
20020090024 Tan Jul 2002 A1
20020101839 Farley et al. Aug 2002 A1
20020122381 Wu et al. Sep 2002 A1
20020122403 Hashem et al. Sep 2002 A1
20020147953 Catreux et al. Oct 2002 A1
20020159422 Li et al. Oct 2002 A1
20020160769 Gray Oct 2002 A1
20020168946 Aizawa et al. Nov 2002 A1
20020181571 Yamano et al. Dec 2002 A1
20020191569 Sung et al. Dec 2002 A1
20030072255 Ma et al. Apr 2003 A1
20030109226 Brunner et al. Jun 2003 A1
20030109266 Rafiah et al. Jun 2003 A1
20030133426 Schein et al. Jul 2003 A1
20030161281 Dulin et al. Aug 2003 A1
20040001429 Ma et al. Jan 2004 A1
20040015692 Green et al. Jan 2004 A1
20040032443 Moylan et al. Feb 2004 A1
20040067756 Wager et al. Apr 2004 A1
20040095907 Agee et al. May 2004 A1
20040097215 Abe et al. May 2004 A1
20040131110 Alard et al. Jul 2004 A1
20040136344 Kim et al. Jul 2004 A1
20040141548 Shattil Jul 2004 A1
20040166867 Hawe Aug 2004 A1
20040190640 Dubuc et al. Sep 2004 A1
20040252629 Hasegawa et al. Dec 2004 A1
20040257979 Ro et al. Dec 2004 A1
20050002440 Alamouti et al. Jan 2005 A1
20050053081 Andersson et al. Mar 2005 A1
20050073976 Fujii Apr 2005 A1
20050147024 Jung et al. Jul 2005 A1
20050174981 Heath, Jr. et al. Aug 2005 A1
20050243791 Park et al. Nov 2005 A1
20050254416 Laroia et al. Nov 2005 A1
20060002451 Fukuta et al. Jan 2006 A1
20060172704 Nishio et al. Aug 2006 A1
20070064669 Classon et al. Mar 2007 A1
20070177631 Popovic et al. Aug 2007 A1
20080063099 Laroia et al. Mar 2008 A1
20080181139 Rangarajan et al. Jul 2008 A1
20090010351 Laroia et al. Jan 2009 A1
20090197646 Tamura et al. Aug 2009 A1
20100254263 Chen et al. Oct 2010 A1
Foreign Referenced Citations (99)
Number Date Country
2348137 Nov 2001 CA
2477536 Sep 2003 CA
19931400 Dec 1994 CL
8461997 Jan 1998 CL
009531997 Jan 1998 CL
1284795 Feb 2001 CN
19800653 Jul 1999 DE
19800953 Jul 1999 DE
19957288 May 2001 DE
0488976 Jun 1992 EP
0568291 Nov 1993 EP
0786889 Jul 1997 EP
0805576 Nov 1997 EP
0807989 Nov 1997 EP
0844796 May 1998 EP
0981222 Feb 2000 EP
1001570 May 2000 EP
1061687 Dec 2000 EP
1091516 Apr 2001 EP
1093241 Apr 2001 EP
1148673 Oct 2001 EP
1187506 Mar 2002 EP
1204217 May 2002 EP
1445873 Aug 2004 EP
1538863 Jun 2005 EP
1542488 Jun 2005 EP
1601149 Nov 2005 EP
1643669 Apr 2006 EP
2279540 Jan 1995 GB
2348776 Oct 2000 GB
09-131342 May 1997 JP
9182148 Jul 1997 JP
09214404 Aug 1997 JP
11298954 Oct 1999 JP
2000184425 Jun 2000 JP
2000332724 Nov 2000 JP
2001016644 Jan 2001 JP
2005020530 Jan 2005 JP
20000060428 Oct 2000 KR
100291476 Mar 2001 KR
20010056333 Apr 2001 KR
20010087715 Sep 2001 KR
20030007965 Jan 2003 KR
95121152 Dec 1997 RU
2141168 Nov 1999 RU
2141706 Nov 1999 RU
2159007 Nov 2000 RU
2162275 Jan 2001 RU
2192094 Oct 2002 RU
2208913 Jul 2003 RU
2210866 Aug 2003 RU
2216105 Nov 2003 RU
2225080 Feb 2004 RU
2003125268 Feb 2005 RU
2285388 Mar 2005 RU
1320883 Jun 1987 SU
508960 Nov 2002 TW
9408432 Apr 1994 WO
WO9521494 Aug 1995 WO
WO9613920 May 1996 WO
WO9746033 Dec 1997 WO
WO9800946 Jan 1998 WO
WO9814026 Apr 1998 WO
9853561 Nov 1998 WO
WO9854919 Dec 1998 WO
WO9941871 Aug 1999 WO
WO9944313 Sep 1999 WO
WO9944383 Sep 1999 WO
WO9952250 Oct 1999 WO
WO9959265 Nov 1999 WO
WO9960729 Nov 1999 WO
00002397 Jan 2000 WO
WO0139523 May 2001 WO
01045300 Jun 2001 WO
WO0148969 Jul 2001 WO
WO0158054 Aug 2001 WO
WO0160106 Aug 2001 WO
0182543 Nov 2001 WO
WO0182544 Nov 2001 WO
WO0193505 Dec 2001 WO
WO0204936 Jan 2002 WO
WO0219746 Mar 2002 WO
WO0231991 Apr 2002 WO
WO0233848 Apr 2002 WO
WO0249306 Jun 2002 WO
02060138 Aug 2002 WO
WO03001981 Jan 2003 WO
03085876 Oct 2003 WO
WO2004008681 Jan 2004 WO
WO2004030238 Apr 2004 WO
WO2004032443 Apr 2004 WO
WO2004038972 May 2004 WO
WO2004051872 Jun 2004 WO
WO2004073276 Aug 2004 WO
WO2005015797 Feb 2005 WO
WO2006099545 Sep 2006 WO
WO2006099577 Sep 2006 WO
WO2006127544 Nov 2006 WO
WO2007024935 Mar 2007 WO
Related Publications (1)
Number Date Country
20100195487 A1 Aug 2010 US
Provisional Applications (1)
Number Date Country
60230937 Sep 2000 US
Divisions (1)
Number Date Country
Parent 09805887 Mar 2001 US
Child 11186490 US
Continuations (2)
Number Date Country
Parent 12429896 Apr 2009 US
Child 12759634 US
Parent 11186490 Jul 2005 US
Child 12429896 US