NDLI: On the guaranteed error-correction of decimation-enhanced iterative decoders

Content Provider	IEEE Xplore Digital Library
Author	Planjery, S.K. Declercq, D. Diouf, M. Vasic, B.
Copyright Year	2014
Description	Author affiliation: Dept. of Electr. & Comput. Eng., Univ. of Arizona Tucson, Tucson, AZ, USA (Vasic, B.) \|\| ETIS ENSEA, Univ. Cergy-Pontoise, Cergy-Pontoise, France (Planjery, S.K.; Declercq, D.; Diouf, M.)
Abstract	Finite alphabet iterative decoders (FAIDs) proposed for LDPC codes on the binary symmetric channel are capable of surpassing the belief propagation (BP) decoder in the error floor region with lower complexity and precision, but these decoders are difficult to analyze for finite-length codes. Recently, decimation-enhanced FAIDs (DFAIDs) were proposed for column-weight-three codes. Decimation involves fixing the bit values of certain variable nodes during message-passing based on the messages they receive after some number of iterations. In this paper, we address the problem of proving the guaranteed error-correction capability of DFAIDs for column-weight-three LDPC codes. We present the methodology of the proof to derive sufficient conditions on the Tanner graph that guarantee the correction of a given error pattern in a finite number of iterations. These sufficient conditions are described as a list of forbidden graphs that must not be contained in the Tanner graph of the code. As a test case, we consider the problem of guaranteeing the correction of four errors. We illustrate the analysis for a specific 4-error pattern and provide the sufficient conditions for its correction. We also present results on the design of codes satisfying those sufficient conditions and their impact on the achievable code rate.
Starting Page	57
Ending Page	61
File Size	703833
Page Count	5
File Format	PDF
ISBN	9781479959853
ISSN	21654719
DOI	10.1109/ISTC.2014.6955085
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-08-18
Publisher Place	Germany
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Algorithm design and analysis Information processing Turbo codes Decoding Complexity theory Iterative decoding
Content Type	Text
Resource Type	Article

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 Library 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

Enhancing the error correction of finite alphabet iterative decoders via adaptive decimation

On the FER performance and decoding complexity of turbo codes

Decimation-enhanced finite alphabet iterative decoders for LDPC codes on the BSC

Interleaver design for turbo codes based on the performance of iterative decoding

Two-bit bit flipping decoding of LDPC codes

Design of data width requirement for fixed-point turbo decoders based on modified MAP algorithm

New early termination methos for turbo decoders

Design of the BCJR decoding algorithm with reduced space complexity

The iterative decoding algorithm research of Turbo Product Codes

On the guaranteed error-correction of decimation-enhanced iterative decoders

Similar Documents

Enhancing the error correction of finite alphabet iterative decoders via adaptive decimation

On the FER performance and decoding complexity of turbo codes

Decimation-enhanced finite alphabet iterative decoders for LDPC codes on the BSC

Interleaver design for turbo codes based on the performance of iterative decoding

Two-bit bit flipping decoding of LDPC codes

Design of data width requirement for fixed-point turbo decoders based on modified MAP algorithm

New early termination methos for turbo decoders

Design of the BCJR decoding algorithm with reduced space complexity

The iterative decoding algorithm research of Turbo Product Codes

On the guaranteed error-correction of decimation-enhanced iterative decoders