Performance of Q-ary PCGC based on PEG algorithm

Author

Yang, Xiang ; Wang, Lin ; Li, Yong

Author_Institution

Chongqing Univ. of Posts &Telecomm., Chongqing

fYear

2007

fDate

Nov. 28 2007-Dec. 1 2007

Firstpage

1

Lastpage

4

Abstract

PCGC (Parallel Concatenated Gallager Codes) are a new class of concatenated codes based on component LDPC codes. They show the low complexity of encoding while maintaining a good performance compare to LDPC codes. In this paper we investigate the performance of q-ary PCGC scenario, and the PEG (Progressive Edge-Growth) algorithm is introduced into the design of component parity check matrix. Simulation results show that q-ary PCGC with proper component design on GF(4) are better than the comparable LDPC codes at the short lengths. Meanwhile it is found that PCGC on GF(4) also outperform PCGC on GF(2) with analogous complexity. Finally it is seen that q- ary PCGC can be optimized further through proper component design on GF(q).

Keywords

concatenated codes; error statistics; fast Fourier transforms; parity check codes; bit error rate; component LDPC code design; component parity check matrix; encoding method; fast Fourier transform; progressive edge-growth algorithm; q-ary parallel concatenated Gallager code; AWGN; Algorithm design and analysis; Bit error rate; Concatenated codes; Galois fields; Iterative decoding; Maintenance engineering; Parity check codes; Signal processing algorithms; Telecommunications; BER (Bit Error Rate); FFT (Fast Fourier Transform); PEG (Progressive Edge-Growth); Q-ary PCGC;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Signal Processing and Communication Systems, 2007. ISPACS 2007. International Symposium on

Conference_Location

Xiamen

Print_ISBN

978-1-4244-1447-5

Electronic_ISBN

978-1-4244-1447-5

Type

conf

DOI

10.1109/ISPACS.2007.4445808

Filename

4445808