Channel state information




In wireless communications, channel state information (CSI) refers to known channel properties of a communication link. This information describes how a signal propagates from the transmitter to the receiver and represents the combined effect of, for example, scattering, fading, and power decay with distance. The method is called Channel estimation. The CSI makes it possible to adapt transmissions to current channel conditions, which is crucial for achieving reliable communication with high data rates in multiantenna systems.


CSI needs to be estimated at the receiver and usually quantized and fed back to the transmitter (although reverse-link estimation is possible in TDD systems). Therefore, the transmitter and receiver can have different CSI. The CSI at the transmitter and the CSI at the receiver are sometimes referred to as CSIT and CSIR, respectively.




Contents






  • 1 Different kinds of channel state information


  • 2 Mathematical description


    • 2.1 Instantaneous CSI


    • 2.2 Statistical CSI




  • 3 Estimation of CSI


    • 3.1 Least-square estimation


    • 3.2 MMSE estimation




  • 4 Data-aided versus blind estimation


  • 5 Weblinks


  • 6 References





Different kinds of channel state information


There are basically two levels of CSI, namely instantaneous CSI and statistical CSI.


Instantaneous CSI (or short-term CSI) means that the current channel conditions are known, which can be viewed as knowing the impulse response of a digital filter. This gives an opportunity to adapt the transmitted signal to the impulse response and thereby optimize the received signal for spatial multiplexing or to achieve low bit error rates.


Statistical CSI (or long-term CSI) means that a statistical characterization of the channel is known. This description can include, for example, the type of fading distribution, the average channel gain, the line-of-sight component, and the spatial correlation. As with instantaneous CSI, this information can be used for transmission optimization.


The CSI acquisition is practically limited by how fast the channel conditions are changing. In fast fading systems where channel conditions vary rapidly under the transmission of a single information symbol, only statistical CSI is reasonable. On the other hand, in slow fading systems instantaneous CSI can be estimated with reasonable accuracy and used for transmission adaptation for some time before being outdated.


In practical systems, the available CSI often lies in between these two levels; instantaneous CSI with some estimation/quantization error is combined with statistical information.



Mathematical description


In a narrowband flat-fading channel with multiple transmit and receive antennas (MIMO), the system is modeled as[1]


y=Hx+n{displaystyle mathbf {y} =mathbf {H} mathbf {x} +mathbf {n} }{mathbf  {y}}={mathbf  {H}}{mathbf  {x}}+{mathbf  {n}}

where y{displaystyle scriptstyle mathbf {y} }scriptstyle {mathbf  {y}} and x{displaystyle scriptstyle mathbf {x} }scriptstylemathbf{x} are the receive and transmit vectors, respectively, and H{displaystyle scriptstyle mathbf {H} }scriptstyle {mathbf  {H}} and n{displaystyle scriptstyle mathbf {n} }scriptstyle {mathbf  {n}} are the channel matrix and the noise vector, respectively. The noise is often modeled as circular symmetric complex normal with


n∼CN(0,S){displaystyle mathbf {n} sim {mathcal {CN}}(mathbf {0} ,,mathbf {S} )}{mathbf  {n}}sim {mathcal  {CN}}({mathbf  {0}},,{mathbf  {S}})

where the mean value is zero and the noise covariance matrix S{displaystyle scriptstyle mathbf {S} }scriptstyle {mathbf  {S}} is known.



Instantaneous CSI


Ideally, the channel matrix H{displaystyle scriptstyle mathbf {H} }scriptstyle {mathbf  {H}} is known perfectly. Due to channel estimation errors, the channel information can be represented as[2]


vec(Hestimate)∼CN(vec(H),Rerror){displaystyle {mbox{vec}}(mathbf {H} _{textrm {estimate}})sim {mathcal {CN}}({mbox{vec}}(mathbf {H} ),,mathbf {R} _{textrm {error}})}{mbox{vec}}({mathbf  {H}}_{{{textrm  {estimate}}}})sim {mathcal  {CN}}({mbox{vec}}({mathbf  {H}}),,{mathbf  {R}}_{{{textrm  {error}}}})

where Hestimate{displaystyle scriptstyle mathbf {H} _{textrm {estimate}}}scriptstyle {mathbf  {H}}_{{{textrm  {estimate}}}} is the channel estimate and Rerror{displaystyle scriptstyle mathbf {R} _{textrm {error}}}scriptstyle {mathbf  {R}}_{{{textrm  {error}}}} is the estimation error covariance matrix. The vectorization vec(){displaystyle {mbox{vec}}()}{mbox{vec}}() was used to achieve the column stacking of H{displaystyle scriptstyle mathbf {H} }scriptstyle {mathbf  {H}}, as multivariate random variables are usually defined as vectors.



Statistical CSI


In this case, the statistics of H{displaystyle scriptstyle mathbf {H} }scriptstyle {mathbf  {H}} are known. In a Rayleigh fading channel, this corresponds to knowing that[3]


vec(H)∼CN(0,R){displaystyle {mbox{vec}}(mathbf {H} )sim {mathcal {CN}}(mathbf {0} ,,mathbf {R} )}{mbox{vec}}({mathbf  {H}})sim {mathcal  {CN}}({mathbf  {0}},,{mathbf  {R}})

for some known channel covariance matrix R{displaystyle scriptstyle mathbf {R} }scriptstyle {mathbf  {R}}.



Estimation of CSI


Since the channel conditions vary, instantaneous CSI needs to be estimated on a short-term basis. A popular approach is so-called training sequence (or pilot sequence), where a known signal is transmitted and the channel matrix H{displaystyle scriptstyle mathbf {H} }scriptstyle {mathbf  {H}} is estimated using the combined knowledge of the transmitted and received signal.


Let the training sequence be denoted p1,…,pN{displaystyle mathbf {p} _{1},ldots ,mathbf {p} _{N}}{mathbf  {p}}_{1},ldots ,{mathbf  {p}}_{N}, where the vector pi{displaystyle mathbf {p} _{i}}{mathbf  {p}}_{i} is transmitted over the channel as


yi=Hpi+ni.{displaystyle mathbf {y} _{i}=mathbf {H} mathbf {p} _{i}+mathbf {n} _{i}.}{mathbf  {y}}_{i}={mathbf  {H}}{mathbf  {p}}_{i}+{mathbf  {n}}_{i}.

By combining the received training signals yi{displaystyle mathbf {y} _{i}}mathbf {y} _{i} for i=1,…,N{displaystyle i=1,ldots ,N}i=1,ldots ,N, the total training signalling becomes


Y=[y1,…,yN]=HP+N{displaystyle mathbf {Y} =[mathbf {y} _{1},ldots ,mathbf {y} _{N}]=mathbf {H} mathbf {P} +mathbf {N} }{mathbf  {Y}}=[{mathbf  {y}}_{1},ldots ,{mathbf  {y}}_{N}]={mathbf  {H}}{mathbf  {P}}+{mathbf  {N}}

with the training matrix P=[p1,…,pN]{displaystyle scriptstyle mathbf {P} =[mathbf {p} _{1},ldots ,mathbf {p} _{N}]}scriptstyle {mathbf  {P}}=[{mathbf  {p}}_{1},ldots ,{mathbf  {p}}_{N}] and the noise matrix N=[n1,…,nN]{displaystyle scriptstyle mathbf {N} =[mathbf {n} _{1},ldots ,mathbf {n} _{N}]}scriptstyle {mathbf  {N}}=[{mathbf  {n}}_{1},ldots ,{mathbf  {n}}_{N}].


With this notation, channel estimation means that H{displaystyle scriptstyle mathbf {H} }scriptstyle {mathbf  {H}} should be recovered from the knowledge of Y{displaystyle scriptstyle mathbf {Y} }scriptstyle {mathbf  {Y}} and P{displaystyle scriptstyle mathbf {P} }scriptstyle {mathbf  {P}}.



Least-square estimation


If the channel and noise distributions are unknown, then the least-square estimator (also known as the minimum-variance unbiased estimator) is[4]


HLS-estimate=YPH(PPH)−1{displaystyle mathbf {H} _{textrm {LS-estimate}}=mathbf {Y} mathbf {P} ^{H}(mathbf {P} mathbf {P} ^{H})^{-1}}{mathbf  {H}}_{{{textrm  {LS-estimate}}}}={mathbf  {Y}}{mathbf  {P}}^{H}({mathbf  {P}}{mathbf  {P}}^{H})^{{-1}}

where ()H{displaystyle ()^{H}}()^{H} denotes the conjugate transpose. The estimation Mean Square Error (MSE) is proportional to


tr(PPH)−1{displaystyle mathrm {tr} (mathbf {P} mathbf {P} ^{H})^{-1}}{mathrm  {tr}}({mathbf  {P}}{mathbf  {P}}^{H})^{{-1}}

where tr{displaystyle mathrm {tr} }mathrm{tr} denotes the trace. The error is minimized when PPH{displaystyle mathbf {P} mathbf {P} ^{H}}{mathbf  {P}}{mathbf  {P}}^{H} is a scaled identity matrix. This can only be achieved when N{displaystyle N}N is equal to (or larger than) the number of transmit antennas. The simplest example of an optimal training matrix is to select P{displaystyle scriptstyle mathbf {P} }scriptstyle {mathbf  {P}} as a (scaled) identity matrix of the same size that the number of transmit antennas.



MMSE estimation


If the channel and noise distributions are known, then this a priori information can be exploited to decrease the estimation error. This approach is known as Bayesian estimation and for Rayleigh fading channels it exploits that


vec(H)∼CN(0,R),vec(N)∼CN(0,S).{displaystyle {mbox{vec}}(mathbf {H} )sim {mathcal {CN}}(0,,mathbf {R} ),quad {mbox{vec}}(mathbf {N} )sim {mathcal {CN}}(0,,mathbf {S} ).}{mbox{vec}}({mathbf  {H}})sim {mathcal  {CN}}(0,,{mathbf  {R}}),quad {mbox{vec}}({mathbf  {N}})sim {mathcal  {CN}}(0,,{mathbf  {S}}).

The MMSE estimator is the Bayesian counterpart to the least-square estimator and becomes[2]


vec(HMMSE-estimate)=(R−1+(PT⊗I)HS−1(PT⊗I))−1(PT⊗I)HS−1vec(Y){displaystyle {mbox{vec}}(mathbf {H} _{textrm {MMSE-estimate}})=left(mathbf {R} ^{-1}+(mathbf {P} ^{T},otimes ,mathbf {I} )^{H}mathbf {S} ^{-1}(mathbf {P} ^{T},otimes ,mathbf {I} )right)^{-1}(mathbf {P} ^{T},otimes ,mathbf {I} )^{H}mathbf {S} ^{-1}{mbox{vec}}(mathbf {Y} )}{mbox{vec}}({mathbf  {H}}_{{{textrm  {MMSE-estimate}}}})=left({mathbf  {R}}^{{-1}}+({mathbf  {P}}^{T},otimes ,{mathbf  {I}})^{H}{mathbf  {S}}^{{-1}}({mathbf  {P}}^{T},otimes ,{mathbf  {I}})right)^{{-1}}({mathbf  {P}}^{T},otimes ,{mathbf  {I}})^{H}{mathbf  {S}}^{{-1}}{mbox{vec}}({mathbf  {Y}})

where {displaystyle otimes }otimes denotes the Kronecker product and the identity matrix I{displaystyle scriptstyle mathbf {I} }scriptstyle {mathbf  {I}} has the dimension of the number of receive antennas. The estimation Mean Square Error (MSE) is


tr(R−1+(PT⊗I)HS−1(PT⊗I))−1{displaystyle mathrm {tr} left(mathbf {R} ^{-1}+(mathbf {P} ^{T},otimes ,mathbf {I} )^{H}mathbf {S} ^{-1}(mathbf {P} ^{T},otimes ,mathbf {I} )right)^{-1}}{mathrm  {tr}}left({mathbf  {R}}^{{-1}}+({mathbf  {P}}^{T},otimes ,{mathbf  {I}})^{H}{mathbf  {S}}^{{-1}}({mathbf  {P}}^{T},otimes ,{mathbf  {I}})right)^{{-1}}

and is minimized by a training matrix P{displaystyle scriptstyle mathbf {P} }scriptstyle {mathbf  {P}} that in general can only be derived through numerical optimization. But there exist heuristic solutions with good performance based on waterfilling. As opposed to least-square estimation, the estimation error for spatially correlated channels can be minimized even if N{displaystyle N}N is smaller than the number of transmit antennas.[2] Thus, MMSE estimation can both decrease the estimation error and shorten the required training sequence. It needs however additionally the knowledge of the channel correlation matrix R{displaystyle scriptstyle mathbf {R} }scriptstyle {mathbf  {R}} and noise correlation matrix S{displaystyle scriptstyle mathbf {S} }scriptstyle {mathbf  {S}}. In absence of an accurate knowledge of these correlation matrices, robust choices need to be made to avoid MSE degradation.[5][6]



Data-aided versus blind estimation


In a data-aided approach, the channel estimation is based on some known data, which is known both at the transmitter and at the receiver, such as training sequences or pilot data.[7] In a blind approach, the estimation is based only on the received data, without any known transmitted sequence. The tradeoff is the accuracy versus the overhead. A data-aided approach requires more bandwidth or it has a higher overhead than a blind approach, but it can achieve a better channel estimation accuracy than a blind estimator.



Weblinks



  • Atheros CSI Tool

  • Linux 802.11n CSI Tool



References





  1. ^ A. Tulino, A. Lozano, S. Verdú, Impact of antenna correlation on the capacity of multiantenna channels, IEEE Transactions on Information Theory, vol 51, pp. 2491-2509, 2005.


  2. ^ abc E. Björnson, B. Ottersten, A Framework for Training-Based Estimation in Arbitrarily Correlated Rician MIMO Channels with Rician Disturbance, IEEE Transactions on Signal Processing, vol 58, pp. 1807-1820, 2010.


  3. ^ J. Kermoal, L. Schumacher, K.I. Pedersen, P. Mogensen, F. Frederiksen, A Stochastic MIMO Radio Channel Model With Experimental Validation Archived 2009-12-29 at the Wayback Machine, IEEE Journal on Selected Areas Communications, vol 20, pp. 1211-1226, 2002.


  4. ^ M. Biguesh and A. Gershman, Training-based MIMO channel estimation: a study of estimator tradeoffs and optimal training signals Archived March 6, 2009, at the Wayback Machine, IEEE Transactions on Signal Processing, vol 54, pp. 884-893, 2006.


  5. ^ Y. Li, L.J. Cimini, and N.R. Sollenberger, Robust channel estimation for OFDM systems with rapid dispersive fading channels, IEEE Transactions on Communications, vol 46, pp. 902-915, July 1998.


  6. ^ M. D. Nisar, W. Utschick and T. Hindelang, Maximally Robust 2-D Channel Estimation for OFDM Systems, IEEE Transactions on Signal Processing, vol 58, pp. 3163-3172, June 2010.


  7. ^ A. Zhuang, E.S. Lohan, and M. Renfors, "Comparison of decision-directed and pilot-aided algorithms for complex channel tap estimation in downlink WCDMA systems", in Proc. of 11th IEEE Personal and Indoor Mobile Radio Communications (PIMRC), vol. 2, Sept. 2000, p. 1121-1125.








這個網誌中的熱門文章

Tangent Lines Diagram Along Smooth Curve

Yusuf al-Mu'taman ibn Hud

Zucchini