On Achievable Rates for MIMO Systems with Imperfect Channel State Information in the Finite Length Regime

Potter, Chris; Kosbar, Kurt; Panagos, Adam

doi:10.1109/tcomm.2013.053013.110004

Cited by 33 publications

(5 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Upper and lower bounds on the second-order coding rate of quasi-static MIMO Rayleigh-fading channels have been reported in [12] for the asymptotically ergodic setup when the number of antennas grows linearly with the blocklength. A lower bound on R * (n, ) for the imperfect CSI case has been developed in [13]. The second-order coding rate of single-antenna quasistatic fading channels for the case of perfect CSI and long-term power constraint has been derived in [14].…”

Section: Introductionmentioning

confidence: 99%

Quasi-Static Multiple-Antenna Fading Channels at Finite Blocklength

Yang

Durisi

Koch

et al. 2014

IEEE Trans. Inform. Theory

467

222

View full text Add to dashboard Cite

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.

show abstract

Section: Introductionmentioning

confidence: 99%

Quasi-Static Multiple-Antenna Fading Channels at Finite Blocklength

Yang

Durisi

Koch

et al. 2014

IEEE Trans. Inform. Theory

467

222

View full text Add to dashboard Cite

show abstract

“…Theorem 2 holds in the massive-antenna limit. 6 But for a finite number of receive antennas, the optimal shrinkage coefficient b may noticeably deviate from a, and its reduction in outage probability may be evident, as our numerical experiments suggest, in the next section.…”

Section: Massive-antenna Asymptotic Analysismentioning

confidence: 69%

“…Based on the generalized mutual information (GMI), the generalized outage probability has been defined and studied [4] [5], which characterizes the asymptotic outage behavior of the nearest neighbor decoding rule in the high signal-to-noise ratio (SNR) limit, for multiple-input multiple-output (MIMO) slow fading channels with imperfect CSI. 1 Performance analysis in the finite length regime under imperfect CSI has also been conducted in [6] [7].…”

Section: Introductionmentioning

confidence: 99%

Linear shrinkage receiver for slow fading channels under imperfect channel state information

Shi¹,

Pang²,

Zhang³

2022

Preprint

View full text Add to dashboard Cite

This paper studies receiver design in single-input multiple-output (SIMO) slow fading channels with imperfect channel state information (CSI) at the receiver only. Using generalized mutual information (GMI) as achievable rate, we study the outage behavior when the receiver employs certain generalized form of the nearest neighbor decoding rule. Our study reveals that linearly shrinking the linear minimum meansquared error (LMMSE) estimate of the CSI reduces the outage probability when the number of receive antennas is finite. Only in the asymptotic regime where the number of receive antennas grows without bound, the LMMSE estimate of the CSI minimizes the outage probability. Numerical results demonstrate that the proposed linear shrinkage receiver achieves evident outage probability reduction.

show abstract

“…Indeed, not even capacity is known in closed form in the ergodic setting. An attempt to analyze the scenario of imperfect CSI at the receiver for the case of multiple-input multiple-output (MIMO) Rayleigh blockfading channels was undertaken in [14]. The analysis, however, contains several inaccuracies.…”

Section: A Prior Artmentioning

confidence: 99%

Short Packets Over Block-Memoryless Fading Channels: Pilot-Assisted or Noncoherent Transmission?

Östman

Durisi

Ström

et al. 2019

IEEE Trans. Commun.

View full text Add to dashboard Cite

We present nonasymptotic upper and lower bounds on the maximum coding rate achievable when transmitting short packets over a Rician memoryless block-fading channel for a given requirement on the packet error probability. We focus on the practically relevant scenario in which there is no a priori channel state information available at the transmitter and at the receiver. An upper bound built upon the min-max converse is compared to two lower bounds: the first one relies on a noncoherent transmission strategy in which the fading channel is not estimated explicitly at the receiver; the second one employs pilot-assisted transmission (PAT) followed by maximum-likelihood channel estimation and scaled mismatched nearest-neighbor decoding at the receiver. Our bounds are tight enough to unveil the optimum number of diversity branches that a packet should span so that the energy per bit required to achieve a target packet error probability is minimized, for a given constraint on the code rate and the packet size. Furthermore, the bounds reveal that noncoherent transmission is more energy efficient than PAT, even when the number of pilot symbols and their power is optimized. For example, in Rayleigh fading, for the case when a coded packet of 168 symbols is transmitted using a channel code of rate 0.48 bits/channel use, over a block-fading channel with block size equal to 8 symbols, PAT requires an additional 1.2 dB of energy per information bit to achieve a packet error probability of 10 −3 compared to a suitably designed noncoherent transmission scheme. Finally, we devise a PAT scheme based on punctured tail-biting quasi-cyclic codes and ordered statistics decoding, whose performance is close (1 dB gap at 10 −3 packet error probability) to the ones predicted by our PAT lower bound. This shows that the PAT lower bound provides useful guidelines on the design of actual PAT schemes.

show abstract

On Achievable Rates for MIMO Systems with Imperfect Channel State Information in the Finite Length Regime

Cited by 33 publications

References 18 publications

Quasi-Static Multiple-Antenna Fading Channels at Finite Blocklength

Quasi-Static Multiple-Antenna Fading Channels at Finite Blocklength

Linear shrinkage receiver for slow fading channels under imperfect channel state information

Short Packets Over Block-Memoryless Fading Channels: Pilot-Assisted or Noncoherent Transmission?

Contact Info

Product

Resources

About