DocumentCode
2085691
Title
Improved Approximately Lower Triangular Encoding of LDPC Codes
Author
Zhang, Peng ; Yang, Fei ; Lv, Rui ; Chen, Jinlun
Author_Institution
Commun. Univ. of China, Beijing, China
fYear
2009
fDate
17-19 Oct. 2009
Firstpage
1
Lastpage
5
Abstract
Concerning the high encoding complexity of low-density parity-check (LDPC) codes, an improved approximately lower triangular (ALT) encoding method is proposed, which is able to take full advantage of the characteristics of the sparse parity-check matrix, such as cyclicity and equality of row weight. Experimental results show that, the proposed method can reduce dramatically the memory requirements in hardware implementation, while maintaining the computational complexity nearly.
Keywords
computational complexity; parity check codes; sparse matrices; LDPC code; encoding complexity; improved approximately lower triangular encoding method; low-density parity-check code; sparse parity-check matrix; Binary codes; Computational complexity; Decoding; Encoding; Forward error correction; Hardware; Matrix decomposition; Memory; Parity check codes; Sparse matrices;
fLanguage
English
Publisher
ieee
Conference_Titel
Image and Signal Processing, 2009. CISP '09. 2nd International Congress on
Conference_Location
Tianjin
Print_ISBN
978-1-4244-4129-7
Electronic_ISBN
978-1-4244-4131-0
Type
conf
DOI
10.1109/CISP.2009.5301507
Filename
5301507
Link To Document