The University of Southampton
University of Southampton Institutional Repository

Adaptive iterative decoding for expediting the convergence of unary error correction codes

Adaptive iterative decoding for expediting the convergence of unary error correction codes
Adaptive iterative decoding for expediting the convergence of unary error correction codes
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 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.
bandwidth, complexity theory, decoding, encoding, iterative decoding, three-dimensional displays, vectors
0018-9545
621-635
Zhang, Wenbo
c35638de-42de-4c35-8147-97f88d78272a
Jia, Yanbo
7c6a16f5-d28a-4b34-8c4f-fd1edc1e7d9d
Meng, Xi
8c9d250c-f496-42a9-aed7-6e573fa67a0f
Brejza, Matthew
7c4ed4e3-1218-46c8-88ef-58ef998f81a4
Maunder, Robert G.
76099323-7d58-4732-a98f-22a662ccba6c
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1
Zhang, Wenbo
c35638de-42de-4c35-8147-97f88d78272a
Jia, Yanbo
7c6a16f5-d28a-4b34-8c4f-fd1edc1e7d9d
Meng, Xi
8c9d250c-f496-42a9-aed7-6e573fa67a0f
Brejza, Matthew
7c4ed4e3-1218-46c8-88ef-58ef998f81a4
Maunder, Robert G.
76099323-7d58-4732-a98f-22a662ccba6c
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1

Zhang, Wenbo, Jia, Yanbo, Meng, Xi, Brejza, Matthew, Maunder, Robert G. and Hanzo, Lajos (2015) Adaptive iterative decoding for expediting the convergence of unary error correction codes IEEE Transactions on Vehicular Technology, 64, (2), pp. 621-635.

Record type: Article

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 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.

PDF Adaptive Iterative Decoding for Expediting the Convergence of Unary Error Correction Codes.pdf - Accepted Manuscript
Download (422kB)

More information

e-pub ahead of print date: 19 May 2014
Published date: February 2015
Keywords: bandwidth, complexity theory, decoding, encoding, iterative decoding, three-dimensional displays, vectors
Organisations: Southampton Wireless Group

Identifiers

Local EPrints ID: 366960
URI: http://eprints.soton.ac.uk/id/eprint/366960
ISSN: 0018-9545
PURE UUID: 730b0011-0d7a-4417-8d95-d83ee34271fc
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: 21 Jul 2014 09:05
Last modified: 17 Oct 2017 08:51

Export record

Contributors

Author: Wenbo Zhang
Author: Yanbo Jia
Author: Xi Meng
Author: Matthew Brejza
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.

×