On the design of rate-compatible serially concatenated convolutional codes

Artikel i vetenskaplig tidskrift, 2007

A powerful class of rate-compatible serially concatenated convolutional codes (SCCCs) has been proposed based on minimising analytical upper bounds on the eff or probability in the error floor region. In this paper, this class of codes is further investigated by combining analytical upper bounds with extrinsic information transfer chart analysis to improve performance in the waterfall region. Following this approach, we construct a family of rate-compatible SCCCs with low complexity and good performance in both the error floor and the waterfall regions over a broad range of code rates. The proposed codes outperform standard SCCCs and have a similar performance as more complex parallel concatenated convolutional codes (PCCCs). The proposed codes perform particularly well for high code rates. Copyright (C) 2007 John Wiley & Sons, Ltd.