NDLI: Complexity-optimized low-density parity-check codes for gallager decoding algorithm B

Content Provider	IEEE Xplore Digital Library
Author	Wei Yu Ardakani, M. Smith, B. Kschischang, F.
Copyright Year	2005
Description	Author affiliation: Dept. of Electr. & Comput. Eng., Toronto Univ., Ont. (Wei Yu; Ardakani, M.; Smith, B.; Kschischang, F.)
Abstract	The complexity-rate tradeoff for error-correcting codes below the Shannon limit is a central question in coding theory. This paper makes progress in this area by presenting a joint numerical optimization of rate and decoding complexity for low-density parity-check codes. The focus of this paper is on the binary symmetric channel and on a class of decoding algorithms for which an exact extrinsic information transfer (EXIT) chart analysis is possible. This class of decoding algorithms includes the Gallager decoding algorithm B. The main feature of the optimization method is a complexity measure based on the EXIT chart that accurately estimates the number of iterations required for the decoding algorithm to reach a target error rate. Under a fixed check-degree distribution, it is shown that the proposed complexity measure is a convex function of the variable-degree distribution in a region of interest. This allows us to numerically characterize the complexity-rate tradeoff. We show that for the Gallager B decoding algorithm on binary symmetric channels, the optimization procedure can produce complexity savings of 30-40% as compared to the conventional code design method
Starting Page	1488
Ending Page	1492
File Size	285327
Page Count	5
File Format	PDF
ISBN	0780391519
DOI	10.1109/ISIT.2005.1523591
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2005-09-04
Publisher Place	Australia
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Parity check codes Iterative decoding Information analysis Design optimization Algorithm design and analysis Design methodology Shape measurement Error correction codes Optimization methods Error analysis
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

Design of irregular LDPC codes with optimized performance-complexity tradeoff

Complexity-optimized low-density parity-check codes for gallager decoding algorithm b.

Low complexity iterative decoding algorithm for low-density parity-check (LDPC) codes

Fifteen Years of Quantum LDPC Coding and Improved Decoding Strategies

Multi-edge type unequal error protecting low-density parity-check codes

Generalized Low-Density Parity-Check Codes Based on Hadamard Constraints

Girth of the Tanner graph and error correction capability of LDPC codes

Intensity reflection coefficient based Min-Sum decoding for Low Density Parity Check Codes

Two decoding algorithms for low-density parity-check codes

Complexity-optimized low-density parity-check codes for gallager decoding algorithm B

Similar Documents

Design of irregular LDPC codes with optimized performance-complexity tradeoff

Complexity-optimized low-density parity-check codes for gallager decoding algorithm b.

Low complexity iterative decoding algorithm for low-density parity-check (LDPC) codes

Fifteen Years of Quantum LDPC Coding and Improved Decoding Strategies

Multi-edge type unequal error protecting low-density parity-check codes

Generalized Low-Density Parity-Check Codes Based on Hadamard Constraints

Girth of the Tanner graph and error correction capability of LDPC codes

Intensity reflection coefficient based Min-Sum decoding for Low Density Parity Check Codes

Two decoding algorithms for low-density parity-check codes

Complexity-optimized low-density parity-check codes for gallager decoding algorithm B