By Topic

Degree Distribution Design for LDPC Codes: A Derivative Matching Approach

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)
Paolini, E. ; DEIS, Univ. of Bologna, Cesena, Italy ; Chiani, M. ; Fossorier, M.P.C.

A deterministic method to design degree distributions for low-density parity-check codes over the binary erasure channel is proposed. This method consists of matching the first and high-order derivatives of the extrinsic information transfer (EXIT) function of the variable node set to the corresponding derivatives of the inverse EXIT function of the check node set, in order to reduce the gap between the two curves in the EXIT chart. A sufficient condition for a check-concentrated distribution to achieve derivative matching up to some order is first obtained, and then a deterministic design algorithm, enabled by the Fourier-Budan theorem, is developed exploiting this sufficient condition. A comparison with other deterministic design techniques is also provided, revealing the potential of the proposed algorithm.

Published in:

Communications, IEEE Transactions on  (Volume:59 ,  Issue: 11 )