Serially Concatenated Turbo Codes

Author

Vafi, Sina ; Wysocki, Tadeusz ; Abolhasan, Mehran

Author_Institution

Sch. of Eng. & IT, Charles Darwin Univ., Darwin, NT, Australia

fYear

2009

fDate

24-26 Sept. 2009

Firstpage

1

Lastpage

4

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.

Keywords

BCH codes; concatenated codes; convolutional codes; interleaved codes; iterative decoding; random codes; recursive estimation; turbo codes; Bose Ray Chaudhuri Hocquenghem codes; SCT codes; error floor regions; iterative decoding structure; minimum distance values; pseudo-random interleaver; recursive systematic convolutional codes; serially concatenated turbo codes; Australia; Block codes; Concatenated codes; Convolution; Convolutional codes; Forward error correction; Iterative decoding; Parity check codes; Reed-Solomon codes; Turbo codes;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communications, Networking and Mobile Computing, 2009. WiCom '09. 5th International Conference on

Conference_Location

Beijing

Print_ISBN

978-1-4244-3692-7

Electronic_ISBN

978-1-4244-3693-4

Type

conf

DOI

10.1109/WICOM.2009.5303570

Filename

5303570