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

Keigo Takeuchi; Ralf R. Müller; Mikko Vehkaperä; Toshiyuki Tanaka

doi:10.1109/ISITA.2010.5654367

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

Keigo Takeuchi, Ralf R. Müller, Mikko Vehkaperä, Toshiyuki Tanaka

Not published at VTT

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

1 Citation (Scopus)

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).

Original language	English
Title of host publication	2010 International Symposium on Information Theory and Its Applications
Publisher	IEEE Institute of Electrical and Electronic Engineers
Pages	519-524
ISBN (Electronic)	978-1-4244-6017-5
ISBN (Print)	978-1-4244-6016-8
DOIs	https://doi.org/10.1109/ISITA.2010.5654367
Publication status	Published - 1 Dec 2010
MoE publication type	A4 Article in a conference publication
Event	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, Province of China Duration: 17 Oct 2010 → 20 Oct 2010

Conference

Conference	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
Country	Taiwan, Province of China
City	Taichung
Period	17/10/10 → 20/10/10

Access to Document

10.1109/ISITA.2010.5654367

Fingerprint Dive into the research topics of 'An achievable rate of large block-fading MIMO systems with no CSI via successive decoding'. Together they form a unique fingerprint.

Cite this

@inproceedings{898f6ffbe994441ca97529948224b748,

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

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).",

author = "Keigo Takeuchi and M{\"u}ller, {Ralf R.} and Mikko Vehkaper{\"a} and Toshiyuki Tanaka",

year = "2010",

month = dec,

day = "1",

doi = "10.1109/ISITA.2010.5654367",

language = "English",

isbn = "978-1-4244-6016-8",

pages = "519--524",

booktitle = "2010 International Symposium on Information Theory and Its Applications",

publisher = "IEEE Institute of Electrical and Electronic Engineers",

address = "United States",

note = "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 ; Conference date: 17-10-2010 Through 20-10-2010",

}

Takeuchi, K, Müller, RR, Vehkaperä, M & Tanaka, T 2010, An achievable rate of large block-fading MIMO systems with no CSI via successive decoding. in 2010 International Symposium on Information Theory and Its Applications., 5654367, IEEE Institute of Electrical and Electronic Engineers, pp. 519-524, 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, Province of China, 17/10/10. https://doi.org/10.1109/ISITA.2010.5654367

An achievable rate of large block-fading MIMO systems with no CSI via successive decoding. / Takeuchi, Keigo; Müller, Ralf R.; Vehkaperä, Mikko; Tanaka, Toshiyuki.

2010 International Symposium on Information Theory and Its Applications. IEEE Institute of Electrical and Electronic Engineers, 2010. p. 519-524 5654367.

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

TY - GEN

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

AU - Takeuchi, Keigo

AU - Müller, Ralf R.

AU - Vehkaperä, Mikko

AU - Tanaka, Toshiyuki

PY - 2010/12/1

Y1 - 2010/12/1

N2 - 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).

AB - 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).

UR - http://www.scopus.com/inward/record.url?scp=78651265639&partnerID=8YFLogxK

U2 - 10.1109/ISITA.2010.5654367

DO - 10.1109/ISITA.2010.5654367

M3 - Conference article in proceedings

AN - SCOPUS:78651265639

SN - 978-1-4244-6016-8

SP - 519

EP - 524

BT - 2010 International Symposium on Information Theory and Its Applications

PB - IEEE Institute of Electrical and Electronic Engineers

T2 - 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

Y2 - 17 October 2010 through 20 October 2010

ER -

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

Abstract

Conference

Access to Document

Other files and links

Cite this