NDLI: Geometrical and performance analysis of GMD and Chase decoding algorithms

Content Provider	IEEE Xplore Digital Library
Author	Fishler, E. Amrani, O. Be'ery, Y.
Copyright Year	1963
Abstract	The overall number of nearest neighbors in bounded distance decoding (BDD) algorithms is given by N/sub 0,eff/=N/sub 0/+N/sub BDD/. Where NBDD denotes the number of additional, non-codeword, neighbors that are generated during the (suboptimal) decoding process. We identify and enumerate the nearest neighbors associated with the original generalized minimum distance (GMD) and Chase (1972) decoding algorithms. After careful examination of the decision regions of these algorithms, we derive an approximated probability ratio between the error contribution of a noncodeword neighbor (one of N/sub BDD/ points) and a codeword nearest neighbor. For Chase algorithm 1 it is shown that the contribution to the error probability of a noncodeword nearest neighbor is a factor of 2/sup d-1/ less than the contribution of a codeword, while for Chase algorithm 2 the factor is 2/sup [d/2]-1/, d being the minimum Hamming distance of the code. For Chase algorithm 3 and GMD, a recursive procedure for calculating this ratio, which turns out to be nonexponential in d, is presented. This procedure can also be used for specifically identifying the error patterns associated with Chase algorithm 3 and GMD. Utilizing the probability ratio, we propose an improved approximated upper bound on the probability of error based on the union bound approach. Simulation results are given to demonstrate and support the analytical derivations.
Sponsorship	IEEE Information Theory Society
Starting Page	1406
Ending Page	1422
Page Count	17
File Size	340759
File Format	PDF
ISSN	00189448
Volume Number	45
Issue Number	5
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1999-07-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	Decoding
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

Asymptotic optimality of the GMD and Chase decoding algorithms

Generalization of chase algorithms for soft decision decoding of binary linear codes

Error performance analysis for reliability-based decoding algorithms

Reduced GMD decoding

Fast Chase Decoding Algorithms and Architectures for Reed–Solomon Codes

Generalized minimum distance decoding in Euclidean space: performance analysis

How often is hard-decision decoding enough?

Search properties of some sequential decoding algorithms

Generalized stack algorithms for decoding convolutional codes

Geometrical and performance analysis of GMD and Chase decoding algorithms

Similar Documents

Asymptotic optimality of the GMD and Chase decoding algorithms

Generalization of chase algorithms for soft decision decoding of binary linear codes

Error performance analysis for reliability-based decoding algorithms

Reduced GMD decoding

Fast Chase Decoding Algorithms and Architectures for Reed–Solomon Codes

Generalized minimum distance decoding in Euclidean space: performance analysis

How often is hard-decision decoding enough?

Search properties of some sequential decoding algorithms

Generalized stack algorithms for decoding convolutional codes

Geometrical and performance analysis of GMD and Chase decoding algorithms