Performance of Q-ary PCGC based on PEG algorithm

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).