Loading…
Techniques for MIMO Channel Covariance Matrix Quantization
In this correspondence, we develop techniques to efficiently quantize channel covariance matrices in multiple-input multiple-output (MIMO) Rayleigh fading environments. While these covariance matrices change less frequently than the channel matrices themselves, this information needs to be updated w...
Saved in:
Published in: | IEEE transactions on signal processing 2012-06, Vol.60 (6), p.3340-3345 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | In this correspondence, we develop techniques to efficiently quantize channel covariance matrices in multiple-input multiple-output (MIMO) Rayleigh fading environments. While these covariance matrices change less frequently than the channel matrices themselves, this information needs to be updated when it does change. Furthermore, these covariance matrices have significantly more parameters to quantize than their channel matrix counterparts. Since many applications focus on utilizing the strongest eigenmodes of the channel covariance matrix and since these matrices tend to be low-rank, we focus on efficiently quantizing the dominant eigenvectors of these matrices. We develop Lloyd-type algorithms based on training data from the environment to develop our codebooks. We also develop an algorithm based on the reduced-parameter Kronecker and Weichselberger models to generate codebooks with reduced real-time codeword search. |
---|---|
ISSN: | 1053-587X 1941-0476 |
DOI: | 10.1109/TSP.2012.2190727 |