2009•Unpublished venueRequires access

Serially Concatenated Turbo Codes

Sina Vafi, Tadeusz A. Wysocki, Mehran Abolhasan

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.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Turbo code, Serial concatenated convolutional codes, Concatenated error correction code, Turbo equalizer, Convolutional code, Computer science, BCJR algorithm, Linear code