By Topic

New Rateless Sparse-Graph Codes with Dynamic Degree Distribution for Erasure Channels

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

2 Author(s)
Xingkai Bao ; Dept. of Electr. & Comput. Eng., Lehigh Univ., Bethlehem, PA ; Jing Li

A new class of rateless low-density parity-check (LDPC) codes, called the dynamic degree distribution (DDD) codes, are proposed for erasure channels. The parity symbols are generated from a set of degree distributions, one embedded in one another and each optimized for different channel erasure rates. Thus, instead of sticking to a fixed degree distribution for all the channel conditions, the encoder progressively adapts different degree distributions for different channel conditions, such that each distribution is operated in its most-desirable region. Theoretic analysis shows that the new codes perform close to the capacity in a large range of code rates with fairly low complexity. Simulations confirm that these codes can actually outperform the existing raptor rateless codes.

Published in:

Global Telecommunications Conference, 2008. IEEE GLOBECOM 2008. IEEE

Date of Conference:

Nov. 30 2008-Dec. 4 2008