Title :
Efficient encoding of QC-LDPC codes related to cyclic MDS codes
Author :
Kamiya, Norifumi ; Sasaki, Eisaku
Author_Institution :
Common Platform Software Res. Labs., NEC Corp., Kawasaki, Japan
fDate :
8/1/2009 12:00:00 AM
Abstract :
In this paper, we present an efficient systematic encoding algorithm for quasi-cyclic (QC) low-density parity check (LDPC) codes that are related to cyclic maximum-distance separable (MDS) codes. The algorithm offers linear time complexity, and it can be easily implemented by using polynomial multiplication and division circuits. We show that the division polynomials can be completely characterized by their zeros and that the sum of the respective numbers of their zeros is equal to the parity-length of the codes.
Keywords :
cyclic codes; parity check codes; QC-LDPC codes; cyclic MDS codes; linear time complexity; maximum distance separable codes; polynomial multiplication-division circuits; quasi-cyclic low density parity check codes; systematic encoding algorithm; Application software; Circuits; Encoding; Geometry; Information theory; National electric code; Parity check codes; Polynomials; Reed-Solomon codes; Sparse matrices; QC-LDPC codes, Cyclic MDS codes, Linear time encoding.;
Journal_Title :
Selected Areas in Communications, IEEE Journal on
DOI :
10.1109/JSAC.2009.090803
