DocumentCode
3333686
Title
Analysis of complexity for the message passing algorithm
Author
Maguolo, Federico ; Mior, Alessandra
Author_Institution
Dept. of Inf. Eng., Univ. of Padova, Padova
fYear
2008
fDate
25-27 Sept. 2008
Firstpage
295
Lastpage
299
Abstract
Besides turbo codes, low-density parity-check (LDPC) codes form another class of Shannon limit-approaching codes. Their large coding gains are mostly due to the decoding algorithm, termed message passing algorithm (MPA) or sum-product algorithm (SPA).
Keywords
computational complexity; message passing; parity check codes; Shannon limit-approaching codes; complexity analysis; low-density parity-check codes; message passing algorithm; sum-product algorithm; Algorithm design and analysis; Belief propagation; Computational complexity; Information analysis; Iterative algorithms; Iterative decoding; Message passing; Parity check codes; Sum product algorithm; Turbo codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Software, Telecommunications and Computer Networks, 2008. SoftCOM 2008. 16th International Conference on
Conference_Location
Split
Print_ISBN
978-953-6114-97-9
Electronic_ISBN
978-953-290-009-5
Type
conf
DOI
10.1109/SOFTCOM.2008.4669498
Filename
4669498
Link To Document