NDLI: Code Annealing and the Suppressing Effect of the Cyclically Lifted LDPC Code Ensemble

Content Provider	IEEE Xplore Digital Library
Author	Chih-Chun Wang
Copyright Year	2006
Description	Author affiliation: Sch. of Electr. & Comput. Eng., Purdue Univ., West Lafayette, IN (Chih-Chun Wang)
Abstract	Code annealing, a new method of designing good codes of short block length, is proposed, which is then concatenated with cyclic lifting to create finite codes of low frame error rate (FER) error floors without performance outliers. The stopping set analysis is performed on the cyclically lifted code ensemble assuming uniformly random lifting sequences, and the suppressing effect/weight of the cyclic lifting is identified for the first time, based on which the ensemble FER error floor can be analytically determined and a scaling law is derived. BoUe the first-order and high-order suppressing effects are discussed and quantified by different methods including the explicit expression, an algorithmic upper bound, and an algebraic lower bound. The mismatch between the suppressing weight and the stopping distances explains the dramatic performance discrepancy among different cyclically lifted codes when the underlying base codes have degree 2 variable nodes or not. For the former case, a degree augmentation method is further introduced to mitigate this metric mismatch, and a systematic method of constructing irregular codes of low FER error floors is presented. Both regular and irregular codes of very low FER error floors are reported, for which the improvement factor ranges from $10^{6}$ - 104 when compared to the classic graph-based code ensembles
Starting Page	86
Ending Page	90
File Size	6907500
Page Count	5
File Format	PDF
ISBN	1424400678
DOI	10.1109/ITW2.2006.323762
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2006-10-22
Publisher Place	Uruguay
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Algorithm design and analysis Design engineering Annealing Upper bound Error analysis Conferences Parity check codes Performance analysis Design optimization Information theory
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

Code Annealing and the Suppressing Effect of the Cyclically Lifted LDPC Code Ensemble

Code annealing and the suppressing effect of the cyclically lifted LDPC code ensemble,” presented at 2006

Quasi-cyclic LDPC codes based on pre-lifted protographs

On upper bounds for the achievable rates of LDPC codes

Upper Bounds on the Error Exponents of LDPC Code Ensembles

Decreasing error floor in LDPC codes by parity-check matrix extensions

Upper bound on the error exponent of regular LDPC codes transmitted over the BEC

On distance properties of quasi-cyclic protograph-based LDPC codes

Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes (2001)

Code Annealing and the Suppressing Effect of the Cyclically Lifted LDPC Code Ensemble

Similar Documents

Code Annealing and the Suppressing Effect of the Cyclically Lifted LDPC Code Ensemble

Code annealing and the suppressing effect of the cyclically lifted LDPC code ensemble,” presented at 2006

Quasi-cyclic LDPC codes based on pre-lifted protographs

On upper bounds for the achievable rates of LDPC codes

Upper Bounds on the Error Exponents of LDPC Code Ensembles

Decreasing error floor in LDPC codes by parity-check matrix extensions

Upper bound on the error exponent of regular LDPC codes transmitted over the BEC

On distance properties of quasi-cyclic protograph-based LDPC codes

Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes (2001)

Code Annealing and the Suppressing Effect of the Cyclically Lifted LDPC Code Ensemble