The University of Southampton
University of Southampton Institutional Repository

Reordered exponential golomb error correction code for universal near-capacity joint source-channel coding

Reordered exponential golomb error correction code for universal near-capacity joint source-channel coding
Reordered exponential golomb error correction code for universal near-capacity joint source-channel coding
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 REGECURC-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 Eb/N0, 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.
Channel Coding, Channel coding, Codes, Complexity theory, Decoding, Error correction codes, Joint Source-Channel Coding (JSCC), Reordered Exponential Golomb, Source Coding, Source coding, Symbols, source coding, reordered exponential Golomb, joint source-channel coding (JSCC)
2169-3536
93619-93634
Hamilton, Alexander
73418485-6e91-4151-9a21-d6219807a2d7
El-Hajjar, Mohammed
3a829028-a427-4123-b885-2bab81a44b6f
Maunder, Robert G.
76099323-7d58-4732-a98f-22a662ccba6c
Hamilton, Alexander
73418485-6e91-4151-9a21-d6219807a2d7
El-Hajjar, Mohammed
3a829028-a427-4123-b885-2bab81a44b6f
Maunder, Robert G.
76099323-7d58-4732-a98f-22a662ccba6c

Hamilton, Alexander, El-Hajjar, Mohammed and Maunder, Robert G. (2023) Reordered exponential golomb error correction code for universal near-capacity joint source-channel coding. IEEE Access, 11, 93619-93634. (doi:10.1109/ACCESS.2023.3310824).

Record type: Article

Abstract

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 REGECURC-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 Eb/N0, 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.

Text
Reordered_Exponential_Golomb_Error_Correction_Code_for_Universal_Near-Capacity_Joint_Source-Channel_Coding - Accepted Manuscript
Available under License Creative Commons Attribution.
Download (828kB)

More information

Accepted/In Press date: 28 August 2023
e-pub ahead of print date: 31 August 2023
Published date: 2023
Additional Information: Publisher Copyright: © 2013 IEEE.
Keywords: Channel Coding, Channel coding, Codes, Complexity theory, Decoding, Error correction codes, Joint Source-Channel Coding (JSCC), Reordered Exponential Golomb, Source Coding, Source coding, Symbols, source coding, reordered exponential Golomb, joint source-channel coding (JSCC)

Identifiers

Local EPrints ID: 481616
URI: http://eprints.soton.ac.uk/id/eprint/481616
ISSN: 2169-3536
PURE UUID: 863468f4-b6e6-4726-8462-52b3e54150fd
ORCID for Alexander Hamilton: ORCID iD orcid.org/0000-0003-0604-6563
ORCID for Mohammed El-Hajjar: ORCID iD orcid.org/0000-0002-7987-1401
ORCID for Robert G. Maunder: ORCID iD orcid.org/0000-0002-7944-2615

Catalogue record

Date deposited: 05 Sep 2023 16:34
Last modified: 09 Nov 2024 02:45

Export record

Altmetrics

Contributors

Author: Alexander Hamilton ORCID iD
Author: Mohammed El-Hajjar ORCID iD
Author: Robert G. Maunder ORCID iD

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×