The University of Southampton
University of Southampton Institutional Repository

Joint Optimization of Iterative Source and Channel Decoding Using Over-Complete Source-Mapping

Joint Optimization of Iterative Source and Channel Decoding Using Over-Complete Source-Mapping
Joint Optimization of Iterative Source and Channel Decoding Using Over-Complete Source-Mapping
The intentionally imposed or inherent unintentional residual redundancy found in source encoded bitstreams can be exploited for supporting joint SoftBit-Source Decoding and Channel Decoding, which has the potential of improving both the error correcting capability as well as the subjective audio or video quality of communication systems. As a potent error concealment technique, the softbit-based source decoding, proposed by Adrat, Vary and Spittka exploits the residual redundancy or correlation inherent in the source codec parameters for mitigating the effects of transmission errors. However, when using efficient source encoders, limited source redundancy is left in the source-encoded bitstream. In this scenario the SoftBit-Source Decoder (SBSD) may have a limited extrinsic information contribution, which results in negligible system performance improvements beyond two decoding iterations. In our novel approach, we partition the total available bit-rate budget between the source and channel codecs in order to improve the attainable error correcting capability and hence to maximize the overall system's performance. More explicitly, the inherent redundancy in the encoded bitstream is intentionally increased with the aid of over-complete mapping. By analysing the extrinsic information transfer function characteristics of the softbit-aided source decoder, we present a set of overcomplete mappings, which maximize the iterative source-channel decoding performance. As a main contribution of this paper, we propose an algorithm for designing a suitable overcomplete mapping for iterative source-channel decoding. Our experimental results show that at the same overall code-rate of the system, the iterative source-channel coding scheme using a suitable overcomplete mapping may lead to an approximately $2dB$ signal-to-noise ratio gain in comparison to the conventional iterative source-channel coding benchmarker.
1072-1076
Pham Quang, A.
90b2b58c-2cd5-4c76-b8b9-e43dbcd6e627
Yang, L-L
ae425648-d9a3-4b7d-8abd-b3cfea375bc7
Hanzo, L
66e7266f-3066-4fc0-8391-e000acce71a1
Pham Quang, A.
90b2b58c-2cd5-4c76-b8b9-e43dbcd6e627
Yang, L-L
ae425648-d9a3-4b7d-8abd-b3cfea375bc7
Hanzo, L
66e7266f-3066-4fc0-8391-e000acce71a1

Pham Quang, A., Yang, L-L and Hanzo, L (2007) Joint Optimization of Iterative Source and Channel Decoding Using Over-Complete Source-Mapping. IEEE VTC'07(Fall), United States. 30 Sep - 03 Oct 2007. pp. 1072-1076 .

Record type: Conference or Workshop Item (Paper)

Abstract

The intentionally imposed or inherent unintentional residual redundancy found in source encoded bitstreams can be exploited for supporting joint SoftBit-Source Decoding and Channel Decoding, which has the potential of improving both the error correcting capability as well as the subjective audio or video quality of communication systems. As a potent error concealment technique, the softbit-based source decoding, proposed by Adrat, Vary and Spittka exploits the residual redundancy or correlation inherent in the source codec parameters for mitigating the effects of transmission errors. However, when using efficient source encoders, limited source redundancy is left in the source-encoded bitstream. In this scenario the SoftBit-Source Decoder (SBSD) may have a limited extrinsic information contribution, which results in negligible system performance improvements beyond two decoding iterations. In our novel approach, we partition the total available bit-rate budget between the source and channel codecs in order to improve the attainable error correcting capability and hence to maximize the overall system's performance. More explicitly, the inherent redundancy in the encoded bitstream is intentionally increased with the aid of over-complete mapping. By analysing the extrinsic information transfer function characteristics of the softbit-aided source decoder, we present a set of overcomplete mappings, which maximize the iterative source-channel decoding performance. As a main contribution of this paper, we propose an algorithm for designing a suitable overcomplete mapping for iterative source-channel decoding. Our experimental results show that at the same overall code-rate of the system, the iterative source-channel coding scheme using a suitable overcomplete mapping may lead to an approximately $2dB$ signal-to-noise ratio gain in comparison to the conventional iterative source-channel coding benchmarker.

Text
19-45996-review.pdf - Other
Download (211kB)

More information

Published date: September 2007
Additional Information: Event Dates: 30 September -3 October 2007
Venue - Dates: IEEE VTC'07(Fall), United States, 2007-09-30 - 2007-10-03
Organisations: Southampton Wireless Group

Identifiers

Local EPrints ID: 264461
URI: http://eprints.soton.ac.uk/id/eprint/264461
PURE UUID: 2a65ce4d-29d4-4468-8ad5-310d9368caf1
ORCID for L-L Yang: ORCID iD orcid.org/0000-0002-2032-9327
ORCID for L Hanzo: ORCID iD orcid.org/0000-0002-2636-5214

Catalogue record

Date deposited: 05 Sep 2007
Last modified: 10 Dec 2019 01:58

Export record

Contributors

Author: A. Pham Quang
Author: L-L Yang ORCID iD
Author: L 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.

×