A Study on Universal Codes With Finite Block Lengths

Based on random codes and typical set decoding, an alternative proof of Root and Varaiya's compound channel coding theorem for linear Gaussian channels is presented. The performance limit of codes with finite block length under a compound channel is studied through error bounds and simulation. Although the theorem promises uniform convergence of the probability of error as the block length approaches infinity, with short block lengths the performance can differ considerably for individual channels. Simulation results show that universal performance can be a practical goal as the block lengths become large.

[1]  C. Shannon.  Probability of error for optimal codes in a Gaussian channel , 1959 .

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

[3]  Richard D. Wesel,et al.  Construction of short block length irregular low-density parity-check codes , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[4]  P. P. Varaiya,et al.  Capacity of classes of Gaussian channels. Part I - Discrete-time , 1967 .

[5]  J. Kim,et al.  Girth conditioning for construction of short block length irregular LDPC codes , 2004 .

[6]  Sergio Verdú,et al.  Spectral efficiency in the wideband regime , 2002, IEEE Trans. Inf. Theory.

[7]  Rick S. Blum,et al.  Improved space-time convolutional codes for quasi-static slow fading channels , 2002, IEEE Trans. Wirel. Commun..

[8]  Surrogate-channel design of universal LDPC codes , 2006, IEEE Communications Letters.

[9]  Richard D. Wesel,et al.  Construction of irregular LDPC codes with low error floors , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[10]  Oliver M. Collins,et al.  A Comparison of Known Codes, Random Codes, and the Best Codes , 1998, IEEE Trans. Inf. Theory.

[11]  Richard D. Wesel,et al.  Universal space-time trellis codes , 2003, IEEE Trans. Inf. Theory.

[12]  P. Varaiya,et al.  Capacity of Classes of Gaussian Channels , 1968 .

[13]  Prakash Narayan,et al.  Reliable Communication Under Channel Uncertainty , 1998, IEEE Trans. Inf. Theory.

[14]  Richard D. Wesel,et al.  Universal trellis codes for diagonally layered space-time systems , 2003, IEEE Trans. Signal Process..

[15]  Richard D. Wesel,et al.  Selective avoidance of cycles in irregular LDPC code construction , 2004, IEEE Transactions on Communications.

[16]  D. Blackwell,et al.  The Capacity of a Class of Channels , 1959 .

[17]  Michael B. Pursley,et al.  Decoding strategies for turbo product codes in frequency-hop wireless communications , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[18]  Richard D. Wesel,et al.  The universality of LDPC codes on wireless channels , 2003, IEEE Military Communications Conference, 2003. MILCOM 2003..

[19]  Richard D. Wesel,et al.  Universal serially concatenated trellis coded modulation for space-time channels , 2008, IEEE Transactions on Communications.

[20]  Richard D. Wesel,et al.  Serially concatenated trellis coded modulation for the compound periodic erasures channel , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[21]  G. David Forney,et al.  Modulation and Coding for Linear Gaussian Channels , 1998, IEEE Trans. Inf. Theory.

[22]  Richard D. Wesel,et al.  Trellis codes for periodic erasures , 2000, IEEE Trans. Commun..