An achievable rate of large block-fading MIMO systems with no CSI via successive decoding

Müller R, Takeuchi K, Vehkaperä M, Tanaka T (2010)


Publication Language: English

Publication Status: Published

Publication Type: Conference contribution, Conference Contribution

Publication year: 2010

Pages Range: 519-524

Article Number: 5654367

Event location: Taichung, Taiwan TW

ISBN: 9781424460175

DOI: 10.1109/ISITA.2010.5654367

Abstract

A Rayleigh block-fading multiple-input multiple-output (MIMO) channel with channel state information (CSI) available neither to the transmitter nor to the receiver is considered. A lower bound on the capacity is formulated based on a successive decoding (SD) scheme. An analytical expression of the lower bound is derived in the large-system limit, by using the replica method. Furthermore, the achievable rate of the linear minimum mean-squared error (LMMSE) receiver with SD is also evaluated in the large-system limit. The lower bound is superior to the lower bound derived by Hassibi and Hochwald for all signal-to-noise ratios (SNRs). © 2010 IEEE.

Authors with CRIS profile

Involved external institutions

How to cite

APA:

Müller, R., Takeuchi, K., Vehkaperä, M., & Tanaka, T. (2010). An achievable rate of large block-fading MIMO systems with no CSI via successive decoding. In Proceedings of the 2010 20th International Symposium on Information Theory and Its Applications, ISITA 2010 and the 2010 20th International Symposium on Spread Spectrum Techniques and Applications, ISSSTA 2010 (pp. 519-524). Taichung, Taiwan, TW.

MLA:

Müller, Ralf, et al. "An achievable rate of large block-fading MIMO systems with no CSI via successive decoding." Proceedings of the 2010 20th International Symposium on Information Theory and Its Applications, ISITA 2010 and the 2010 20th International Symposium on Spread Spectrum Techniques and Applications, ISSSTA 2010, Taichung, Taiwan 2010. 519-524.

BibTeX: Download