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.
|Number of pages||4|
|Publication status||Published - Sep 2004|
|Event||1st International Symposium on Wireless Communication Systems 2004 - , Mauritius|
Duration: 20 Sep 2004 → 22 Sep 2004
|Conference||1st International Symposium on Wireless Communication Systems 2004|
|Period||20/09/04 → 22/09/04|