Serial Concatenation of Linear Block Codes and a Rate-1 Convolutional Code

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

Martin, Philippa A. (1Department of Electrical and Computer Engineering, University of Canterbury, Christchurch, New Zealand)
Isaka, Motohiko (Department of Informatics, Kwansei Gakuin University, Sanda 6691337, Japan)
Fossorier, Marc P. C. (3Department of Electrical Engineering, University of Hawaii at Manoa, HI 96822, USA)

In this paper we look at the serial concatenation of linear block codes with a rate-1 recursive convolutional code (accumulator). In particular, we present results for extended Bose Chaudhuri Hocquenghem (eBCH) codes. These codes offer low error floors, good performance and more flexible rate choices than product codes. Reduced complexity list decoding is used to decode the eBCH codes in order to maintain low decoding complexity.