A Sphere-Packing Exponent Approximation

The sphere-packing bound represents a suitable tool for assessing the limiting performance of a digital communication system. In fact, most of the modern transmission techniques, adopting capacity approaching codes, such as turbo codes, or Low Density Parity Check (LDPC) codes, may offer a performance that is within 1 dB from the bound, both for Additive White Gaussian Noise (AWGN) and for the fading channel. Unfortunately, the sphere-packing exponent may be difficult to compute, and this may prevent its adoption as a performance estimator. This paper presents and discusses the accuracy of an approximate expression of the bound, that may be used for evaluating the achievable performance of a communication system, without resorting to cumbersome simulations.

[1]  Gottfried Ungerboeck,et al.  Channel coding with multilevel/phase signals , 1982, IEEE Trans. Inf. Theory.

[2]  Alain Glavieux,et al.  Reflections on the Prize Paper : "Near optimum error-correcting coding and decoding: turbo codes" , 1998 .

[3]  Sergio Benedetto,et al.  Design of parallel concatenated convolutional codes , 1996, IEEE Trans. Commun..

[4]  Daniel J. Costello,et al.  On the frame-error rate of concatenated turbo codes , 2001, IEEE Transactions on Communications.

[5]  Dariush Divsalar,et al.  Code Performance as a Function of Block Size , 1998 .

[6]  R. Gallager.  Information Theory and Reliable Communication , 1968 .

[7]  Fulvio Babich.  On the performance of efficient coding techniques over fading channels , 2004, IEEE Transactions on Wireless Communications.

[8]  Fulvio Babich,et al.  Design of Adaptive Systems for the Fading Channel Adopting Efficient Coded Modulations , 2006, 2006 IEEE International Conference on Communications.

[9]  A. Glavieux,et al.  Turbo-codes and high spectral efficiency modulation , 1994, Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications.

[10]  Fulvio Babich,et al.  Cooperative Coding Schemes: Design and Performance Evaluation , 2012, IEEE Transactions on Wireless Communications.

[11]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[12]  Marc P. C. Fossorier,et al.  Sphere-packing bounds revisited for moderate block lengths , 2004, IEEE Transactions on Information Theory.

[13]  George N. Karystinos,et al.  Binary Transmissions over Additive Gaussian Noise : A Closed-Form Expression for the Channel Capacity 1 , 2005 .

[14]  Marco Chiani,et al.  Turbo Codes Based on Time-Variant Memory-1 Convolutional Codes over Fq , 2011, 2011 IEEE International Conference on Communications (ICC).

[15]  Fulvio Babich,et al.  A novel SIR-based access scheme for multi-packet communication in 802.11 networks , 2012, 2012 IEEE International Conference on Communications (ICC).

[16]  Dariush Divsalar,et al.  Turbo code performance as a function of code block size , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[17]  Igal Sason,et al.  An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels , 2006, IEEE Transactions on Information Theory.

[18]  Christian Schlegel,et al.  On error bounds and turbo-codes , 1999, IEEE Communications Letters.

[19]  Roberto Garello,et al.  MHOMS: high-speed ACM modem for satellite applications , 2005, IEEE Wireless Communications.

[20]  Andrew J. Viterbi,et al.  Principles of Digital Communication and Coding , 1979 .

[21]  Joachim Hagenauer,et al.  Rate-compatible punctured convolutional codes (RCPC codes) and their applications , 1988, IEEE Trans. Commun..