Multilevel Coding with a Class of Decomposable Finite-Geometry LDPC Codes

Author

Liu, Ya ; Chen, Huifang ; Xie, Lei ; Gao, Ming

Author_Institution

Dept. of Inf. Sci. & Electron. Eng., Zhejiang Univ., Hangzhou

fYear

2008

Firstpage

40

Lastpage

44

Abstract

This paper proposes a class of decomposable LDPC codes based on finite geometry EG(m, p^s) over bandlimited AWGN channel. These LDPC codes defined as the origin LDPC codes are decomposed into a few small LDPC codes as component codes in multilevel coding. It is shown that the origin LDPC codes demand generic M-ary Min-Sum algorithm while the component codes only require a few binary Min-Sum algorithm implementations in multi-stages decoding. The method proposed simplifies the decoding complexity.

Keywords

AWGN channels; bandlimited communication; decoding; geometry; parity check codes; additive white Gaussian noise; bandlimited AWGN channel; finite-geometry LDPC code; generic M-ary min-sum algorithm; multilevel coding; multistage decoding; AWGN channels; Bandwidth; Euclidean distance; Hamming distance; Information geometry; Information science; Iterative algorithms; Iterative decoding; Modulation coding; Parity check codes;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems for Communications, 2008. ICCSC 2008. 4th IEEE International Conference on

Conference_Location

Shanghai

Print_ISBN

978-1-4244-1707-0

Electronic_ISBN

978-1-4244-1708-7

Type

conf

DOI

10.1109/ICCSC.2008.16

Filename

4536708