Serially concatenated turbo codes

Authors:
Sina Vafi;Tadeusz Wysocki;Mehran Abolhasan
Affiliations:
School of Engineering and IT, Charles Darwin University,Darwin, Australia;School of Computer and Electronics Engineering, University of Nebraska-Lincoln, Omaha;ICT, University of Wollongong, Wollongong, Australia
Venue:
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Year:
2009

Citing 3
Cited 0

A distance spectrum interpretation of turbo codes

IEEE Transactions on Information Theory - Part 1
Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding

IEEE Transactions on Information Theory
Product accumulate codes: a class of codes with near-capacity performance and low decoding complexity

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.01

Visualization

Abstract

The paper presents a new scheme of concatenated codes, referred to as Serially Concatenated Turbo (SCT) codes. The code is constructed as the serial combinations of two turbo codes, i.e. turbo Recursive Systematic Convolutional (RSC) codes and turbo Bose Ray Chaudhuri Hocquenghem (BCH) codes, linked by a pseudo-random interleaver. In comparison with the conventional turbo RSC codes, SCT codes have higher minimum distance values. Based on conducted simulations, it is found that SCT codes outperform turbo RSC codes at the waterfall and error floor regions, while they require reasonable number of iterations at their iterative decoding structure to achieve good performance.