Stochastic decoding of LDPC codes

This letter presents the first successful method for iterative stochastic decoding of state-of-the-art low-density parity-check (LDPC) codes. The proposed method shows the viability of the stochastic approach for decoding LDPC codes on factor graphs. In addition, simulation results for a 200 and a 1...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters 2006-10, Vol.10 (10), p.716-718
Main Authors: Sharifi Tehrani, S., Gross, W.J., Mannor, S.
Format: Article
Language:English
Subjects:
Applied sciences
Belief propagation
Circuits
Coding, codes
Complexity
Decoding
Error correction codes
Exact sciences and technology
Graphs
Hardware
Information, signal and communications theory
Iterative algorithms
Iterative decoding
Iterative methods
Parity check codes
Signal and communications theory
Simulation
State of the art
Stochastic processes
Stochasticity
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Transmission and modulation (techniques and equipments)
Viability
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This letter presents the first successful method for iterative stochastic decoding of state-of-the-art low-density parity-check (LDPC) codes. The proposed method shows the viability of the stochastic approach for decoding LDPC codes on factor graphs. In addition, simulation results for a 200 and a 1024 length LDPC code demonstrate the near-optimal performance of this method with respect to sum-product decoding. The proposed method has a significant potential for high-throughput and/or low complexity iterative decoding.
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2006.060570