Reduced complexity iterative decoding of low-density parity check codes based on belief propagation

M.P.C. Fossorier, M. Mihaljevic, H. Imai

doi:10.1109/26.768759

Description

Two simplified versions of the belief propagation algorithm for fast iterative decoding of low-density parity check codes on the additive white Gaussian noise channel are proposed. Both versions are implemented with real additions only, which greatly simplifies the decoding complexity of belief propagation in which products of probabilities have to be computed. Also, these two algorithms do not require any knowledge about the channel characteristics. Both algorithms yield a good performance-complexity trade-off and can be efficiently implemented in software as well as in hardware, with possibly quantized received values.

Journal

IEEE Transactions on Communications

IEEE Transactions on Communications 47 (5), 673-680, 1999-05

Institute of Electrical and Electronics Engineers (IEEE)

Details 詳細情報について

CRID: 1361418519349168512

NII Article ID: 80011136944

DOI: 10.1109/26.768759

ISSN: 00906778

Web Site: http://xplorestaging.ieee.org/ielx5/26/16661/00768759.pdf?arnumber=768759

Data Source

Crossref
CiNii Articles
OpenAIRE

Export

Report a problem