By Topic

Layered BP Decoding for Rate-Compatible Punctured LDPC Codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Jeongseok Ha ; Sch. of Electr. & Comput. Eng., Inf. & Commun. Univ., Daejeon ; Klinc, D. ; Jini Kwon ; McLaughlin, S.W.

Rate-compatible punctured LDPC codes have shown to perform well over a wide variety of code rates, both theoretically and practically. However it has been reported that the belief propagation (BP) decoding for these codes converges slower than for unpunctured codes. Layered BP algorithm is a modified BP algorithm that accelerates the decoding convergence by means of sequential scheduling of check node updates. In this letter, we propose an efficient scheduling of check node updates for rate-compatible punctured LDPC codes that performs well. We show that the convergence speed of the proposed scheduling outperforms conventional (random) scheduling and conventional BP decoding. Performance improvements become more distinctive with the growing fraction of punctured bits

Published in:

Communications Letters, IEEE  (Volume:11 ,  Issue: 5 )