The University of Southampton
University of Southampton Institutional Repository

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

Irregular Trellis for the Near-Capacity Unary Error Correction Coding of Symbol Values From an Infinite Set
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.
5073-5088
Zhang, Wenbo
949b3fcf-0a51-4575-b6de-b4029bfbaf3f
Brejza, Matthew F.
a761342e-e140-45a7-ad48-095a6628af17
Wang, Tao
dd7d278c-abe5-46f4-9fa3-39e5629d43d7
Maunder, Robert G.
76099323-7d58-4732-a98f-22a662ccba6c
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1
Zhang, Wenbo
949b3fcf-0a51-4575-b6de-b4029bfbaf3f
Brejza, Matthew F.
a761342e-e140-45a7-ad48-095a6628af17
Wang, Tao
dd7d278c-abe5-46f4-9fa3-39e5629d43d7
Maunder, Robert G.
76099323-7d58-4732-a98f-22a662ccba6c
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1

Zhang, Wenbo, Brejza, Matthew F., Wang, Tao, Maunder, Robert G. and Hanzo, Lajos (2015) Irregular Trellis for the Near-Capacity Unary Error Correction Coding of Symbol Values From an Infinite Set IEEE Transactions on Communications, 63, (12), pp. 5073-5088.

Record type: Article

Abstract

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.

PDF tcomm-hanzo-2493149-proof.pdf - Accepted Manuscript
Download (2MB)

More information

Accepted/In Press date: 8 October 2015
Published date: 26 October 2015
Organisations: Southampton Wireless Group

Identifiers

Local EPrints ID: 386811
URI: http://eprints.soton.ac.uk/id/eprint/386811
PURE UUID: 701c6491-5616-4e20-ab24-c300be7ef5a4
ORCID for Robert G. Maunder: ORCID iD orcid.org/0000-0002-7944-2615
ORCID for Lajos Hanzo: ORCID iD orcid.org/0000-0002-2636-5214

Catalogue record

Date deposited: 02 Feb 2016 12:46
Last modified: 25 Oct 2017 21:30

Export record

Contributors

Author: Wenbo Zhang
Author: Matthew F. Brejza
Author: Tao Wang
Author: Robert G. Maunder ORCID iD
Author: Lajos Hanzo ORCID iD

University divisions

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.

×