A fast convergence density evolution algorithm for optimal rate LDPC codes in BEC

Author

Tavakoli, Hamidreza

Author_Institution

Dept. of Electr. Eng., Univ. of Guilan, Rasht, Iran

fYear

2014

fDate

9-11 Sept. 2014

Firstpage

574

Lastpage

577

Abstract

We derive a new fast convergent Density Evolution algorithm for finding optimal rate Low-Density Parity-Check (LDPC) codes used over the binary erasure channel (BEC). The fast convergence property comes from the modified Density Evolution (DE), a numerical method for analyzing the behavior of iterative decoding convergence of a LDPC code. We have used the method of [16] for designing of a LDPC code with optimal rate. This has been done for a given parity check node degree distribution, erasure probability and specified DE constraint. The fast behavior of DE and found optimal rate with this method compare with the previous DE constraint.

Keywords

convergence of numerical methods; iterative decoding; parity check codes; BEC; binary erasure channel; erasure probability; fast convergence density evolution algorithm; iterative decoding; low-density parity-check codes; numerical method; optimal rate LDPC codes; parity check node degree distribution; specified DE constraint; Channel capacity; Convergence; Decoding; Iterative decoding; Optimization; Simulation; Density evolution; Infinite analysis method; LDPC code; LP; SDP;

fLanguage

English

Publisher

ieee

Conference_Titel

Telecommunications (IST), 2014 7th International Symposium on

Conference_Location

Tehran

Print_ISBN

978-1-4799-5358-5

Type

conf

DOI

10.1109/ISTEL.2014.7000770

Filename

7000770