The University of Southampton
University of Southampton Institutional Repository

Iterative decoding convergence and termination of serially concatenated codes

Iterative decoding convergence and termination of serially concatenated codes
Iterative decoding convergence and termination of serially concatenated codes
In this paper we demonstrate that previously proposed serially concatenated codes only facilitate iterative decoding convergence towards points that are near but not at the top-right hand corner of the EXIT chart, which typically results in an error floor. Furthermore, we propose a novel method for approaching the (1,1) point of the EXIT chart, where the Maximum Likelihood (ML) Bit Error Ratio (BER) performance is attained. Our method employs specifically designed termination sequences having a free distance of at least two to terminate an inner recursive code. Additionally, we provide optimal termination sequences for a range of inner code designs. Finally, we demonstrate that our novel approach facilitates useful BER reductions in the challenging application scenario when employing short frame lengths of the order of 100 bits, which are typical in wireless sensor networks, for example.
Termination, iterative decoding, EXIT chart, convolutional code, recursion, turbo, serial concatenation
0018-9545
216-224
Maunder, R. G.
76099323-7d58-4732-a98f-22a662ccba6c
Hanzo, L.
66e7266f-3066-4fc0-8391-e000acce71a1
Maunder, R. G.
76099323-7d58-4732-a98f-22a662ccba6c
Hanzo, L.
66e7266f-3066-4fc0-8391-e000acce71a1

Maunder, R. G. and Hanzo, L. (2010) Iterative decoding convergence and termination of serially concatenated codes. IEEE Transactions on Vehicular Technology, 59 (1), 216-224. (doi:10.1109/TVT.2009.2028118).

Record type: Article

Abstract

In this paper we demonstrate that previously proposed serially concatenated codes only facilitate iterative decoding convergence towards points that are near but not at the top-right hand corner of the EXIT chart, which typically results in an error floor. Furthermore, we propose a novel method for approaching the (1,1) point of the EXIT chart, where the Maximum Likelihood (ML) Bit Error Ratio (BER) performance is attained. Our method employs specifically designed termination sequences having a free distance of at least two to terminate an inner recursive code. Additionally, we provide optimal termination sequences for a range of inner code designs. Finally, we demonstrate that our novel approach facilitates useful BER reductions in the challenging application scenario when employing short frame lengths of the order of 100 bits, which are typical in wireless sensor networks, for example.

Text
IDCATOSCC.pdf - Version of Record
Download (274kB)

More information

Published date: January 2010
Keywords: Termination, iterative decoding, EXIT chart, convolutional code, recursion, turbo, serial concatenation
Organisations: Southampton Wireless Group

Identifiers

Local EPrints ID: 266133
URI: http://eprints.soton.ac.uk/id/eprint/266133
ISSN: 0018-9545
PURE UUID: d1c22401-4699-44b9-b937-c55c97c3c1b6
ORCID for R. G. Maunder: ORCID iD orcid.org/0000-0002-7944-2615
ORCID for L. Hanzo: ORCID iD orcid.org/0000-0002-2636-5214

Catalogue record

Date deposited: 15 Jul 2008 10:26
Last modified: 18 Mar 2024 03:09

Export record

Altmetrics

Contributors

Author: R. G. Maunder ORCID iD
Author: L. Hanzo 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.

×