DocumentCode :
2176034
Title :
An Improved LU Decomposition Encoding Method of LDPC Codes
Author :
Zhang, Peng ; Lv, Rui ; Yang, Gang ; Chen, Jinlun
Author_Institution :
Commun. Univ. of China, Beijing, China
fYear :
2009
fDate :
20-22 Sept. 2009
Firstpage :
1
Lastpage :
4
Abstract :
Concerning the high encoding complexity of low-density parity-check (LDPC) codes, an improved LU decomposition 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; matrix algebra; parity check codes; LDPC codes; LU decomposition encoding method; computational complexity; low-density parity-check codes; sparse parity-check matrix; Computational complexity; Decoding; Encoding; Forward error correction; Hardware; Matrix decomposition; Memory; Parity check codes; Sparse matrices; Turbo codes;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Management and Service Science, 2009. MASS '09. International Conference on
Conference_Location :
Wuhan
Print_ISBN :
978-1-4244-4638-4
Electronic_ISBN :
978-1-4244-4639-1
Type :
conf
DOI :
10.1109/ICMSS.2009.5304859
Filename :
5304859
Link To Document :
بازگشت