DocumentCode
2028537
Title
A Maximum-Likelihood Decoding Algorithm of LT Codes with a Small Fraction of Dense Rows
Author
Ki-Moon Lee ; Radha, H.
Author_Institution
Michigan State Univ., East Lansing
fYear
2007
fDate
24-29 June 2007
Firstpage
2006
Lastpage
2010
Abstract
We design a new form of the Maximum Likelihood Decoding Algorithm (MLDA) in [1] for LT codes [3] with a small fraction of dense rows. In particular, we design degree distributions using the Robust Soliton Distribution (RSD) for the proposed MLDA based decoding of LT codes. We also estimate the computational complexity of the proposed LT based MLDA. Simulation results, which show the viability of the proposed MLDA decoding of LT codes, are also presented.
Keywords
computational complexity; maximum likelihood decoding; transform coding; LT codes; Luby transform code; computational complexity; degree distribution design; dense row; maximum-likelihood decoding algorithm; robust soliton distribution; Algorithm design and analysis; Computational complexity; Computational modeling; Design engineering; Linear systems; Mathematics; Maximum likelihood decoding; Maximum likelihood estimation; Robustness; Solitons;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2007. ISIT 2007. IEEE International Symposium on
Conference_Location
Nice
Print_ISBN
978-1-4244-1397-3
Type
conf
DOI
10.1109/ISIT.2007.4557515
Filename
4557515
Link To Document