On an Achievable Rate of Large Rayleigh Block-Fading MIMO Channels with No CSI
Keigo Takeuchi, Ralf R. Mueller, Mikko Vehkaperae, and Toshiyuki, Tanaka

TL;DR
This paper analyzes the achievable rates of large MIMO Rayleigh block-fading channels without CSI, showing that minimal pilot information suffices and that successive decoding can outperform traditional methods, especially at low-to-moderate SNRs.
Contribution
It provides new analytical formulas for achievable rates using the replica method, improving existing capacity bounds and highlighting the effectiveness of SD schemes without CSI.
Findings
Negligible pilot information maximizes achievable rates in large systems.
The derived bounds outperform previous lower bounds on capacity.
SD schemes offer significant gains in low-to-moderate SNR regimes.
Abstract
Training-based transmission over Rayleigh block-fading multiple-input multiple-output (MIMO) channels is investigated. As a training method a combination of a pilot-assisted scheme and a biased signaling scheme is considered. The achievable rates of successive decoding (SD) receivers based on the linear minimum mean-squared error (LMMSE) channel estimation are analyzed in the large-system limit, by using the replica method under the assumption of replica symmetry. It is shown that negligible pilot information is best in terms of the achievable rates of the SD receivers in the large-system limit. The obtained analytical formulas of the achievable rates can improve the existing lower bound on the capacity of the MIMO channel with no channel state information (CSI), derived by Hassibi and Hochwald, for all signal-to-noise ratios (SNRs). The comparison between the obtained bound and a high…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
