NDLI: Performance Analysis of Iterative Decoding Algorithms with Memory over Memoryless Channels

Content Provider	IEEE Xplore Digital Library
Author	Janulewicz, E. Banihashemi, A.H.
Copyright Year	1972
Abstract	Density evolution is often used to determine the performance of an ensemble of low-density parity-check (LDPC) codes under iterative message-passing algorithms. Conventional density evolution techniques over memoryless channels are based on the assumption that messages at iteration ℓ are only a function of the messages at iteration ℓ -1 and possibly the channel output. This assumption is valid for many algorithms such as standard belief propagation (BP) and min-sum (MS) algorithms. However, there are other important iterative algorithms such as successive relaxation (SR) versions of BP and MS, and differential decoding with binary message passing (DD-BMP) algorithm of Mobini et al., for which this assumption is not valid. The reason is the introduction of memory in these algorithms. In this work, we propose a model for iterative decoding algorithms with memory which covers SR and DD-BMP algorithms as special cases. Based on this model, we derive a Bayesian network for iterative algorithms with memory over memoryless channels and use this representation to analyze the performance of the algorithms using density evolution. The density evolution technique is developed based on truncating the memory of the decoding process and approximating it with a finite order Markov process, and can be implemented efficiently. As an example, we apply our technique to analyze the performance of DD-BMP on regular LDPC code ensembles, and make a number of interesting observations with regard to the performance/complexity tradeoff of DD-BMP in comparison with BP and MS algorithms. The model presented in this paper is based on certain simplifying assumptions about the memory structure of iterative algorithms such as the existence of memory only at the output of variable nodes in the code's Tanner graph rather than at both outputs of variable and check nodes. The Bayesian network framework introduced here however, can still be used to analyze the more general scenarios.
Starting Page	3556
Ending Page	3566
Page Count	11
File Size	524562
File Format	PDF
ISSN	00906778
Volume Number	60
Issue Number	12
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2012-12-01
Publisher Place	U.S.A.
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Iterative decoding Random variables Algorithm design and analysis Bayesian methods Decoding Iterative methods differential decoding with binary message passing (DD-BMP) Iterative coding schemes low-density parity-check (LDPC) codes iterative decoding algorithms with memory memoryless channels density evolution Bayesian networks belief propagation (BP) min-sum (MS)
Content Type	Text
Resource Type	Article
Subject	Electrical and Electronic Engineering

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Libarray of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Comments on successive relaxation for decoding of LDPC codes

Performance analysis of iterative decoding algorithms with memory

Dynamics and performance analysis of analog iterative decoding for low-density parity-check (LDPC) codes

A Modified Belief Propagation Decoding Algorithm of LDPC Codes for Fast Convergence

Combined normalized and offset min-sum decoding over partial response channels

New group shuffled BP decoding algorithms for LDPC codes

On universal LDPC code ensembles

Low-density parity-check codes with 2-state trellis decoding

Message-Passing Algorithms and Improved LP Decoding

Performance Analysis of Iterative Decoding Algorithms with Memory over Memoryless Channels

Similar Documents

Comments on successive relaxation for decoding of LDPC codes

Performance analysis of iterative decoding algorithms with memory

Dynamics and performance analysis of analog iterative decoding for low-density parity-check (LDPC) codes

A Modified Belief Propagation Decoding Algorithm of LDPC Codes for Fast Convergence

Combined normalized and offset min-sum decoding over partial response channels

New group shuffled BP decoding algorithms for LDPC codes

On universal LDPC code ensembles

Low-density parity-check codes with 2-state trellis decoding

Message-Passing Algorithms and Improved LP Decoding

Performance Analysis of Iterative Decoding Algorithms with Memory over Memoryless Channels