Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

TIT
2002

favoriteEmaildiscussreport

146views more TIT 2002»

Bounds on the performance of belief propagation decoding

13 years 4 months ago

Bounds on the performance of belief propagation decoding

Download www.eng.tau.ac.il

We consider Gallager's soft decoding (belief propagation) algorithm for decoding low density parity check (LDPC) codes, when applied to an arbitrary binary-input symmetric-output channel. By considering the expected values of the messages, we derive both lower and upper bounds on the performance of the algorithm. We also derive various properties of the decoding algorithm, such as a certain robustness to the details of the channel noise. Our results apply both to regular and irregular LDPC codes.

David Burshtein, Gadi Miller

Real-time Traffic

Algorithm | Arbitrary Binary-input Symmetric-output | Low Density Parity | TIT 2002 |

claim paper

Related Content

» Turbo Decoding as an Instance of Pearls Belief Propagation Algorithm

» LowerComplexity Layered BeliefPropagation Decoding of LDPC Codes

» Using inputoutput queues to increase LDPC decoder performance

» Bayesian Compressive Sensing via Belief Propagation

» JoinGraph Propagation Algorithms

» Average Stopping Set Weight Distributions of Redundant Random Ensembles

» Network Coding over a Noisy Relay a Belief Propagation Approach

» Leveraging Belief Propagation Backtrack Search and Statistics for Model Counting

» Message Errors in Belief Propagation

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	2002
Where	TIT
Authors	David Burshtein, Gadi Miller

Comments (0)