Joint generator and parity-check matrices parallel encoding of LDPC codes

Author

Zhang, Peng ; Liu, Changyin ; Chen, Jinlun ; Lv, Rui

Author_Institution

Commun. Univ. of China, Beijing, China

Volume

1

fYear

2009

fDate

19-20 Dec. 2009

Firstpage

56

Lastpage

59

Abstract

Concerning the high encoding complexity of low-density parity-check (LDPC) codes, a joint generator and parity-check matrices parallel 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 runs fast and requires less memory due to low computational complexity.

Keywords

computational complexity; encoding; parity check codes; computational complexity; encoding complexity; joint encoding; low-density parity-check codes; parallel encoding; sparse parity-check matrix; Character generation; Computational complexity; Encoding; Forward error correction; Intelligent transportation systems; Matrix decomposition; Parity check codes; Power electronics; Power generation; Sparse matrices; CMMB; LDPC codes; joint encoding method; parallel;

fLanguage

English

Publisher

ieee

Conference_Titel

Power Electronics and Intelligent Transportation System (PEITS), 2009 2nd International Conference on

Conference_Location

Shenzhen

Print_ISBN

978-1-4244-4544-8

Type

conf

DOI

10.1109/PEITS.2009.5406967

Filename

5406967