NDLI: Lowering the error floors of irregular high-rate LDPC codes by graph conditioning

Content Provider	IEEE Xplore Digital Library
Author	Wen-Yen Weng Ramamoorthy, A. Wesel, R.D.
Copyright Year	2004
Description	Author affiliation: Dept. of Electr. Eng., California Univ., Los Angeles, CA, USA (Wen-Yen Weng; Ramamoorthy, A.; Wesel, R.D.)
Abstract	This paper applies a graph conditioning algorithm, called the approximate cycle extrinsic message degree (ACE) algorithm, to design high-rate (R/spl ges/1/2) irregular LDPC codes. The algorithm was shown to be an effective tool to lower the error floors of lower-rate (R/spl les/1/2) LDPC codes. However, for high-rate LDPC codes, due to the large number of degree-2 variable nodes in the optimal degree distribution, the error floor is high and it is more difficult to condition the graph. By constraining the number of degree-2 nodes, we found that the ACE algorithm can dramatically lower the error floor with little compromise of the threshold. A rate-3/4, length-10688 LDPC code is proposed whose AWGN channel performance is within 0.67 dB of the Shannon limit at BER=10/sup -5/ and its error floor is lower than 10/sup -7/. Compared to existing semi-regular codes which lower the floor by adopting non-optimal degree distributions, our graph-conditioned codes provides 0.38 dB of performance improvement at BER=10/sup -5/. The same design criteria also apply well to medium-length LDPC code design and are suitable for rate-compatible applications using the information-nulling technique. The rate-compatible scheme has consistently good thresholds and low error floors for 1/2/spl les/ R/spl les/ 8/9.
Starting Page	2549
Ending Page	2553
File Size	558792
Page Count	5
File Format	PDF
ISBN	0780385217
ISSN	10903038
DOI	10.1109/VETECF.2004.1400516
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2004-09-26
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Wen-Yen Weng Ramamoorthy, A. Wesel, R.D. Algorithm design and analysis Bit error rate AWGN channels Bipartite graph H infinity control Encoding Matrix converters
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

A novel algorithm of constructing LDPC codes with graph theory

Construction of irregular LDPC codes with low error floors

Lowering the error floors of irregular high-rate ldpc codes by graph conditioning (2004)

Lowering the error-rate floors of moderate-length high-rate irregular ldpc codes

Lowering LDPC Error Floors by Postprocessing

Lowering the Error Floors of Irregular High-Rate LDPC Codes by Graph Conditioning (2004)

Error floor analysis for an ensemble of easily implementable irregular (2048, 1024) LDPC codes

A random construction of LDPC codes using a sub-optimal search algorithm

Design of Irregular Quasi-Cyclic LDPC Codes

Lowering the error floors of irregular high-rate LDPC codes by graph conditioning

Similar Documents

A novel algorithm of constructing LDPC codes with graph theory

Construction of irregular LDPC codes with low error floors

Lowering the error floors of irregular high-rate ldpc codes by graph conditioning (2004)

Lowering the error-rate floors of moderate-length high-rate irregular ldpc codes

Lowering LDPC Error Floors by Postprocessing

Lowering the Error Floors of Irregular High-Rate LDPC Codes by Graph Conditioning (2004)

Error floor analysis for an ensemble of easily implementable irregular (2048, 1024) LDPC codes

A random construction of LDPC codes using a sub-optimal search algorithm

Design of Irregular Quasi-Cyclic LDPC Codes

Lowering the error floors of irregular high-rate LDPC codes by graph conditioning