Quasi-Static Multiple-Antenna Fading Channels at Finite Blocklength

Abstract

Abstract-This paper investigates the maximal achievable rate for a given blocklength and error probability over quasi-static multiple-input multiple-output (MIMO) fading channels, with and without channel state information (CSI) at the transmitter and/or the receiver. The principal finding is that outage capacity, despite being an asymptotic quantity, is a sharp proxy for the finiteblocklength fundamental limits of slow-fading channels. Specifically, the channel dispersion is shown to be zero regardless of whether the fading realizations are available at both transmitter and receiver, at only one of them, or at neither of them. These results follow from analytically tractable converse and achievability bounds. Numerical evaluation of these bounds verifies that zero dispersion may indeed imply fast convergence to the outage capacity as the blocklength increases. In the example of a particular 1×2 single-input multiple-output (SIMO) Rician fading channel, the blocklength required to achieve 90% of capacity is about an order of magnitude smaller compared to the blocklength required for an AWGN channel with the same capacity. For this specific scenario, the coding/decoding schemes adopted in the LTE-Advanced standard are benchmarked against the finite-blocklength achievability and converse bounds.

Ultrareliable Short-Packet Communications With Wireless Energy Transfer

“…Moreover, it is interesting to note that the approximation derived in (10) agrees very well with the numerical integration of (6), which is accurate for n > 100 for AWGN [9,Figs. 12 and 13] and fading channels [10].…”

“…1.1.2] along with the definition of x F y . Finally, in (c) we return to variable z, and substituting (12) into (11) we attain (10) given that lim…”

“…In the case of short packets, a more suitable metric is the maximum achievable rate at a given block length and error probability. This metric has been characterized in [9], [10] for both Additive White Gaussian Noise (AWGN) and fading channels. In addition, the authors of [11], [12] incorporate the cost of acquiring instantaneous channel state information (CSI) within a transmission deadline, and analyze the impact of a target error probability for different scenarios under a finite blocklength regime.…”

Delay Analysis for Wireless Fading Channels with Finite Blocklength Channel Coding

“…Most notably, Yang et. al [5] performed studies for finite blocklength coding in fading channels. They analyzed systems where the transmitter does not adapt the rate according to the instantaneous SNR of the channel and computed the maximum achievable rate for a certain error probability.…”

“…However, in this work we restrict the analysis to constant values 2 of the error probability . When the transmitter chooses a code with rate R * (n, ) according to (5), then the rate of this code depends on the SNR γi but the error probability of this code is always . Therefore, the error event Zi is also independent of γi, and the Mellin transform of g(γi, Zi) can be computed as…”