DocumentCode
2133864
Title
Reduced complexity of decoding algorithm for irregular LDPC codes using Split Row method
Author
Alami, R.E. ; Gueye, C.B. ; Mrabti, M. ; Boussetta, M. ; Zouak, M.
Author_Institution
Fac. des Sci. Dhar El Mehraz, LESSI, Univ. Sidi Mohamed Ben Abdellah, Fez, Morocco
fYear
2011
fDate
7-9 April 2011
Firstpage
1
Lastpage
5
Abstract
A reduced complexity LDPC decoding method for regular LDPC code is extended to irregular LDPC codes; we present in this paper a full description of this method and its benefits for various row weight and length code word. The Split-Row method makes column processing parallelism easier to exploit and significantly simplifies row processors. Simulation results over an additive white Gaussian channel show that the error performance of high row-weight codes with Split-Row decoding is within 0.3-0.5 dB of the Min-Sum algorithm.
Keywords
AWGN channels; parity check codes; LDPC code; additive white Gaussian channel; column processing parallelism; complexity reduction; decoding algorithm; length code word; split row method; Binary phase shift keying; Complexity theory; Decoding; Iterative decoding; Program processors; Simulation; Low-density-parity-check codes; bit error rate; min sum; split row;
fLanguage
English
Publisher
ieee
Conference_Titel
Multimedia Computing and Systems (ICMCS), 2011 International Conference on
Conference_Location
Ouarzazate
ISSN
Pending
Print_ISBN
978-1-61284-730-6
Type
conf
DOI
10.1109/ICMCS.2011.5945639
Filename
5945639
Link To Document