DocumentCode
3011171
Title
A Novel Low Complexity LDPC Encoder Based on Optimized RU Algorithm with Backtracking
Author
Sun, XiangRan ; Zeng, Zhibin ; Yang, Zhanxin
Author_Institution
Inf. Eng. Sch., Commun. Univ. of China, Beijing, China
fYear
2010
fDate
29-31 Oct. 2010
Firstpage
1
Lastpage
4
Abstract
We present a low-complexity high-efficiency LDPC encoder, based on classic method of Richardson and Urbanke with a novel backtracking algorithm, which we propose to substitute greedy algorithm for approximate triangulation with sparse matrix of LDPC codes. For the LDPC code in CMMB, for example, the complexity of encoding is reduced effectively, and an implementation of LDPC encoder for two different code rate (1/2 and 3/4) on Altera Stratix II EP1S180F102014 can achieve encoding rate 34 Mbps and 69 Mbps.
Keywords
encoding; parity check codes; CMMB; backtracking algorithm; greedy algorithm; low complexity LDPC encoder; optimized Richardson-Urbanke algorithm; sparse matrix; Algorithm design and analysis; Complexity theory; Encoding; Greedy algorithms; Hardware; Parity check codes; Sparse matrices;
fLanguage
English
Publisher
ieee
Conference_Titel
Multimedia Technology (ICMT), 2010 International Conference on
Conference_Location
Ningbo
Print_ISBN
978-1-4244-7871-2
Type
conf
DOI
10.1109/ICMULT.2010.5631468
Filename
5631468
Link To Document