By Topic

Optimized puncturing and shortening distributions for nonbinary LDPC codes over the binary erasure channel

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
$31 $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

3 Author(s)
Klinc, D. ; Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA ; Jeongseok Ha ; McLaughlin, S.W.

This paper investigates optimal puncturing and shortening distributions for nonbinary LDPC codes over the binary erasure channel (BEC). The analysis is done by means of density evolution and optimal distributions are found with differential evolution. We show that puncturing or shortening entire variable nodes results in bad performance; instead, for best performance, puncturing and shortening distributions have to be designed carefully, where generally, most variable nodes are punctured/shortened only partially. Our results indicate that properly designed punctured and shortened nonbinary LDPC codes can maintain a very small gap to capacity through a wide range of rates.

Published in:

Communication, Control, and Computing, 2008 46th Annual Allerton Conference on

Date of Conference:

23-26 Sept. 2008