DocumentCode
3351865
Title
The Design of the Maximum-Likelihood Decoding Algorithm of LDPC Codes over BEG
Author
Lee, Ki-Moon ; Radha, Hayder
Author_Institution
Michigan State Univ., East Lansing
fYear
2007
fDate
14-16 March 2007
Firstpage
463
Lastpage
468
Abstract
We improve the design of the maximum likelihood decoding algorithm (MLDA) for the development of LDPC codes. Furthermore, we apply the improved design to the decoding of progressive edge growth (PEG) LDPC codes over binary erasure channels (BEC). We also demonstrate clear improvements over current LDPC decoding algorithms.
Keywords
maximum likelihood decoding; parity check codes; binary erasure channels; low-density-parity-check codes; maximum-likelihood decoding algorithm; progressive-edge-growth LDPC codes; Algorithm design and analysis; Encoding; Greedy algorithms; Kernel; Linear systems; Maximum likelihood decoding; Parity check codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Sciences and Systems, 2007. CISS '07. 41st Annual Conference on
Conference_Location
Baltimore, MD
Print_ISBN
1-4244-1063-3
Electronic_ISBN
1-4244-1037-1
Type
conf
DOI
10.1109/CISS.2007.4298350
Filename
4298350
Link To Document