Design of Rate-Compatible Serially Concatenated Convolutional Codes

Conference: TURBO - CODING - 2006 - 4th International Symposium on Turbo Codes & Related Topics; 6th International ITG-Conference on Source and Channel Coding
04/03/2006 - 04/07/2006 at Munich, Germany

Proceedings: TURBO - CODING - 2006

Pages: 6Language: englishTyp: PDF

Personal VDE Members are entitled to a 10% discount on this title

Graell, i Amat, Alexandre (GET/ENST Bretagne, Electronics Department, CS 83818, 29238 Brest Cedex 3, France)
Graell, i Amat, Alexandre (Department of Technology, Universitat Pompeu Fabra, Passeig Circumval.lació 8, 08003 Barcelona, Spain)
Brännström, Fredrik (Department of Signals and Systems, Chalmers University of Technology, 412 96 Göteborg, Sweden)
Rasmussen, Lars K. (ITR, University of South Australia, Mawson Lakes, SA 5095, Australia)

Recently a powerful class of rate-compatible serially concatenated convolutional codes (SCCCs) have been proposed based on minimizing analytical upper bounds on the error probability in the error floor region. Here this class of codes is further investigated by combining analytical upper bounds with extrinsic information transfer charts analysis. Following this approach, we construct a family of rate-compatible SCCCs with good performance in both the error floor and the waterfall regions over a broad range of code rates.