NDLI: Analysis of Absorbing Sets and Fully Absorbing Sets of Array-Based LDPC Codes

Content Provider	IEEE Xplore Digital Library
Author	Dolecek, L. Zhengya Zhang Anantharam, V. Wainwright, M.J. Nikolic, B.
Copyright Year	1963
Abstract	The class of low-density parity-check (LDPC) codes is attractive, since such codes can be decoded using practical message-passing algorithms, and their performance is known to approach the Shannon limits for suitably large block lengths. For the intermediate block lengths relevant in applications, however, many LDPC codes exhibit a so-called ¿error floor,¿ corresponding to a significant flattening in the curve that relates signal-to-noise ratio (SNR) to the bit-error rate (BER) level. Previous work has linked this behavior to combinatorial substructures within the Tanner graph associated with an LDPC code, known as (fully) absorbing sets. These fully absorbing sets correspond to a particular type of near-codewords or trapping sets that are stable under bit-flipping operations, and exert the dominant effect on the low BER behavior of structured LDPC codes. This paper provides a detailed theoretical analysis of these (fully) absorbing sets for the class of Cp, ¿ array-based LDPC codes, including the characterization of all minimal (fully) absorbing sets for the array-based LDPC codes for ¿ = 2,3,4, and moreover, it provides the development of techniques to enumerate them exactly. Theoretical results of this type provide a foundation for predicting and extrapolating the error floor behavior of LDPC codes.
Sponsorship	IEEE Information Theory Society
Starting Page	181
Ending Page	201
Page Count	21
File Size	694544
File Format	PDF
ISSN	00189448
Volume Number	56
Issue Number	1
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2010-01-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Parity check codes Bit error rate Decoding Floors Signal to noise ratio Message passing Performance analysis Algorithm design and analysis Semiconductor materials Materials science and technology trapping set Absorbing set bit-flipping error floor low-density parity-check (LDPC ) codes message passing decoding near-codeword
Content Type	Text
Resource Type	Article
Subject	Library and Information Sciences Information Systems Computer Science Applications

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

On Trapping Sets and Guaranteed Error Correction Capability of LDPC Codes and GLDPC Codes

Breaking the Trapping Sets in LDPC Codes: Check Node Removal and Collaborative Decoding

Two-Bit Bit Flipping Algorithms for LDPC Codes and Collective Error Correction

Quantized Iterative Message Passing Decoders with Low Error Floor for LDPC Codes

Instanton-based techniques for analysis and reduction of error floors of LDPC codes

Predicting error floors of structured LDPC codes: deterministic bounds and estimates

Error Correction Capability of Column-Weight-Three LDPC Codes Under the Gallager A Algorithm—Part II

Error Floor Approximation for LDPC Codes in the AWGN Channel

Design of LDPC decoders for improved low error rate performance: quantization and algorithm choices

Analysis of Absorbing Sets and Fully Absorbing Sets of Array-Based LDPC Codes

Similar Documents

On Trapping Sets and Guaranteed Error Correction Capability of LDPC Codes and GLDPC Codes

Breaking the Trapping Sets in LDPC Codes: Check Node Removal and Collaborative Decoding

Two-Bit Bit Flipping Algorithms for LDPC Codes and Collective Error Correction

Quantized Iterative Message Passing Decoders with Low Error Floor for LDPC Codes

Instanton-based techniques for analysis and reduction of error floors of LDPC codes

Predicting error floors of structured LDPC codes: deterministic bounds and estimates

Error Correction Capability of Column-Weight-Three LDPC Codes Under the Gallager A Algorithm—Part II

Error Floor Approximation for LDPC Codes in the AWGN Channel

Design of LDPC decoders for improved low error rate performance: quantization and algorithm choices

Analysis of Absorbing Sets and Fully Absorbing Sets of Array-Based LDPC Codes