Picture of aircraft jet engine

Strathclyde research that powers aerospace engineering...

The Strathprints institutional repository is a digital archive of University of Strathclyde's Open Access research outputs. Strathprints provides access to thousands of Open Access research papers by University of Strathclyde researchers, including by Strathclyde researchers involved in aerospace engineering and from the Advanced Space Concepts Laboratory - but also other internationally significant research from within the Department of Mechanical & Aerospace Engineering. Discover why Strathclyde is powering international aerospace research...

Strathprints also exposes world leading research from the Faculties of Science, Engineering, Humanities & Social Sciences, and from the Strathclyde Business School.

Discover more...

On the iterative decoding of concatenated partial unit memory codes structures

Stankovic, L. and Honary, B. (2004) On the iterative decoding of concatenated partial unit memory codes structures. In: 1st International Symposium on Wireless Communication Systems 2004, 2004-09-20 - 2004-09-22.

Full text not available in this repository. (Request a copy from the Strathclyde author)

Abstract

The aim of this paper is to describe in detail the iterative decoding algorithm used during the implementation of concatenated Partial Unit Memory (PUM) code structures, such as turbo and woven turbo constructions based on PUM codes. Previous published research by the authors have shown that such concatenated PUM code structures have better distance properties and performance than equivalent structures based on convolutional codes. The decoding algorithm presented is based on the max-log MAP algorithm used for classical turbo codes with component convolutional codes. Unlike the trellis of a convolutional code, the trellis of PUM codes is characterised by parallel branches between state pairs and multiple input branch labels. We show how the original max-log MAP algorithm is adapted to cope with the unusual trellis structure of PUM codes. The proof that our algorithm performs satisfactorily is illustrated by the relative performance, for different iterations, of turbo and woven turbo structures based on PUM codes, which approach the Shannon limit.