Serially concatenated codes with euclidean geometry LDPC and convolutional codes

Author

Vafi, Sina ; Pham, Huu Dung

Author_Institution

Sch. of Eng. & Inf. Technol., Charles Darwin Univ., Darwin, NT, Australia

fYear

2012

fDate

21-23 Nov. 2012

Firstpage

393

Lastpage

397

Abstract

This paper presents a new scheme of serially concatenated codes. It is formed by a combination of Euclidean Geometry (EG) Low Density Parity Check (LDPC) and Recursive Systematic Convolutional (RSC) codes linked by the row-column interleaver. A modification is proposed on the interleaver, which improves performance of concatenated codes. This is conducted by recognition of patterns producing low-weights for both LDPC and RSC codes. Simulation results confirm that with similar rates and less decoding complexity, newly designed codes outperform product codes constituted by two cyclic EG codes.

Keywords

concatenated codes; convolutional codes; parity check codes; pattern recognition; decoding complexity; euclidean geometry LDPC; low density parity check code; pattern recognition; recursive systematic convolutional code; row-column interleaver; serially concatenated code; Complexity theory; Concatenated codes; Decoding; Iterative decoding; Product codes; Systematics; Cyclic codes; Euclidean Geometry (EG) codes; LDPC codes; RSC codes;

fLanguage

English

Publisher

ieee

Conference_Titel

Communication Systems (ICCS), 2012 IEEE International Conference on

Conference_Location

Singapore

ISSN

Pending

Print_ISBN

978-1-4673-2052-8

Type

conf

DOI

10.1109/ICCS.2012.6406177

Filename

6406177