NDLI: A comparison study of binary and non-binary LDPC codes decoding

Content Provider	IEEE Xplore Digital Library
Author	El Hassani, S. Hamon, M.-H. Pénard, P.
Copyright Year	2010
Description	Author affiliation: Orange Labs, 4 rue du Clos Courtel, 35512 Cesson-Sévigné Cedex, France (El Hassani, S.; Hamon, M.-H.; Pénard, P.)
Abstract	Non binary LDPC codes are promising error correcting codes which have increasingly raised interest in the last few years. This paper addresses some comparisons for short and moderate blocklengths between binary and non binary LDPC codes from different points of view, including error correction performance, complexity cost and possible adaptation and optimization opportunities. It shows a performance advantage of non binary codes up to 0.5 dB when only using GF(4) instead of GF(2), and up to 0.75 dB when using GF(16). Despite the large additional complexity induced by non binary decoding, these codes are very promising since adapted complexity reduction techniques are already investigated and show interesting results. Some analysis on decoding behavior of non binary LDPC decoder is also given in this paper. Such comparisons and analysis are interesting to gain insights on non binary LDPC codes and to derive guidelines for their optimization.
Starting Page	355
Ending Page	359
File Size	144127
Page Count	5
File Format	PDF
ISBN	9781424486632
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2010-09-23
Publisher Place	Croatia
Access Restriction	Subscribed
Rights Holder	University of Split, FESB
Subject Keyword	Schedules Binary codes Parity check codes Complexity theory Reliability Maximum likelihood 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

Min-Max decoding for non binary LDPC codes

An Efficient Maximum-Likelihood Decoding of LDPC Codes Over the Binary Erasure Channel (2004)

ML vs. BP decoding of binary and non-binary LDPC codes

Informed dynamic scheduling for majority-logic decoding of non-binary LDPC codes

Low-Complexity LDPC Codes with Near-Optimum Performance over the BEC

Check Node Reliability-Based Scheduling for BP Decoding of Non-Binary LDPC Codes

Improved linear programming decoding and bounds on the minimum distance of LDPC codes

A Simplified Min-Sum Decoding Algorithm for Non-Binary LDPC Codes

Approximate iterative LP decoding of LDPC codes over GF(q) in linear complexity

A comparison study of binary and non-binary LDPC codes decoding

Similar Documents

Min-Max decoding for non binary LDPC codes

An Efficient Maximum-Likelihood Decoding of LDPC Codes Over the Binary Erasure Channel (2004)

ML vs. BP decoding of binary and non-binary LDPC codes

Informed dynamic scheduling for majority-logic decoding of non-binary LDPC codes

Low-Complexity LDPC Codes with Near-Optimum Performance over the BEC

Check Node Reliability-Based Scheduling for BP Decoding of Non-Binary LDPC Codes

Improved linear programming decoding and bounds on the minimum distance of LDPC codes

A Simplified Min-Sum Decoding Algorithm for Non-Binary LDPC Codes

Approximate iterative LP decoding of LDPC codes over GF(q) in linear complexity

A comparison study of binary and non-binary LDPC codes decoding