Irregular Trellis for the Near-Capacity Unary Error Correction Coding of Symbol Values From an Infinite Set

Irregular joint source and channel coding (JSCC) scheme is proposed, which we refer to as the irregular unary error correction (IrUEC) code. This code operates on the basis of a single irregular trellis, instead of employing a set of separate regular trellises, as in previous irregular trellis-based codes. Our irregular trellis is designed with consideration of the UEC free distance, which we characterize for the first time in this paper. We conceive the serial concatenation of the proposed IrUEC code with an irregular unity rate code (IrURC) code and propose a new EXtrinsic Information Transfer (EXIT) chart matching algorithm for parametrizing these codes. This facilitates the creation of a narrow EXIT tunnel at a low Eb/N0 value and provides near-capacity operation. Owing to this, our scheme is found to offer a low symbol error ratio (SER), which is within 0.4 dB of the discrete-input continuous-output memoryless channel (DCMC) capacity bound in a particular practical scenario, where gray-mapped quaternary phase shift keying (QPSK) modulation is employed for transmission over an uncorrelated narrowband Rayleigh-fading channel with an effective throughput of 0.508bits-1 Hz-1. Furthermore, the proposed IrUEC-IrURC scheme offers a SER performance gain of 0.8 dB, compared to the best of several regular and irregular separate source and channel coding (SSCC) benchmarkers, which is achieved without any increase in transmission energy, bandwidth, transmit duration, or decoding complexity.

[1]  Abraham Lempel,et al.  Compression of individual sequences via variable-rate coding , 1978, IEEE Trans. Inf. Theory.

[2]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[3]  Michael Tuchler,et al.  EXIT charts of irregular codes , 2002 .

[4]  Zhihai He,et al.  Lifetime and Distortion Optimization With Joint Source/Channel Rate Adaptation and Network Coding-Based Error Control in Wireless Video Sensor Networks , 2011, IEEE Transactions on Vehicular Technology.

[5]  Amadou Diallo,et al.  Efficient Computation and Optimization of the Free Distance of Variable-Length Finite-State Joint Source-Channel Codes , 2011, IEEE Transactions on Communications.

[6]  A. W. Kemp,et al.  Univariate Discrete Distributions , 1993 .

[7]  Stephan ten Brink,et al.  Convergence behavior of iteratively decoded parallel concatenated codes , 2001, IEEE Trans. Commun..

[8]  Lajos Hanzo,et al.  Spatio-Temporal Iterative Source–Channel Decoding Aided Video Transmission , 2013, IEEE Transactions on Vehicular Technology.

[9]  M. Tuchler,et al.  Design of serially concatenated systems depending on the block length , 2004, IEEE Transactions on Communications.

[10]  A. W. Kemp,et al.  Univariate Discrete Distributions , 1993 .

[11]  Lajos Hanzo,et al.  Ieee Transactions on Communications, Accepted for Publication 1 Near-capacity Joint Source and Channel Coding of Symbol Values from an Infinite Source Set Using Elias Gamma Error Correction Codes , 2022 .

[12]  Victor Buttigieg,et al.  On variable-length error-correcting codes , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[13]  Robert G. Maunder,et al.  A Low-Complexity Turbo Decoder Architecture for Energy-Efficient Wireless Sensor Networks , 2013, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[14]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[15]  Lajos Hanzo,et al.  A Unary Error Correction Code for the Near-Capacity Joint Source and Channel Coding of Symbol Values from an Infinite Set , 2013, IEEE Transactions on Communications.

[16]  Michael Tüchler,et al.  Design of Serially Concatenated Systems Depending on the Block Length , 2004, IEEE Trans. Commun..

[17]  Lie-Liang Yang,et al.  Near-Capacity Variable Length Coding , 2010 .

[18]  Sergio Benedetto,et al.  Iterative decoding of serially concatenated convolutional codes , 1996 .

[19]  Lajos Hanzo,et al.  Iterative Decoding Convergence and Termination of Serially Concatenated Codes , 2010, IEEE Transactions on Vehicular Technology.

[20]  Lajos Hanzo,et al.  Genetic Algorithm Aided Design of Component Codes for Irregular Variable Length Coding , 2009, IEEE Transactions on Communications.

[21]  Lajos Hanzo,et al.  On the complexity of Unary Error Correction codes for the near-capacity transmission of symbol values from an infinite set , 2013, 2013 IEEE Wireless Communications and Networking Conference (WCNC).

[22]  Jörg Kliewer,et al.  On the achievable extrinsic information of inner decoders in serial concatenation , 2006, 2006 IEEE International Symposium on Information Theory.

[23]  Yoichiro Takada.  ON THE MATHEMATICAL THEORY OF COMMUNICATION , 1954 .

[24]  A. Mertins,et al.  Iterative Source-Channel Decoding With Markov Random Field Source Models , 2006, IEEE Transactions on Signal Processing.

[25]  T. H. Liew,et al.  Turbo Coding, Turbo Equalisation and Space-Time Coding: EXIT-Chart-Aided Near-Capacity Designs for Wireless Channels , 2011 .

[26]  Jorma Rissanen,et al.  Fast adaptive arithmetic code for large alphabet sources with asymmetrical distributions , 2003, IEEE Communications Letters.

[27]  B. L. Yeap,et al.  Turbo Coding, Turbo Equalisation and Space-Time Coding , 2002 .

[28]  A. W. Kemp,et al.  Univariate Discrete Distributions: Johnson/Univariate Discrete Distributions , 2005 .

[29]  Pål K. Frenger,et al.  Convolutional codes with optimum distance spectrum , 1999, IEEE Communications Letters.

[30]  David Sankoff,et al.  Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison , 1983 .

[31]  Soon Xin Ng,et al.  Iterative AMR-WB Source and Channel Decoding Using Differential Space–Time Spreading-Assisted Sphere-Packing Modulation , 2009, IEEE Transactions on Vehicular Technology.

[32]  Peter Elias,et al.  Universal codeword sets and representations of the integers , 1975, IEEE Trans. Inf. Theory.

[33]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[34]  Hassan Farsi,et al.  Joint Source and Channel Coding for MPEG-4 using Steganography of Channel Coding Information , 2013 .

[35]  Lajos Hanzo,et al.  Near-capacity irregular variable length coding and irregular unity rate coding , 2009, IEEE Transactions on Wireless Communications.

[36]  Stephen B. Wicker,et al.  Turbo Coding , 1998 .

[37]  Patrick G. Farrell,et al.  Variable-length error-correcting codes , 2000 .

[38]  Dariush Divsalar,et al.  Coding theorems for 'turbo-like' codes , 1998 .

[39]  M. Wada,et al.  Reversible variable length codes , 1995, IEEE Trans. Commun..

[40]  G. Kramer,et al.  Code rate and the area under extrinsic information transfer curves , 2002, Proceedings IEEE International Symposium on Information Theory,.