Approximate-min* constraint node updating for LDPC code decoding

Authors:
Christopher Jones;Esteban Vallés;Michael Smith;John Villasenor
Affiliations:
Electrical Engineering Department, University of California, Los Angeles, CA;Electrical Engineering Department, University of California, Los Angeles, CA;Electrical Engineering Department, University of California, Los Angeles, CA;Electrical Engineering Department, University of California, Los Angeles, CA
Venue:
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume I
Year:
2003

Citing 5
Cited 7

Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
Good error-correcting codes based on very sparse matrices

IEEE Transactions on Information Theory
Improved low-density parity-check codes using irregular graphs

IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes

IEEE Transactions on Information Theory
Efficient encoding of low-density parity-check codes

IEEE Transactions on Information Theory

A Gaussian Noise Generator for Hardware-Based Simulations

IEEE Transactions on Computers
Extended layered decoding of LDPC codes

Proceedings of the 18th ACM Great Lakes symposium on VLSI
Capacity-approaching protograph codes

IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Techniques and architectures for hazard-free semi-parallel decoding of LDPC codes

EURASIP Journal on Embedded Systems - Special issue on design and architectures for signal and image processing
Architecture and Finite Precision Optimization for Layered LDPC Decoders

Journal of Signal Processing Systems
Interleave-division multiple access (IDMA) using low-rate layered LDGM codes

Wireless Communications & Mobile Computing
GPU-like on-chip system for decoding LDPC codes

ACM Transactions on Embedded Computing Systems (TECS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.