In an embodiment, a channel estimator includes first and second stages. The first stage is operable to generate a respective one-dimensional array of first channel-estimation coefficients for each communication path of a communication channel, and the second stage is operable to generate a multi-dimensional array of second channel-estimation coefficients in response to the first channel-estimation coefficients.
For example, such a channel estimator may estimate the response of a channel over which propagates an orthogonal-frequency-division-multiplexed (OFDM) signal that suffers from inter-carrier interference (ICI) due to Doppler spread. Such a channel estimator may estimate the channel response more efficiently, and with a simpler algorithm (e.g., with an algorithm that does not require a real-time matrix inversion), than conventional channel estimators. Furthermore, such a channel estimator may be able to dynamically account for changes in the number of communication paths that compose the channel, for changes in the delays of these paths, or for changes in the signal energy levels of these paths.
Referring to
The frequency spacing fs between adjacent ones of the N subcarriers is typically constant, and is conventionally selected to minimize inter-carrier interference (ICI), which is a phenomenon that occurs if energy from one subcarrier “spills over” to the frequency slot of another subcarrier at the receiver of the client 12. At the transmitter of the base 10, each of the active ones of the N subcarriers has a frequency fk (for k=0 to N−1) represented by a respective one of the solid lines (only the frequencies fk for k=N-a to N-(a−8) are shown in
To allow the receiver of the client 12 to recover the data subsymbols in the presence of ICI and other interference or noise, the transmitter of the base 10 transmits an OFDM training symbol—a “training symbol” is the combination of all the training subsymbols transmitted during a training-symbol period—shortly before transmitting an OFDM data symbol—a “data symbol” is the combination of all of the data subsymbols transmitted during an OFDM data-symbol period. That is, the transmitter of the base 10 transmits the training symbol during a first OFDM symbol period, and transmits the data symbol during a second, subsequent OFDM symbol period. Because the receiver of the client 12 “knows” the identity of the transmitted training symbol ahead of time, the receiver characterizes the channel 14 by comparing the received training symbol with the known transmitted training symbol. For example, the receiver may characterize the channel 14 by generating an N×N matrix Ĥ of estimated complex frequency-domain coefficients that respectively represent the frequency response (e.g., the imparted ICI, amplitude attenuation, and phase shift) of the channel at each of the subcarrier frequencies fk—the “^” indicates that Ĥ is an estimate of the actual channel matrix H. As discussed in more detail below, the receiver may then use this channel-estimation matrix Ĥ to recover transmitted data symbols from respective received data symbols.
At the base 10, the OFDM symbol may be similar to the OFDM symbol of
But at the receiving client 12, the frequency fk of a subcarrier k may be shifted/spread by one or more times G as indicated by the frequency slot 26N-(a−4) of the subcarrier k=N-(a−4) (only this one frequency slot is shown in
The frequency shifts/spreads of the received OFDM subcarriers of
According to the Doppler Effect, the frequency of a signal at a receiver is different from the frequency of the signal at a transmitter if the receiver and transmitter are moving relative to one another at a non-zero velocity. If the receiver and transmitter are moving away from one another, then the frequency of the signal at the receiver is typically lower than the frequency of the signal at the transmitter; conversely, if the receiver and transmitter are moving toward one another, then the frequency of the signal at the receiver is typically higher than the frequency of the signal at the transmitter. For example, a person (receiver) who is listening to the whistle of an approaching train (transmitter) may experience this phenomenon. While the train is moving toward the person, the person perceives the whistle as having a pitch (frequency) that is higher than the pitch that one on the train would perceive the whistle as having. But after the train passes the person, and is thus moving away from him, the person perceives the whistle as having a pitch lower than the pitch that one on the train would perceive the whistle as having.
Consequently, the subcarrier frequencies of the OFDM symbol 25 of
A measure of the influence that the Doppler Effect has on a single transmitted tone (e.g., an unmodulated subcarrier signal with a constant non-zero amplitude) is the “Doppler Spread”, which is the bandwidth that the tone may occupy at the receiver due to the Doppler Effect. For example, suppose that the frequency of the tone is 1,000 Hz at the transmitter, but that at the receiver, due to the non-zero velocity of the receiver relative to the transmitter, the received tone may have a frequency anywhere from 980 Hz to 1,020 Hz depending on the instantaneous velocity. Therefore, in this example, the Doppler Spread=1020 Hz-980 Hz=40 Hz. That is, the Doppler Spread is (40 Hz)/(1000 Hz)=4% of the frequency of the transmitted tone—although expressed here in Hz and as a percentage of the transmitted frequency, the Doppler Spread may be expressed in other quantities as described below.
For mobile OFDM devices, one may characterize the ICI caused by the Doppler Spread of a subcarrier in terms of the highest number of adjacent subcarriers with which the subcarrier may interfere. For example, the total Doppler induced ICI caused by the 50th (k=50) subcarrier is greater if energy from this subcarrier spills over to the 48th, 49th, 51st, and 52nd subcarriers, and is less if energy from this subcarrier spills over to only the 49th and 51st subcarriers. In actuality, because the Doppler Spread of a subcarrier may cause the subcarrier to spill over energy into many or all of the other N subcarrier slots to some degree, one may set a Doppler Spread interference threshold below which one subcarrier is deemed to be unaffected by the Doppler Spread of another subcarrier. Therefore, for a mobile OFDM device, the extent of Doppler induced ICI caused by a subcarrier k may be defined in terms of the number of adjacent subcarriers (above and below the subcarrier k in question) that may experience a level of ICI above the Doppler Spread interference threshold for the device. Furthermore, although in some applications one may assume that all of the subcarriers k experience the same Doppler Spread, in other applications, one may decide not to make this assumption.
Consequently, referring to
Still referring to
Consequently, mobile OFDM devices, such as the base 10, may combine training subsymbols and data subsymbols into a single OFDM symbol such that a receiving device, such as the client 12, may characterize the channel 14 for the same time period during which the data subsymbols are transmitted.
The OFDM symbol 28 includes one or more clusters LD of data subcarriers, and one or more clusters LP of training subcarriers, which are hereinafter called “pilot” subcarriers. The transmitter of the base 10 may modulate the pilot subcarriers with respective pilot subsymbols. In an embodiment, the data clusters LD and the pilot clusters LP are arranged in alternating fashion (i.e., one after the other such that each data cluster LD is separated from adjacent data clusters by at least one pilot cluster LP, and such that each pilot cluster is separated from adjacent pilot clusters by at least one data cluster) within the OFDM symbol 28. As discussed below in conjunction with
In an embodiment, each data cluster LD within the OFDM symbol 28 includes a same first number (e.g., sixteen) of data subcarriers, and each pilot cluster LP within the OFDM symbol includes a same second number (e.g., five or nine) of pilot subcarriers. For example, in the embodiment of
A designer of an OFDM receiver, such as the receiver in the client 12 (
In an embodiment, the pilot clusters LP are separated by a uniform separation value Psep, which is the distance, measured in the number of subcarriers k, between a pilot subcarrier in a pilot cluster and a corresponding pilot subcarrier in an adjacent pilot cluster. That is, a pilot subcarrier that occupies a relative position within a pilot cluster LP is Psep subcarriers away from a pilot subcarrier that occupies the same relative position within an adjacent pilot cluster. For example, as shown in
Before substantive characteristics of the pilot cluster LPFDKD
Still referring to
The receiver 30 includes a receive antenna 32, a Fast Fourier Transform (FFT) unit 34, a channel estimator 36, a data-recovery unit 38, and a decoder 40. The FFT unit 34, channel estimator 36, data-recovery unit 38, and decoder 40 may each be implemented in software, hardware, or a combination of software and hardware. For example, one or more of the FFT unit 34, the channel estimator 36, the data-recovery unit 38, and the decoder 40 may be implemented on an integrated circuit (IC), and other components, such as a transmitter, may also be implemented on the same IC, either on a same or different IC die. And this IC may be combined with one or more other ICs (not shown in
The receive antenna 32 may receive one or more OFDM symbols from a transmitter, such as the transmitter of the base 10 or client 12 of
The FFT unit 34 conventionally converts a received OFDM symbol from a time-domain waveform into an N×1 column vector y of complex frequency-domain coefficients (e.g., one complex coefficient for each subcarrier).
The channel estimator 36 estimates the response of the communication channel (e.g., the channel 14 of
The data-recovery unit 38 recovers the data carried by the OFDM symbol as transmitted by generating an N×1 column vector {circumflex over (x)}, which is an estimation of the transmitted OFDM symbol. That is, {circumflex over (x)} includes complex coefficients (one for at least each data subcarrier) that are estimates of the complex coefficients with which the transmitter modulated the transmitted subcarriers. The unit 38 may generally recover {circumflex over (x)} according to the following equations:
y=Ĥ{circumflex over (x)}+n (1)
Ĥ−1(y)=Ĥ−1Ĥ{circumflex over (x)}+Ĥ−1n={circumflex over (x)}+Ĥ−1n (2)
where n is an N×1 vector of additive-white-Gaussian-noise complex coefficients at each of the subcarrier frequencies. Because, as discussed above, some of the y coefficients are for pilot subcarriers that are used only for channel-estimation purposes, the elements of Ĥ, {circumflex over (x)}, y and n that correspond to the Np(2Wp+1) pilot subcarriers (where Np is the number of pilot clusters LP in the OFDM symbol) may be discarded prior to calculating Ĥ−1 and solving equation (2) so as to reduce the complexity, and increase the speed, of the calculation of {circumflex over (x)}. Examples of a data-recovery unit and data-recovery techniques that may be used as and by the data-recovery unit 38 are disclosed in U.S. patent application Ser. Nos. 12/579,935 and 12/579,969, which were filed on Oct. 15, 2009 and which are incorporated by reference. And conventional data-recovery units and techniques that may be respectively used as and by the data-recovery unit 38 also exist.
The data decoder 40 effectively uses the {circumflex over (x)} coefficients that correspond to the data subcarriers of the OFDM symbol to demodulate the corresponding data subsymbols, and to thus recover the data represented by the subsymbols. For example, if the transmitter modulated a data subcarrier by mapping it to a respective QPSK constellation element, then the data decoder 40 QPSK demodulates the data subcarrier to recover the same constellation element, which represents the bits of data carried by the modulated data subcarrier.
Still referring to
And referring to
Over a period of time that may be much longer than a single OFDM symbol period (e.g., approximately 100-300 OFDM symbol periods), the number Z of paths L may change. The change in the number of paths L may be due to changes in the channel conditions, such as changes in the number of OFDM-signal-reflecting objects within or near the channel 14.
Furthermore, over the same period, the delays of the paths L, and the portions of the OFDM signal energy carried by the paths L, may also change. Each path L is defined by the delay it has relative to the zeroth path L0 having zero delay. That is, the zero-delay path L0 is the path over which a version of an OFDM signal, having a respective portion of the energy of the transmitted OFDM signal, first reaches the receiver; other versions of the OFDM signal reach the receiver over the remaining paths L at the respective delay times (relative to the delay of the path L0) that define those paths, and with respective portions of the transmitted energy. The delay time of a path L may be defined in units of the OFDM-signal sampling time employed by the receiver. For example, when a version of an OFDM signal propagates over a path LI having a delay value of 1, this signal version first reaches the receiver one sample time, or one sample, after the version of the OFDM signal that is propagating over the path L0 first reaches the receiver. Likewise, when a version of an OFDM signal propagates over a path LI having a delay value of 3.5, this signal version first reaches the receiver three-and-one-half samples after the version of the OFDM signal that is propagating over the path L0 first reaches the receiver.
Unfortunately, a channel estimator that does not account for changes in at least one of the number, delays, and energies of the paths L may be unable to determine the channel-estimation matrix Ĥ with an accuracy sufficient for some applications such as mobile OFDM.
Referring to
The first stage 50 includes a communication-path monitor 52, a pilot-subcarrier-vector generator 54, a pilot-subcarrier-error-vector generator 56, a frequency-domain-path-vector generator 58, and a frequency-domain-to-time-domain transformer 60.
The communication-path monitor 52 tracks changes to the number, delays, and energies of the communication paths L, periodically updates a communication-path vector c, and makes the vector c and path energies available to the pilot-subcarrier-error-vector generator 56. The number of elements in the vector c equal the number of communications paths L, and the values of these elements equal the respective delays of the paths. For example, if there are four paths L with delays of 0, 1, 3, and 4, then the vector c=[0, 1, 3, 4] (for reasons discussed above in conjunction with
The pilot-subcarrier-vector generator 54 generates column vectors y(i) from respective groups of the pilot subcarriers, where the index i=−Wp/2 to +Wp/2. The operation of an embodiment of the generator 54 is further discussed below.
The pilot-subcarrier-error-vector generator 56 generates column error vectors ĝ(i) from the respective column vectors y(i), where each vector ĝ(i) is a collection of the ith element of the frequency-domain transform for all of the time-domain paths L in the communication channel 14 (
The frequency-domain-path-vector generator 58 generates a respective column vector fI of frequency-domain coefficients for each communication path LI for I=0 to Z−1. The operation of an embodiment of the generator 58 is further discussed below.
The frequency-domain-to-time-domain transformer 60 converts each of the frequency-domain path vectors fI into a corresponding one of the time-domain path vectors hI. For example, the transformer 60 may be an IFFT. The operation of the transformer 60 is further discussed below.
Referring to
The second stage 62 includes a time-domain-channel-estimation-matrix generator 64, and a time-domain-to-frequency-domain transformer 66.
The time-domain-channel-estimation-matrix generator 64 generates an intermediate channel-estimation matrix
And the frequency-domain-to-time-domain transformer 66 converts the intermediate channel-estimation matrix
Referring to
After the activation of the receiver 30, but before the receiver receives an OFDM symbol, the communication-path monitor 52 sets the path vector c to an initial state, which may be set by programming or which the monitor may select from a look-up table (LUT, not shown in
Thereafter, once the receiver 30 begins to receive one or more OFDM symbols, the monitor 52 monitors these signals carrying these symbols to determine the number of paths in the channel 14 (
Next, the communication-path monitor 52 periodically updates the vector c to reflect the number of paths L that exist at the time of the updating, and the delays of these paths; the monitor may also update, at the same times, the portions of the transmitted OFDM-symbol energy carried by these paths on average over the updating period. For example, the monitor 52 may update the vector c and the average path energies once every v received OFDM symbols, where v may range approximately between 100 and 300. Or, the monitor 52 may update the vector c and the average path energies at fixed time intervals, e.g., once every approximately 0.5 to 1.0 seconds.
In an embodiment, the communication-path monitor 52 may determine the number of paths and the delays and energies of these paths, may periodically update the vector c and the path energies, and may perform other operations as described in Simeone et al., Pilot Based Channel Estimation For OFDM Systems By Tracking The Delay Subspace, IEEE Transactions On Wireless Communications, Vol. 3, No. 1, pp. 315-324, January 2004, which is incorporated by reference.
In another embodiment, the communication-path monitor 52 may determine the number of paths and the delays and energies of these paths by examining the eigenvalues and eigenvectors of an autocorrelation matrix A, which is given by the following equation:
A=E{y(0)y(0)H} (3)
where E indicates the expectation (i.e., long-term average), the vector y(0) is described below in conjunction with equation (4), and H indicates the Hermitian transpose of the preceding vector or matrix (in equation (3), H indicates the Hermitian transpose of y(0). Each eigenvector of A corresponds to a path L of the channel 14 (
Still referring to
y(i)=P*y(P(i))T i=−Wp/2 to +Wp/2 (4)
where Np is the number of pilot clusters in the received OFDM symbol, P* is the complex conjugate of the pilot subsymbol P, the ( ) operator indicates that that the vector y(i) includes only the elements of the vector y at the locations indicated by the column vector p(i), and T is the transpose operator, which in this case, indicates that y(i) is a column vector.
The Np×1 column vector p(i) of equation (4) is given by the following equation:
p(i)=[<Pb+i>,<Pb+Psep+i>,<Pb+2·Psep+i>, . . . ,<Pb+(Np−1)·Psep+i>]T (5)
where the < > operator indicates modulo arithmetic relative to the total number N of subcarriers in the OFDM symbol, and Np is the total number of pilot clusters Lp in the OFDM symbol. Modulo arithmetic indicates that it is acceptable to locate a single pilot cluster Lp such that it “wrap arounds” the ends of the OFDM symbol and, therefore, includes the first and last subcarriers of the OFDM symbol. For example, if N=64, Wp=2, and Pb=0 such that the zeroth subcarrier k0 of the OFDM symbol is the center pilot subcarrier of a pilot cluster Lp, then <Pb−2> equals 62 to indicate that k62 is the Pb−2 subcarrier of Lp, <Pb−1> equals 63 to indicate that k63 is the Pb−1 subcarrier of Lp, <Pb−0> equals 0 to indicate that k0 is the center subcarrier of Lp, <Pb+1> equals 1 to indicate that k1 is the Pb+1 subcarrier of Lp, and <Pb+2> equals 2 to indicate that k2 is the Pb+2 subcarrier of Lp.
Per equation (4), each Np×1 column vector y(i) includes only elements that correspond to the pilot subcarriers of y in the ith relative position of each pilot cluster LP. For example, for Wp=2, y(−1) includes only Np elements that correspond to the Pb+S·Psep−1 pilot subcarriers for S=0 to (Np−1), y(0) includes only Np elements that correspond to the Pb+S·Psep pilot subcarriers, and y(+1) includes only Np elements that correspond to the Pb+S·Psep+1 pilot subcarriers.
Also per equation (4), multiplying each element of each vector y(i) by P* yields an indication of not only the attenuation and phase shift imparted to the OFDM symbol by the channel 14 (
Furthermore, in an embodiment, the generator 54 generates vectors y(1) for only the center Wp+1 pilot subcarriers of each pilot cluster Lp to provide frequency “guard bands” between the data and pilot subcarriers. For example, if each pilot cluster Lp in an OFDM symbol includes five pilot subcarriers (i.e., where Wp=2), then the generator 54 generates only vectors y(−1), y(0), and y(+1), which correspond to only the middle three pilot subcarriers of each pilot cluster. That is, in this example, the channel estimator 36 analyzes only the middle three pilot subcarriers of each pilot cluster Lp to estimate the channel 14 (
Still referring to
y(i)=FL(0)H·g(−i) (6)
where FL(0), which is further discussed below, is an Np×Z subset of the known N×N Fourier matrix, and where g(−i) is a Z×1 column vector that, as discussed above, effectively separates the channel response into the responses of the paths L of the channel 14 (
But calculating g(−i) from equation (6) may yield a channel-estimation matrix Ĥ that is not accurate enough for some applications where the receiver 30 is moving relative to the transmitter. Reasons for this include that the matrix FL may not be a square matrix, and that even if FL is a square matrix, its inverse FL−1 (needed to solve for g(−i) in equation (6)), may yield an estimate of g(−i) that does not yield a sufficiently accurate channel-estimation matrix Ĥ.
Therefore, one may calculate an estimate ĝ(i) of g(i) as described below, where ĝ(i) may allow the channel estimator 36 to generate a sufficiently accurate channel-estimation matrix Ĥ.
Still referring to
ψ(−i)LMMSE=(FL(0)H·N(i)−1·FL(0)+Rg−1)−1·FL(0)H·N(i)−1·y(i) (7)
where Z is the number of channel paths L (i.e., the number of elements in the vector c), LMMSE is an abbreviation for “Linear Minimum Mean Squared Error”, H indicates a Hermitian transpose of a matrix, FL(0), which is further described below, is an Np×Z Fourier path matrix that is a subset of the known N×N Fourier matrix F, −1 indicates a matrix inversion—although in an embodiment this matrix inversion is a standard matrix inversion, in another embodiment this inversion, and other matrix inversions described herein, may be a pseudo inversions such as Moore-Penrose inversions—N(i), which is also further described below, is a Np×Np noise-covariance matrix, and Rg, which is also further described below, is a Z×Z matrix. As discussed below, however, because the matrices N(i)−1, Rg−1, and (FL(0)H·N(i)−1·FL(0)+Rg−1)−1 may be determined ahead of time and stored in a look-up table, equation (7) may not require the vector generator 56 to invert a matrix in real time.
The Np×Z Fourier path matrix FL(0) of equation (7) is given by the following equation:
FL(0)=F(p(0),c) (8)
where F (the target matrix of p(0) and c in equation (8)) is the known N×N Fourier matrix, and the ( ) operator indicates that FL(0) includes the elements of the Fourier matrix F in the Np rows of F indicated by the elements of the column vector p(0) and in the Z columns of F indicated by the elements of the path vector c. From equation (4), the elements of p(0) include the locations/indices of the center pilot subcarriers of the transmitted OFDM symbol, and the elements of the vector c include the path delays of the paths LI (I=0−Z−1) that compose the channel 14 (
The Np×Np matrix N(i) is given by the following equation:
N(i)=E{H(p(i),:)·d·dH·HH(p(i),:)}+σ2·INp (9)
where E denotes the mathematical expectation (i.e., the average over a relatively long time) of the resulting matrix inside of the { }, H is the actual channel-response matrix (as compared to the estimated channel-response matrix Ĥ), the operator (p(i),:) indicates that only the elements of H included in the calculation of N(i) are in the rows of H indicated by the elements of p(i) and in all of the columns of H (“:” indicates all columns), d is an N×1 column vector of the data subsymbols that modulate the data subcarriers k (elements of d corresponding to the pilot subcarriers equal 0), σ2 is the noise variance at each subcarrier kn of the OFDM symbol (in an embodiment, σ2 is the same for all subcarriers), and INp is an Np×Np identity matrix having elements of 1 along its top-left-to-bottom-right diagonal and having elements of 0 elsewhere.
Although equation (9) shows the relationship between N(i) and the long term average of the equation involving data d, the channel response H, and the noise variance σ2, one may calculate versions of N(i) ahead of time based on anticipated speeds of the receiver 30 relative to the transmitter, an anticipated number Z of paths L in the communication channel 14 (
The Z×Z matrix Rg−1 is given by the following equation:
Rg−1=E{g(−i)Hg(i)} (10)
Although equation (10) shows the relationship between Rg−1 and the long-term average of the vector g(−i)Hg(i), one may calculate versions of Rg−1 ahead of time based on anticipated speeds of the receiver relative to the transmitter, an anticipated number Z of paths L in the communication channel 14 (
Then, based on the speed of the receiver (e.g., the speed of an automobile in which the receiver is located), and the path vector c and the path energies determined by the path monitor 52, the generator 56 may select the appropriate N(i) and Rg−1 matrices from an LUT (not shown in
Furthermore, because, as discussed above, FL(0) may also be calculated ahead of time (or at least every time that the vector c is updated), then the inverted matrix term (FL(0)H·N(i)−1·FL(0)+Rg−1)−1 of equation (7) may also be calculated ahead of time for different versions of N(i) and Rg−1 such that this inverted matrix need not be calculated in real time.
Moreover, further information regarding N(i), Rg−1, and g(i) is included in Pilot-Assisted Time-Varying Channel Estimation for OFDM Systems, Tang et al., IEEE Transactions On Signal Processing, Vol. 55, No. 5, May 2007, pp. 2226-2238, which is incorporated by reference.
Still referring to
ζ(i)LS=(FL(0)H·FL(0))−1·FL(0)H·y(i) (11)
where LS is an abbreviation of “Least Squares”. One may see that ζ(−i)LS of equation (11) differs from ψ(−i)LMMSE of equation (7) by the terms N(i) and Rg−1, and thus may be less complex than ψ(−i)LMMSE. But although ζ(−i)LS may be less complex than ψ(−i)LMMSE, for a given OFDM symbol and for given conditions of the channel 14 (
In an embodiment, one may program the pilot-subcarrier-error-vector generator 56 ahead of time to calculate either ζ(−i)LS or ψ(−i)LMMSE. Alternatively, the generator 56 may switch between calculating ζ(−i)LS and ψ(−i)LMMSE based on factors such as the condition of the channel 14 (
Still referring to
ĝ(i)=ψ(i)LMMSE (12)
or
ĝ(i)=ζ(i)LS (13)
Then, the frequency-domain-path-vector generator 58 generates Z, N×1 column frequency-domain path vectors fI according to the following equation:
fI=[ĝ(0)(l),ĝ(−1)(l), . . . ,ĝ(−Wp/2)(l),0, . . . ,0,ĝ(Wp/2)(l), . . . ,ĝ(1)(l)]T for I=0 to Z−1 (14)
Next, in an embodiment, the inverse-frequency-domain transformer 60 converts each of the frequency-domain path vectors fI into Z corresponding N×1 time-domain-path column vectors hI according to the following equation:
hI=FH·fI for I=0 to Z−1 (15)
where F is the N×N Fourier matrix.
Then, in an embodiment, the time-domain-channel-estimation-matrix generator 64 generates an intermediate N×N time-domain channel-estimation matrix
Next, in an embodiment, the frequency-domain transformer 66 converts the N×N intermediate matrix
Still referring to
Referring to
The pilot-subcarrier-vector generator 54, the pilot-subcarrier-error-vector generator 56, the frequency-domain-path-vector generator 58, and the frequency-domain-to-time-domain transformer 60 may operate as discussed above in conjunction with
The communication-path monitor 72 may track changes to the number, delays, and energies of the communication paths L like the monitor 52 does as discussed above in conjunction with
Furthermore, the monitor 72 may generate and update the path vector c like the monitor 52, except that the monitor 72 may maintain the number of elements in the vector c constant, where this constant number equals a maximum number of paths L that the channel 14 (
But a potential problem with maintaining the vector c at a constant length is that the channel estimator 36 may include information regarding zero-energy paths L in the determination of the channel-estimation matrix Ĥ, and this information may introduce error into Ĥ. More specifically, the generator 56 may generate ĝ(i) in response to information in zero-energy paths L, the generator 58 may generate vectors fI for zero-energy paths, and the transformer 60 may generate vectors hI for zero-energy paths; and the zero-energy path vectors fI and hI may be corrupted by, e.g., noise, because the signal-to-noise ratios (SNRs) of the corresponding zero-energy paths are relatively low.
To avoid potentially introducing error into Ĥ in response to zero-energy paths L, the monitor 72 may control the switch banks 74 and 76 to prevent the transformer 60 from generating vectors hI for such paths, and from providing such vectors hI to the second stage 62 (
In another embodiment, the first stage 70 may omit the switch bank 74 and include only one switch bank, the switch bank 76. In such an embodiment, the transformer 60 may still generate vectors hI corresponding to zero-energy paths, but the corresponding open switches in the switch bank 76 prevents the second stage 62 (
From the foregoing it will be appreciated that, although specific embodiments have been described herein for purposes of illustration, various modifications may be made without deviating from the spirit and scope of the disclosure. Furthermore, where an alternative is disclosed for a particular embodiment, this alternative may also apply to other embodiments even if not specifically stated.
The present application is a Continuation-In-Part of co-pending U.S. patent application Ser. No. 12/579,935, filed Oct. 15, 2009; the present application is also a Continuation-In-Part of co-pending U.S. patent application Ser. No. 12/579,969, filed Oct. 15, 2009; which applications claim priority to U.S. Provisional Patent Application Nos. 61/105,704, filed Oct. 15, 2008; and 61/158,290, filed Mar. 6, 2009; also, the present application claims the benefit of U.S. Provisional Patent Application Ser. No. 61/267,667, filed Dec. 8, 2009; and the present application also claims the benefit of U.S. Provisional Patent Application Ser. No. 61/360,367, filed Jun. 30, 2010; all of the foregoing applications are incorporated herein by reference in their entireties.
Number | Name | Date | Kind |
---|---|---|---|
5479446 | Mourot | Dec 1995 | A |
5852630 | Langberg et al. | Dec 1998 | A |
6680901 | Yamamoto et al. | Jan 2004 | B1 |
8098713 | Baxley et al. | Jan 2012 | B2 |
8170516 | Dehos et al. | May 2012 | B2 |
8428158 | Maltsev et al. | Apr 2013 | B2 |
20020146063 | Gorokhov et al. | Oct 2002 | A1 |
20020181407 | Khullar et al. | Dec 2002 | A1 |
20050147024 | Jung et al. | Jul 2005 | A1 |
20050201268 | Aoki et al. | Sep 2005 | A1 |
20060013326 | Yoshida | Jan 2006 | A1 |
20060072692 | Gifford et al. | Apr 2006 | A1 |
20060133457 | Wang et al. | Jun 2006 | A1 |
20060209973 | Gorokhov et al. | Sep 2006 | A1 |
20060209979 | Sandell et al. | Sep 2006 | A1 |
20060291372 | Koo et al. | Dec 2006 | A1 |
20070133696 | Iancu et al. | Jun 2007 | A1 |
20070133699 | Roh et al. | Jun 2007 | A1 |
20070248151 | Kim et al. | Oct 2007 | A1 |
20070297522 | Baggen et al. | Dec 2007 | A1 |
20080144486 | Wilhelmsson et al. | Jun 2008 | A1 |
20080219343 | Wu et al. | Sep 2008 | A1 |
20080225934 | Mourad et al. | Sep 2008 | A1 |
20090052566 | Maltsev et al. | Feb 2009 | A1 |
20090103568 | Garba et al. | Apr 2009 | A1 |
20090154625 | Kwak et al. | Jun 2009 | A1 |
20090239494 | Park et al. | Sep 2009 | A1 |
20090279623 | Wu et al. | Nov 2009 | A1 |
20100027698 | Kim et al. | Feb 2010 | A1 |
20100098198 | Muralidhar et al. | Apr 2010 | A1 |
20100103877 | Wang et al. | Apr 2010 | A1 |
20100166118 | Mantravadi et al. | Jul 2010 | A1 |
20110149929 | Kleider et al. | Jun 2011 | A1 |
20110176626 | Liao et al. | Jul 2011 | A1 |
20110211630 | Nakahara et al. | Sep 2011 | A1 |
20120045008 | Karthik et al. | Feb 2012 | A1 |
20120114069 | Karthik et al. | May 2012 | A1 |
20120155425 | Budianu et al. | Jun 2012 | A1 |
20130235946 | Budianu et al. | Sep 2013 | A1 |
20130279627 | Wu et al. | Oct 2013 | A1 |
Number | Date | Country |
---|---|---|
101026606 | Aug 2007 | CN |
Entry |
---|
Steven M. Kay, “Fundamentals of Statistical Signal Processing—Estimation Theory”, Prentice Hall Signal Processing Series, 1993, vol. 1, Chapter 8, pp. 219-288. |
Steven M. Kay, “Fundamentals of Statistical Signal Processing—Estimation Theory”, Prentice Hall Signal Processing Series, 1993, vol. 1, Chapter 12, pp. 379-418. |
DVB Mobile TV—DVB-H—DVB-SH—DVB-IPDC, http://www.dvb-h.org/ p. 1. |
IEEE 802.11—Wikipedia, the free encyclopedia, http://en.wikipedia.org/wiki/IEEE—802.11, pp. 13. |
IEEE 802.16—Wikipedia, the free encyclopedia, http://en.wikipedia.org/wiki/IEEE—802.16, p. 1. |
3GPP Long Term Evolution—Wikipedia, the free encyclopedia, http://en.wikipedia.org/wiki/3GPP—Long—Term—Evolution, p. 1. |
IEEE 802.22 WRAN WG Home Page, IEEE 802.22 Working Group on Wireless Regional Area Networks Enabling Rural Broadband Wireless Access Using Cognitive Radio Technology in TV Whitespaces, http://www.ieee802.org/22/, pp. 2. |
Rocco Claudio Cannizzaro, Paolo Banelli, and Geert Leus, “Adaptive Channel Estimation for OFDM Systems with Doppler spread”, IEEE Signal Processing Advances in Wireless Communications, Jul. 2006, pp. 5. |
Karthik Muralidhar and Kwok Hung Li, “A Low-Complexity Kalman Approach for Channel Estimation in Doubly-Selective OFDM Systems”, IEEE Signal Processing Letters, vol. 16, No. 7, Jul. 2009, pp. 632-635. |
Karthik Muralidhar, Evelyn Kurniawati, Samsudin NG, “Further Results on the VSSO Kalman Channel Estimator for Doubly-Selective OFDM Systems”, pp. 4. |
Osvaldo Simeone, Yeheskel Bar-Ness, and Umberto Spagnolini, “Pilot-Based Channel Estimation for OFDM Systems by Tracking the Delay-Subspace”, IEEE Transactions on Wireless Communications, vol. 3, No. 1, Jan. 2004, pp. 315-325. |
Zijian Tang, Rocco Claudio Cannizzaro, Geert Leus, and Paolo Banelli, “Pilot-Assisted Time-Varying Channel Estimation for OFDM Systems”, IEEE Transactions on Signal Processing, vol. 55, No. 5, May 2007, pp. 2226-2238. |
M. R. Raghavendra, S. Bhashyam, and K. Giridhar, “Exploiting Hopping Pilots for Parametric Channel Estimation in OFDM Systems”, IEEE Signal Processing Letters, vol. 12, No. 11, Nov. 2005, pp. 737-740. |
Baoguo Yang, Khaled Ben Letaief, Roger S. Cheng, and Zhigang Cao, “Channel Estimation for OFDM Transmission in Multipath Fading Channels Based on Parametric Channel Modeling”, IEEE Transactions on Communications, vol. 49, No. 3, Mar. 2001, pp. 467-479. |
Karkarthik Muralidhar, Li Kwok Hung and Ying Chang Liang, “Low-Complexity Equalisation Methods for OFDM Systems in doubly Selective Channels”, Vehicular Technology Conference, 2008. VCT Spring 2008. IEEE, May 11-14, 2008, Singapore, pp. 683-687. |
S. M. Kay, “Fundamentals of Statistical signal processing: Estimation Theory,” vol. 1, Prentice Hall: New Jersey, 1993, pp. 6. |
Proakis, “Digital Communications,” McGraw Hill, 1995, pp. 4. |
Xiaodong Cai and Georgios B. Giannakis, “Bounding Performance and Suppressing Intercarrier Interference in Wireless Mobile OFDM”, IEEE Transactions on Communications, vol. 51, No. 12, Dec. 2003, pp. 2047-2056. |
Paolo Banelli, Rocco Claudio Cannizzaro, and Luca Rugini, “Data-Aided Kalman Tracking for Channel Estimation in Doppler-Affected OFDM Systems”, ICASSP 2007, IEEE 2007, pp. 133-136. |
Hongmei Wang, Xiang Chen, Shidong Zhou, Ming Zhao, and Yan Yao, “Letter—Low-Complexity ICI Cancellation in Frequency Domain for OFDM Systems in Time-Varying Multipath Channels”, IEICE Trans. Commun., vol. E89-B, No. 3, Mar. 2006, pp. 1020-1023. |
U.S. Appl. No. 12/579,935, entitled: “Recovery of Data From a Multi Carrier Signal”, filed Oct. 15, 2009, pp. 52. |
U.S. Appl. No. 12/579,969, entitled: “Recovery of Data From a Multi Carrier Signal”, filed Oct. 15, 2009, pp. 55. |
Karthik Muralidhar and D. Sreedhar, “Pilot Design for Vector State-Scalar Observation Kalman Channel Estimators in Doubly-Selective MIMO-OFDM Systems”, IEEE Wireless Communications Letters, vol. 2, No. 2, Apr. 2013, 4 pages. |
DVB Mobile TV—DVB-H—DVB-SH—DVB-IPDC, http://www.dvb-h.org/ p. 1: Retrieved From Internet Feb. 9, 2011. |
IEEE 802.11—Wikipedia, the free encyclopedia, http://en.wikipedia.org/wiki/IEEE—802.11, pp. 13: Retrieved From Internet Feb. 9, 2011. |
IEEE 802.16—Wikipedia, the free encyclopedia, http://en.wikipedia.org/wiki/IEEE—802.16, p. 1: Retrieved From Internet Feb. 9, 2011. |
3GPP Long Term Evolution—Wikipedia, the free encyclopedia, http://en.wikipedia.org/ wiki/3GPP Long—Term—Evolution, p. 1: Retrieved From Internet Feb. 9, 2011. |
IEEE 802.22 WRAN WG Home Page, IEEE 802.22 Working Group on Wireless Regional Area Networks 5 Enabling Rural Broadband Wireless Access Using Cognitive Radio Technology in TV Whitespaces, http://www. D ieee802.org/22/, pp. 2: Retrieved From Internet Feb. 9, 2011. |
Number | Date | Country | |
---|---|---|---|
20110129024 A1 | Jun 2011 | US |
Number | Date | Country | |
---|---|---|---|
61105704 | Oct 2008 | US | |
61158290 | Mar 2009 | US | |
61267667 | Dec 2009 | US | |
61360367 | Jun 2010 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 12579935 | Oct 2009 | US |
Child | 12963569 | US | |
Parent | 12579969 | Oct 2009 | US |
Child | 12579935 | US |