Abstract:
This paper presents algebraic methods for constructing high performance quasi-cyclic LDPC codes over non-binary fields. Experimental results show that codes constructed b...Show MoreMetadata
Abstract:
This paper presents algebraic methods for constructing high performance quasi-cyclic LDPC codes over non-binary fields. Experimental results show that codes constructed based on these methods perform well over the AWGN channel with iterative decoding using a fast Fourier transform based sum-product algorithm. They achieve significantly large coding gains over Reed-Solomon codes of the same lengths and rates decoded with the hard-decision Berlekamp-Massey algorithm, the algebraic soft-decision Kotter-Vardy algorithm, and the Jiang-Narayananpsilas adaptive belief propagation algorithm. Due to their quasi-cyclic structure, these LDPC codes can be efficiently encoded using simple shift-registers with linear complexity. They have a great potential to replace Reed-Solomon codes for some applications in communication or storage systems for combating mixed types of noise and interferences.
Published in: 2008 IEEE Information Theory Workshop
Date of Conference: 05-09 May 2008
Date Added to IEEE Xplore: 25 July 2008
ISBN Information: