Near-Capacity Joint Source and Channel Coding of Symbol Values from an Infinite Source Set Using Elias Gamma Error Correction Codes

Wang, Tao; Zhang, Wenbo; Maunder, Robert G.; Hanzo, Lajos

doi:10.1109/tcomm.2013.120213.130301

Cited by 10 publications

(8 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Alternatively, the zeta distribution may be parameterized by p 1 = Pr(X i = 1) = 1/ζ(s), which is the occurrence probability of the most frequently encountered symbols, namely those having a value of 1. More p 1 values have been investigated in [13]. In the situation, where the symbols obey the zeta distribution of (1), the symbol entropy is given by…”

Section: A Transmittermentioning

confidence: 99%

“…Note that for p 1 ≤ 0.608, our Elias Gamma Error Correction (EGEC) code of [13] may be employed in order to achieve a finite average codeword length. In the scenario, where p 1 = 0.797, an average codeword length of l = 1.54 results.…”

Section: A Transmittermentioning

confidence: 99%

“…1. Note that higher-order modulation schemes may be readily employed, although this would require the iterative exchange of extrinsic information between the demodulator and the URC decoders, in order to avoid capacity loss [13]. Our future work will consider adaptive iterative decoding techniques for this four-stage concatenation.…”

Section: B Receivermentioning

confidence: 99%

See 2 more Smart Citations

Adaptive Iterative Decoding for Expediting the Convergence of Unary Error Correction Codes

Zhang

Jia

Meng

et al. 2015

IEEE Trans. Veh. Technol.

Self Cite

View full text Add to dashboard Cite

Abstract-Multimedia encoders typically generate symbols having a wide range of legitimate values. In practical mobile wireless scenarios, the transmission of these symbols is required to be bandwidth efficient and error resilient, motivating both source coding and channel coding. However, Separate Source and Channel Coding (SSCC) schemes are typically unable to exploit the residual redundancy in the source symbols, which cannot be totally reduced by finite-delay, finite-complexity schemes, hence resulting in a capacity loss. Until recently, none of the existing Joint Source and Channel Codes (JSCCs) were suitable for this application, since their decoding complexity increases rapidly with the size of the symbol alphabet. Motivated by this, we proposed a novel JSCC referred to as the Unary Error Correction (UEC) code, which is capable of exploiting all residual redundancy and eliminating any capacity loss, while imposing only a moderate decoding complexity. In this paper, we show that the operation of the UEC decoder can be dynamically adapted, in order to strike an attractive trade-off between its decoding complexity and its error correction capability. Furthermore, we conceive the corresponding Three Dimensional (3D) EXtrinsic Information Transfer (EXIT) charts for controlling this dynamic adaptation, as well as the decoder activation order, when the UEC code is serially concatenated with a turbo code. In this way, we expedite the iterative decoding convergence, facilitating a gain of up to 1.2 dB compared to both SSCC and to its non-adaptive UEC benchmarkers, while maintaining the same transmission bandwidth, duration, energy and decoding complexity.

show abstract

Section: A Transmittermentioning

confidence: 99%

Section: A Transmittermentioning

confidence: 99%

See 1 more Smart Citation

Adaptive Iterative Decoding for Expediting the Convergence of Unary Error Correction Codes

Zhang

Jia

Meng

et al. 2015

IEEE Trans. Veh. Technol.

Self Cite

View full text Add to dashboard Cite

show abstract

“…A summary of relevant and major contributions in the Görtz, N [30], [31] The introduction of iterative JSCC decoding 2009 Arikan, E. [13] Polar channel code 2013 Maunder, R.G. [32] The Unary Error Correction (UEC) JSCC 2013 Wang, T. [33] The Elias Gamma Error Correction (EGEC) JSCC 2016 Wang, T. [34] The Reordered Elias Gamma Error Correction (REGEC) JSCC 2016 Brejza, M. [35] The Exponential Golomb Error Correction (ExpGEC) JSCC 2023 Hamilton, A. (This work)…”

Section: Introductionmentioning

confidence: 99%

Reordered Exponential Golomb Error Correction Code for Universal Near-Capacity Joint Source-Channel Coding

Hamilton,

El-Hajjar,

Maunder

2023

IEEE Access

Self Cite

View full text Add to dashboard Cite

Joint Source-Channel Coding (JSCC) is a powerful technique that allows for the efficient transmission of information by simultaneously considering the characteristics of both the source and the channel. The recently proposed Exponential Golomb Error Correction (ExpGEC) and Rice Error Correction (REC) codes provide generalized JSCC schemes for the near capacity coding of symbols drawn from large or infinite alphabets. Yet these require impractical decoding structures, with large buffers and inflexible system design, this was mitigated by the introduction of the Reordered Elias Gamma Error Correction (REGEC) which itself had limited flexibility with regards to source distribution. In this paper, we propose a novel Reordered Exponential Golomb Error Correction (RExpGEC) coding scheme, which is a JSCC technique designed for flexible and practical near-capacity performance. The proposed RExpGEC encoder and decoder are presented and its performance is analysed using Extrinsic Information Transfer (EXIT) charts. The flexibility of the RExpGEC is shown via the novel trellis encoder and decoder design. Finally, the Symbol Error Rate (SER) performance of RExpGEC code is compared when integrated into the novel RExpGEC-URC-QPSK scheme against other comparable JSCC and Separate Source Channel Coding (SSCC) benchmarkers. Specifically the RExpGEC-URC-QPSK scheme is compared against the REGEC-URC-QPSK scheme, and a serial concatenation of the Exponential Golomb and Convolution Code, which becomes the novel Exp-CC-URC-QPSK scheme. Our simulation results demonstrate the performance gains and flexibility of the proposed RExpGEC-URC-QPSK scheme against the benchmarkers in providing reliable and efficient communications. Specifically, the RExpGEC-URC-QPSK scheme outperforms the SSCC in a uncorrelated Rayleigh fading channel by 2 to 3.6 dB (dependent on source distribution). Furthermore, the RExpGEC-URC-QPSK scheme consistently operates within 2.5 dB of channel capacity when measuring E b /N 0 , whilst providing flexibility in SNR performance when compared to the REGEC-URC-QPSK scheme. These performance gains come at the cost of complexity, whereby the RExpGEC-URC-QPSK scheme is 3.6 times more complex than Exp-CC-URC-QPSK scheme under certain conditions. This paper highlights the unique capabilities of RExpGEC as a high performance, practical and flexible JSCC technique.

show abstract

“…Therefore, the joint source-channel coding (JSCC) system has drawn increasing attention through effective utilization of the residual redundancy. The JSCC system have good error-correcting performance [2], complexity [3], [4] and transmission delay [5], and these advantages promote the JSCC system for applications in image processing [6], video transmissions [7] and so on. The JSCC system, where one low-density parity-check (LDPC) code [8] is used for source compression and one LDPC code is used for channel error correction, was proved to perform well in practical applications by utilizing the joint Tanner graph on the decoder side, named the double LDPC (D-LDPC) JSCC system [2].…”

Section: Introductionmentioning

confidence: 99%

Generalized Joint Shuffled Scheduling Decoding Algorithm for the JSCC System Based on Protograph-LDPC Codes

Wang

Hong

et al. 2021

IEEE Access

View full text Add to dashboard Cite

The joint shuffled scheduling decoding (JSSD) algorithm can reduce the decoding complexity of the joint source-channel coding system (JSCC) based on double protograph low-density parity-check (P-LDPC) codes. However, the JSSD algorithm will not work when the linking matrix between check nodes (CNs) of the source P-LDPC and variable nodes (VNs) of the channel P-LDPC is adopted in such a system, and this linking matrix has a significant influence on the system performance. In this paper, a generalized joint shuffled scheduling decoding (GJSSD) algorithm is designed to work for the system, and the JSSD algorithm can be regarded as a special case of this algorithm. Simulations show that the proposed GJSSD algorithm can reduce the decoding complexity with performance improvement when compared with the joint belief-propagation (JBP) algorithm.INDEX TERMS Joint source-channel coding, P-LDPC code, shuffled decoding.

show abstract

Near-Capacity Joint Source and Channel Coding of Symbol Values from an Infinite Source Set Using Elias Gamma Error Correction Codes

Cited by 10 publications

References 24 publications

Adaptive Iterative Decoding for Expediting the Convergence of Unary Error Correction Codes

Adaptive Iterative Decoding for Expediting the Convergence of Unary Error Correction Codes

Reordered Exponential Golomb Error Correction Code for Universal Near-Capacity Joint Source-Channel Coding

Generalized Joint Shuffled Scheduling Decoding Algorithm for the JSCC System Based on Protograph-LDPC Codes

Contact Info

Product

Resources

About