Application and evaluation of the LDPC codes for the next generation communication systems

Iliev, Teodor; Hristov, Georgi; Zahariev, Plamen; Iliev, Mihail

doi:10.1007/978-1-4020-8737-0_96

Cited by 10 publications

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The entire H matrix, for an irregular LDPC code is composed of two sub matrix; the systematic sub matrix Hs and the parity one Hp, Figure 3 and Figure 4. The sub matrix Hp is that adopted by WiMax Mobile [13].…”

Section: Standard Iterative Decoding Of Ldpc Codesmentioning

confidence: 99%

Reduced Complexity of Decoding Algorithm for Irregular LDPC Codes Using a Split Row Method

Alami¹,

Mrabti²,

Gueye³

2012

JWNC

View full text Add to dashboard Cite

In this paper, we have proposed a novel method of decoding algorithm of irregular LDPC codes. 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. Recently, irregular LDPC codes have received a lot of attention by many advanced standard, such as WiFi, WiMAX Mobile and digital video broadcasting (DVB-S2). Hence the idea to develop the "Split-Row Method" for irregular LDPC codes. In this context, we have performed an implementation on MATLAB of an irregular LDPC codes with different code word and code rate; 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. The study result shows that the "Split Row Method" is better for irregular code than regular LDPC codes.

show abstract

Section: Standard Iterative Decoding Of Ldpc Codesmentioning

confidence: 99%