DocumentCode
2574081
Title
Reduced complexity-and-latency variable-to-check residual belief propagation decoding algorithms for LDPC codes
Author
Kim, Jung-Hyun ; Song, Hong-Yeop
Author_Institution
Yonsei Univ., Seoul, South Korea
fYear
2009
fDate
19-23 Oct. 2009
Firstpage
76
Lastpage
79
Abstract
This paper proposes some new improved versions of node-wise VCRBP algorithm, called forced-convergence node-wise VCRBP and sign-based node-wise VCRBP, both of which significantly reduce the decoding complexity and latency, with only negligible deterioration in error correcting performance.
Keywords
computational complexity; decoding; parity check codes; LDPC codes; complexity reduction; latency variable-to-check residual belief propagation decoding algorithm; sign-based node-wise VCRBP; Belief propagation; Code standards; Convergence; Delay; Dynamic scheduling; Error correction; Error correction codes; Iterative decoding; Parity check codes; Scheduling algorithm; LDPC codes; RBP algorithm; dynamic scheduled decoder; fast convergence decoding;
fLanguage
English
Publisher
ieee
Conference_Titel
Signal Design and its Applications in Communications, 2009. IWSDA '09. Fourth International Workshop on
Conference_Location
Fukuoka
Print_ISBN
978-1-4244-4379-6
Electronic_ISBN
978-1-4244-4380-2
Type
conf
DOI
10.1109/IWSDA.2009.5346442
Filename
5346442
Link To Document