On the Evaluation of the Polyanskiy-Poor–Verdú Converse Bound for Finite Block-Length Coding in AWGN

@article{Erseghe2015OnTE,
  title={On the Evaluation of the Polyanskiy-Poor–Verd{\'u} Converse Bound for Finite Block-Length Coding in AWGN},
  author={Tomaso Erseghe},
  journal={IEEE Transactions on Information Theory},
  year={2015},
  volume={61},
  pages={6578-6590}
}
  • Tomaso Erseghe
  • Published 2015
  • Mathematics, Computer Science
  • IEEE Transactions on Information Theory
  • A tight converse bound to the channel coding rate in the finite block-length regime and under additive white Gaussian noise conditions was recently proposed by Polyanskiy-Poor-Verdú (PPV). The bound is a generalization of a number of other classical results, and it was also claimed to be equivalent to Shannon's 1959 cone packing bound. In this paper, we investigate methods for a reliable numerical evaluation of the bound, which is troublesome even for not too large values of the block-length n… CONTINUE READING
    Coding in the Finite-Blocklength Regime: Bounds Based on Laplace Integrals and Their Asymptotic Approximations
    43
    Deepcode: Feedback Codes via Deep Learning
    45
    A Unified Approach to Gaussian Channels with Finite Blocklength
    16
    Saddlepoint Approximations for Short-Packet Wireless Communications
    5
    Performance Evaluation of HARQ Schemes for the Internet of Things
    5

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 38 REFERENCES
    Finite-Dimensional Infinite Constellations
    38
    Saddle Point in the Minimax Converse for Channel Coding
    69
    An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels
    53
    On coding without restrictions for the AWGN channel
    255
    Design of capacity-approaching irregular low-density parity-check codes
    2972
    Channel coding: non-asymptotic fundamental limits
    195
    Channel Coding Rate in the Finite Blocklength Regime
    1586
    Moderate deviation analysis of channel coding: Discrete memoryless case
    53
    The third-order term in the normal approximation for the AWGN channel
    48