By Topic

Approximate-MIN constraint node updating for LDPC code decoding

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)
C. Jones ; Dept. of Electr. Eng., California Univ., Los Angeles, CA, USA ; E. Valles ; M. Smith ; J. Villasenor

This work introduces a technique for updating messages that originate at the constraint nodes of bi-partite graphs in low-density parity-check codes. The technique computes only two outgoing magnitudes at each constraint node and exhibits no measurable performance loss as compared to exact belief propagation which computes a unique magnitude for each departing edge from a given constraint node. The technique eliminates the need for memory based table look-up in the constraint node processing and has been implemented using only shift, add, and comparison operations. Finite wordlength results for a 'worst-case' code indicate that 6 bit quantization yields performance that is similar to that provided by full floating point computation.

Published in:

Military Communications Conference, 2003. MILCOM '03. 2003 IEEE  (Volume:1 )

Date of Conference:

13-16 Oct. 2003