Iterative decoding convergence and termination of serially concatenated codes
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.
- Published Version
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.
|Keywords:||Termination, iterative decoding, EXIT chart, convolutional code, recursion, turbo, serial concatenation|
|Divisions:||Faculty of Physical and Applied Science > Electronics and Computer Science > Comms, Signal Processing & Control
|Date Deposited:||15 Jul 2008 10:26|
|Last Modified:||01 Mar 2012 18:09|
|Contributors:||Maunder, R. G. (Author)
Hanzo, L. (Author)
|Contact Email Address:||email@example.com|
|Further Information:||Google Scholar|
|ISI Citation Count:||2|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)