a and 8b are graphs of simulation results for a receiver in accordance with an embodiment, showing channel estimation error versus subcarrier for joint channel estimation of four signals using a single OFDM symbol of a pilot.
a is a graph of simulation results for prior receivers showing Frame Error Rate versus Signal to Noise Ratio per 16-QAM symbol.
b is a graph of simulation results for a receiver in accordance with an embodiment, showing Frame Error Rate versus Signal to Noise Ratio per 16-QAM symbol.
a is a graph of simulation results for a prior receiver, showing Frame Error Rate versus Signal to Noise Ratio per 64-QAM symbol.
b is a graph of simulation results for a receiver in accordance with an embodiment, showing Frame Error Rate versus Signal to Noise Ratio per 64-QAM symbol.
A method and apparatus which provides channel decoder input generation for various antenna combining techniques while accounting for channel estimation error is provided herein.
In some embodiments, channel decoder inputs will be Log-Likelihood Ratios (LLRs) which may be considered generally to be a codeword component, the codeword being an encoded message encoded on a transmitting side, and a noise component.
In the various embodiments herein disclosed, LLR calculation may be performed for arbitrary channel estimators with linear MMSE combining, successive cancellation combining, and joint detection. Further, in some embodiments, computational complexity may be greatly reduced by the use of channel estimation other than the full MMSE channel estimator. In additional embodiments, the use of linear MMSE or successive cancellation combining may be employed to greatly lower the computational complexity over joint detection. In yet other embodiments, the use of approximate maximum likelihood methods such as sphere decoding may be employed to greatly lower the computational complexity over joint detection.
It will be appreciated that LLR calculation, channel estimation and otherwise processing received signals may be performed in a dedicated device such as a receiver having a dedicated processor, a processor coupled to an analog processing circuit or receiver analog “front-end” with appropriate software for performing a receiver function, an application specific integrated circuit (ASIC), a digital signal processor (DSP), or the like, or various combinations thereof, as would be appreciated by one of ordinary skill. Memory devices may further be provisioned with routines and algorithms for operating on input data and providing output such as operating parameters to improve the performance of other processing blocks associated with, for example, reducing noise and interference, and otherwise appropriately handling the input data.
It will further be appreciated that wireless communications units may refer to subscriber devices such as cellular or mobile phones, two-way radios, messaging devices, personal digital assistants, personal assignment pads, personal computers equipped for wireless operation, a cellular handset or device, or the like, or equivalents thereof provided such units are arranged and constructed for operation in accordance with the various inventive concepts and principles embodied in exemplary receivers, and methods for generating or determining channel decoder inputs including, but not limited to LLRs, channel estimation, and accounting for channel estimation error as discussed and described herein.
The inventive functionality and inventive principles herein disclosed are best implemented with or in software or firmware programs or instructions and integrated circuits (ICs) such as digital signal processors (DSPs) or application specific ICs (ASICs) as is well known by those of ordinary skill in the art. Therefore, further discussion of such software, firmware and ICs, if any, will be limited to the essentials with respect to the principles and concepts used by the various embodiments.
Turning now to the drawings wherein like numerals represent like components,
For example, transmitter unit 103 and transmitter unit 110 may transmit data stream 106 and data stream 111 respectively, which may be received by receiver 101 simultaneously using multiple antennas 109. The SDMA network approach increases the aggregate data throughput nearly proportionally to the number of antennas at the receiver. In the various embodiments, LLRs are determined for each transmitter, such as transmitter 103 and transmitter 110, transmitting on the same time-frequency resource or channel. Thus, in the various embodiments receiver 101 will have receiver components 107, comprising receiving components appropriate for, and corresponding to the multiple antennas 109. Also in the various embodiments, receiver 101 will have components 108 which comprises a channel estimation component, an LLR calculation component, a channel decoding component and a storage component.
Further network 100 and network 200, may employ any of various modulation and coding schemes for the air interfaces between transmitters and receivers. For example, Quadrature Amplitude Modulation (QAM) may be employed including, but not limited to, 16-QAM, 64-QAM, etc. Additionally, various approaches to channelization of signals and/or subcarriers may be employed, such as but not limited to, Code Division Multiple Access (CDMA), Time Division Multiple Access (TDMA), etc. Further, such approaches may be used in combination with each other and/or other techniques such as Orthogonal Frequency Division Multiplexing (OFDM) such that various sub-carriers employ various channelization techniques. The air interfaces may also conform to various interfaces such as, but not limited to, 802.11, 802.16, etc.
The high level operation of the receiver of
LLR generation with channel estimation error for embodiments employing linear MMSE combining is illustrated at a high level by
The received M×1 signal, or input signal, on subcarrier k and symbol b, Y(k,b), is modeled as:
where Hu(k,b) is signal u's M×1 channel vector on subcarrier k and symbol b, xu(k,b) is signal u's symbol on subcarrier k and symbol b, and N(k,b) is an M×1 vector of additive noise with correlation matrix σn2I.
Because there is a channel estimate, the model of the received signal that will be used to calculate the LLRs is given as:
where Ĥu(k, b) is the channel estimate for signal u, as shown in block 505. Note that the combining weights assume the channel estimate is correct so that the received signal looks like the original one given in Equation (1) with an additional “noise” term that accounts for the channel estimation error.
The linear MMSE combining weights, as determined in block 507, are a function of the channel estimates from block 505 and are given for signal u as:
Defining Eu(k,b)=Hu(k,b)−Ĥu(k,b) and using Equation (2) the symbol estimate for signal u, as computed in block 509, is given as:
To compute the LLRs as in block 511, Eu(k,b) is assumed to be a zero-mean Gaussian random vector with correlation matrix, δu2(k,b)IM (i.e., δu2(k,b) is the channel estimation MSE for signal u on subcarrier k and symbol b, the MSE being stored as shown in storage unit 311 of
r
u(k,b)=wuH(k,b)Ĥu(k,b)xu(k,b)+nu(k,b) (5)
where ny(k,b) is modeled as a zero-mean Gaussian random variable with variance given by:
Note that this variance accounts for the residual cross talk after applying the weights as well as the channel estimation error from storage unit 311 and as shown in block 509. Note also that the variance depends on the magnitude of signal u's symbol but not on the amplitude of the other signals' symbols because the received symbol estimate for user u is conditioned on xu(k,b) and thus xv(k,b)'s for v≠u are treated as random variables.
The probability density function (pdf) of ru(k,b) given xu(k,b) is then given by:
where C is a constant that is not important for the LLR computation. Using Equation (7), the LLR for bit l for user u on subcarrier k and symbol b, LLR{bu,l(k,b)}, is found as shown in block 511 as (assuming equal-probable symbol values):
where Ωl1 is the set of symbols where bit l of symbol xu(k,b) equals plus one and Ωl is the set of symbols where bit l of symbol xu(k,b) equals minus one (or zero).
If the link is cyclic-prefix single carrier then the received time-domain signal is the IFFT of the frequency-domain symbol estimates in Equation (5) (spread-OFDM will also have similar modifications with, for example, the IFFT operation being replaced by Walsh de-spreading). Thus the time-domain symbol estimates are modeled as (assuming that the combining weights are unbiased):
ŝ
u(n,b)=su(n,b)+vu(n,b) (9)
where su(0,b) through sy(Nf-1,b) are the Nf-point IFFT of the frequency-domain symbols (0≦k≦Nf-1), xu(k,b), and vu(n,b) is the IFFT of nu(k,b) for 0≦k≦Nf-1.
The IFFT operation on nu(k,b) will equalize the channel estimation error across all time-domain symbols (i.e., all symbol estimates will have similar quality unlike the frequency-domain symbols where the symbol estimates at edge sub-carriers can be significantly worse than symbol estimates at non-edge sub-carriers). This means that vu(n,b) is modeled as a zero-mean Gaussian random variable with variance given by (using Parseval's theorem):
LLR generation with channel estimation error, for embodiments employing successive cancellation, is illustrated at a high level by
In the various embodiments employing successive cancellation, Ns received signals are decoded in some order and a signal is decoded, re-encoded, and mapped back to symbol values before being cancelled using the channel estimate for that signal. The decoding order may in some embodiments be chosen to pick the stream with the best average post-detection SINR (Signal to Interference plus Noise Ratio) at each iteration or can be decoded in order in embodiments employing techniques such as weighted-BLAST or MCR-selection BLAST. Thus, the decoding order is determined as illustrated in block 607.
Assuming that the decoding order determined in block 607 is u1 through uN
Wherein it is assumed that each signal is decoded without errors so that the symbol estimate for signal un which will be determined as shown in block 613, may be expressed as:
However, unlike the linear MMSE embodiments as illustrated in
Therefore, to calculate the LLRs as shown in block 615 of
r
u
(k,b)=wu
where nu
The Probability Density Function (pdf) of rn
where C is constant that is not important for the LLR computation. Using Equation (15), the LLR for bit l for user un on subcarrier k and symbol b, LLR{bu
LLR generation with channel estimation error, for embodiments employing joint detection, is illustrated at a high level by
In the various embodiments employing joint detection, similar to Equation (2) the received signal, or input signal at antennas 301 and 303, is modeled as:
where Eu(k,b) models the channel estimation error for signal u, as shown in block 701, and is assumed to be a zero-mean Gaussian random vector with correlation matrix δu2(k,b)IM. The pdf of Y(k,b) given x1(k,b) through XN
where C is a constant that will not be important in the LLR calculation.
As shown in block 709 and using Equation (18), the LLR for bit l of user u at subcarrier k and symbol b is given as:
where Ω is the set of possible symbols values, which may be for example in some embodiments, all sixteen 16-QAM constellation points, Ωl+ is the set of symbols where bit l on symbol xu(k,b) equals plus one, and Ωl is the set of symbols where bit l on symbol xu(k,b) equals minus one (or zero). Since in equation (19) the summation over all possible symbols values (i.e., all symbol values in Ω, Ωl+, or Ωl−) may have excessively high computational complexity, methods with lower complexity but nearly the same performance may be employed such as sphere decoding.
In sphere decoding, certain symbol values are removed from the set of all symbol values because it is determined that it was very improbable that they were sent from the transmitters. Thus the LLR calculation for sphere decoding would use a similar formula to equation (19) except that the summations would be done only over the likely symbol values (i.e., not over the symbol values that were determined to be sent with very low probability). In other words, instead of using the set of all possible data symbol combinations to determine the LLRs, a set of possible data symbol combinations is determined (e.g., using sphere decoding ideas) for each transmitter and the set of possible data symbol combinations is used to determine the LLRs in place of the set of all possible data symbol combinations.
In order to calculate the LLRs given in Equations (8), (16) and (19), that is, for any of the various embodiments, for example as shown in blocks 407, 511, 615 and 709, the channel estimation error for each signal at each subcarrier and symbol time is needed. For linear frequency domain channel estimators such as an MMSE channel estimator, including an MMSE Finite Impulse Response (FIR) channel estimator, a time-tap Least Squares (LS) channel estimator, and Discrete Fourier Transformation (DFT) type channel estimators, the channel estimation error is readily found in the various embodiments. Further in the various embodiments, by using the expected channel conditions, the channel estimation error may be anticipated and thus may be pre-computed and stored in memory at the receiver, for example storage unit 311 of
Therefore, in the various embodiments, the channel estimator is assumed to have the following form:
Ĥ
u,m(k,b)=quH(k,b)Yp,m (20)
where qu(k,b) is a P×1 vector of channel estimation coefficients (P is the number of pilot symbols) for signal u at subcarrier k and symbol time b and Yp,m is the following P×1 vector of the received pilot data on antenna m for example, antenna 301:
where {k1,b1} through {kP,bP} are the pilot locations and
δu2(k,b)=E{|Hu,m(k,b)−Ĥu,m(k,b)|2} (22)
Using Equations (20), (21) and (22), the channel estimation error becomes:
Simplifying Equation (23), the channel estimation error becomes:
where Re{a} means the real part of a, r(k−f,b−t)=E{Hm(k,b)Hm*(f,t)}, and P×P R is given by:
To further facilitate the understanding of the various embodiments disclosed herein, examples of the expected channel estimation error are provided in
x
u(k,b)=x1(k,b)e−j2π(u−1)k/4 (26)
All channel estimates are designed assuming each user's delay profile was a 10 μsec flat profile. For the simulation results, each SDMA user's channel uses a COST-259-style spatial channel model consisting of a single scattering zone having 50 discrete multi-path rays and a 2 μsec RMS delay spread. The SNR was 10 dB for both the theoretical results and simulations. The channel estimation strategies compared are the MMSE FIR channel estimation with a 17 tap filter, the MMSE channel estimator as described in Vook and Thomas, MMSE Multi-User Channel Estimation for Broadband Wireless Communications, IEEE Globecom-2001 in San Antonio Tex. (November 2001), which is incorporated by reference herein, a Least Squares (LS) time-tap estimator with an FFT size of 800, and a DFT-based channel estimator (labeled “FFT” estimator).
a and 8b compare the theoretical channel estimation error using Equation (24) to simulation results. Thus
a and 10a provide simulation results without the various embodiments and for comparison,
In examples illustrated by
For the simulations, the 3GPP turbo code with max-log-map decoding was used. There are four SDMA users and the pilot format consists of a single OFDM symbol with the pilot structure as per Equation (26). One-thousand (1000) channel realizations were run for each SNR point and there are ten data frames (separately coded) following the pilot sequence. The FER curves are averaged over all SDMA users.
a,
9
b,
10
a and 10b show FER results for rate ½ turbo-coded 16-QAM and rate ½ turbo-coded 64-QAM respectively for three channel estimators; MMSE, Least Squares (LS) time-tap estimator, and a DFT-based estimator. All three estimators assume a flat delay profile with a maximum delay spread of 10 μs. The receiver simulated employed successive cancellation with the optimal stream decoding order. For the successive cancellation operation, before a stream is cancelled it is first decoded, then re-encoded, and mapped back to symbol values. A clear improvement is illustrated in
It is to be understood that the various embodiments and inventive principles and concepts discussed and described herein may be particularly applicable to receivers and associated communication units, devices, and systems providing or facilitating voice communications services or data or messaging services over wide area networks (WANs), such as conventional two way systems and devices, various cellular phone systems including, but not limited to, analog and digital cellular, and any networks employing Spatial Division Multiple Access (SDMA), Spatial Division Multiplexing (SDM), Orthogonal Frequency Division Multiple Access (OFDMA), Orthogonal Frequency Division Multiplexing (OFDM) and any variants thereof.
Principles and concepts described herein may further be applied in devices or systems with short range communications capability normally referred to as W-LAN capabilities, such as IEEE 802.11, Hiper-LAN or 802.16, WiMAX, digital video broadcasting (DVB), and the like that may further utilize CDMA, frequency hopping, orthogonal frequency division multiplexing, or TDMA technologies and one or more of various networking protocols, such as TCP/IP (Transmission Control Protocol/Internet Protocol), IPX/SPX (Inter-Packet Exchange/Sequential Packet Exchange), Net BIOS (Network Basic Input Output System) or other protocol structures.
While the preferred embodiments of the invention have been illustrated and described, it is to be understood that the invention is not so limited. Numerous modifications, changes, variations, substitutions and equivalents will occur to those skilled in the art without departing from the spirit and scope of the present invention as defined by the appended claims.