Finite-SNR Bounds on the Sum-Rate Capacity of Rayleigh Block-Fading Multiple-Access Channels With No A Priori CSI

Koch

Östman

et al. 2016

IEEE Trans. Commun.

Self Cite

193

164

Abstract-Motivated by the current interest in ultra-reliable, low-latency, machine-type communication systems, we investigate the tradeoff between reliability, throughput, and latency in the transmission of information over multiple-antenna Rayleigh blockfading channels. Specifically, we obtain finite-blocklength, finite-SNR upper and lower bounds on the maximum coding rate achievable over such channels for a given constraint on the packet error probability. Numerical evidence suggests that our bounds delimit tightly the maximum coding rate already for short blocklengths (packets of about 100 symbols). Furthermore, our bounds reveal the existence of a tradeoff between the rate gain obtainable by spreading each codeword over all available time-frequency-spatial degrees of freedom, and the rate loss caused by the need of estimating the fading coefficients over these degrees of freedom. In particular, our bounds allow us to determine the optimal number of transmit antennas and the optimal number of time-frequency diversity branches that maximize the rate. Finally, we show that infinite-blocklength performance metrics such as the ergodic capacity and the outage capacity yield inaccurate throughput estimates.

Section: Numerical Resultsmentioning

confidence: 97%

“…By tightening the high-SNR expansion (11) [14], [17], one obtains an accurate finite-SNR approximation of capacity [21], [33]. The input distribution that achieves the first two terms in the resulting high-SNR expansion of C erg (ρ) depends on the relationship between n c , m t and m r .…”

Section: Relation To Previous Resultsmentioning

confidence: 99%

Short-Packet Communications Over Multiple-Antenna Rayleigh-Fading Channels

Koch

Östman

et al. 2016

IEEE Trans. Commun.

Self Cite

193

164

“…Since the noise variance is normalized to one, we can think of ρ as the SNR. The sum-rate capacity (3) is, in general, not known in closed form, even in the infinite-precision case, for which tight bounds have been recently reported in [24].…”

Section: System Modelmentioning

confidence: 99%

One-bit massive MIMO: Channel estimation and high-order modulations

Jacobsson

2015 IEEE International Conference on Communication Workshop (ICCW)

Coldrey

et al. 2015

Self Cite

162

139

Abstract-We investigate the information-theoretic throughout achievable on a fading communication link when the receiver is equipped with one-bit analog-to-digital converters (ADCs). The analysis is conducted for the setting where neither the transmitter nor the receiver have a priori information on the realization of the fading channels. This means that channel-state information needs to be acquired at the receiver on the basis of the one-bit quantized channel outputs. We show that least-squares (LS) channel estimation combined with joint pilot and data processing is capacity achieving in the single-user, single-receive-antenna case.We also investigate the achievable uplink throughput in a massive multiple-input multiple-output system where each element of the antenna array at the receiver base-station feeds a one-bit ADC. We show that LS channel estimation and maximum-ratio combining are sufficient to support both multiuser operation and the use of high-order constellations. This holds in spite of the severe nonlinearity introduced by the one-bit ADCs.

“…The assumption of no a priori CSI at the receiver is of particular relevance for short-packet transmission because informationtheoretic analyses conducted under this assumption account automatically for the "cost" of acquiring CSI [9]- [11]. Bounds on R * for generic quasi-static multiple-antenna fading channels were reported in [12].…”

Section: Introductionmentioning

confidence: 99%

Finite-blocklength bounds on the maximum coding rate of rician fading channels with applications to pilot-assisted transmission

Östman

2017 IEEE 18th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

Ström

2017

Self Cite

Abstract-We present nonasymptotic bounds on the maximum coding rate achievable over a Rician block-fading channel for a fixed packet size and a fixed packet error probability. Our bounds, which apply to the scenario where no a priori channel state information is available at the receiver, allow one to quantify the tradeoff between the rate gains resulting from the exploitation of time-frequency diversity and the rate loss resulting from fast channel variations and pilot-symbol overhead.