A novel low complexity LDPC encoder based on RU algorithm with dynamic programming

Author

Sun, XiangRan ; Zeng, Zhibin ; Yang, Zhanxin

Author_Institution

Inf. Eng. Sch., Commun. Univ. of China, Beijing, China

Volume

7

fYear

2010

fDate

16-18 Oct. 2010

Firstpage

3258

Lastpage

3262

Abstract

In this paper, we present a low-complexity high-efficiency LDPC encoder, based on classic method of Richardson and Urbanke with a novel dynamic programming 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

computational complexity; digital video broadcasting; dynamic programming; mobile radio; multimedia communication; parity check codes; sparse matrices; Altera Stratix II EP1S180F102014; CMMB; Chinese mobile multimedia broadcasting standard; RU algorithm; Richardson-Urbanke method; bit rate 34 Mbit/s; bit rate 69 Mbit/s; dynamic programming algorithm; greedy algorithm; low density parity check codes; low-complexity high-efficiency LDPC encoder; sparse matrix; Algorithm design and analysis; Dynamic programming; Encoding; Hardware; Heuristic algorithms; Parity check codes; Sparse matrices; CMMB; LDPC; dynamic programming; encoder;

fLanguage

English

Publisher

ieee

Conference_Titel

Image and Signal Processing (CISP), 2010 3rd International Congress on

Conference_Location

Yantai

Print_ISBN

978-1-4244-6513-2

Type

conf

DOI

10.1109/CISP.2010.5647849

Filename

5647849