Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

High Performance Nonbinary Quasi-Cyclic LDPC Codes on Euclidean Geometries

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
5 Author(s)
Bo Zhou ; Department of Electrical and Computer Engineering, University of California, Davis, Davis, CA 95616. Email: ; Jingyu Kang ; Tai, Y.Y. ; Qin Huang
more authors

This paper presents algebraic methods for constructing efficiently encodable and high performance nonbinary quasi-cyclic LDPC codes based on hyperplanes of Euclidean geometries and masking. Codes constructed from these methods perform very 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 either the algebraic hard-decision Berlekamp-Massey algorithm or the algebraic soft-decision Kötter-Vardy algorithm. Due to their quasi-cyclic structure, these nonbinary LDPC codes on Euclidean geometries can be encoded with simple shift-registers with linear complexity. Structured nonbinary LDPC codes have a great potential to replace Reed-Solomon codes for some applications in either communication systems or storage systems for combating mixed types of noise and interferences.

Published in:

Military Communications Conference, 2007. MILCOM 2007. IEEE

Date of Conference:

29-31 Oct. 2007