DocumentCode
1976505
Title
A New Fast Density Evolution
Author
Jin, Hui ; Richardson, Tom
Author_Institution
Flarion Technologies, Bedminster, NJ, Email: h.jin@flarion.com
fYear
2006
fDate
13-17 March 2006
Firstpage
183
Lastpage
187
Abstract
Density evolution for LDPC codes predicts asymptotic performance and serves as a practical design tool for designing top performing structures [1]. Many papers advocate the use of exit chart methods and other approximations, proclaiming that density evolution is computationally too intensive. In this paper we show that this is not the case: we present a highly efficient and accurate implementation of density evolution for LDPC codes.
Keywords
Computational complexity; Convolution; Discrete Fourier transforms; Distributed computing; Flexible printed circuits; Fourier transforms; H infinity control; Parity check codes; Probability distribution; Quantization;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Workshop, 2006. ITW '06 Punta del Este. IEEE
Conference_Location
Punta del Este, Uruguay
Print_ISBN
1-4244-0035-X
Electronic_ISBN
1-4244-0036-8
Type
conf
DOI
10.1109/ITW.2006.1633807
Filename
1633807
Link To Document