NDLI: Module minimisation based low-complexity soft decoding of Reed

Content Provider	IET Digital Library
Author	Xing, Jiongyue Chen, Li Bossert, Martin
Abstract	The interpolation-based algebraic decoding for Reed–Solomon (RS) codes can correct errors beyond half of the code's minimum Hamming distance. Using soft information, the algebraic soft decoding (ASD) further improves the decoding performance. This paper presents a unified study of two classical ASD algorithms, the algebraic Chase decoding and the Koetter-Vardy decoding. Their computationally expensive interpolation is solved by the module minimisation (MM) technique which consists of basis construction and basis reduction. Compared with Koetter's interpolation, the MM interpolation yields a smaller computational cost for the two ASD algorithms. Re-encoding transform is further applied to reduce the decoding complexity by reducing the degree of module generators. Based on assessing the degree of module seeds, a complexity reducing approach is introduced to further facilitate the two ASD algorithms. Computational cost of the two algorithms as well as their re-encoding transformed variants will be analysed. Performance of the two ASD algorithms will be compared under decoding expenditure benchmark, providing more practical insights of their applications.
Starting Page	3489
Ending Page	3499
Page Count	11
ISSN	17518628
Volume Number	13
e-ISSN	17518636
Issue Number	Issue 20, Dec (2019)
Alternate Webpage(s)	https://digital-library.theiet.org/content/journals/iet-com/13/20
Alternate Webpage(s)	https://digital-library.theiet.org/content/journals/10.1049/iet-com.2019.0064
Journal	IET Communications
Publisher Date	2019-09-20
Access Restriction	Open
Rights Holder	© The Institution of Engineering and Technology
Subject Keyword	Algebraic Chase Decoding Algebraic Codes Algebraic Soft Decoding Classical ASD Algorithm Code Complexity Reducing Approach Computational Complexity Computationally Expensive Interpolation Decoding Decoding Complexity Decoding Expenditure Benchmark Decoding Performance Interpolation Interpolation And Function Approximation Interpolation-based Algebraic Decoding Koetter's Interpolation Koetter-Vardy Decoding Low-complexity Soft Decoding MM Interpolation Yields Module Generator Module Minimisation Technique Module Seed Numerical Analysis Re-encoding Transformed Variants Reed-Solomon Code Reed–Solomon Codes Soft Information
Content Type	Text
Resource Type	Article
Subject	Electrical and Electronic Engineering 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

Novel pipelined interpolator for low-complexity chase soft-decision Reed-Solomon decoder

Low-Complexity Chase Decoding of Reed–Solomon Codes Using Channel Evaluation

A Chase-type Koetter-Vardy algorithm for soft-decision Reed-Solomon decoding

Progressive Algebraic Soft-Decision Decoding of Reed-Solomon Codes

Progressive List-Enlarged Algebraic Soft Decoding of Reed-Solomon Codes

Efficient architecture for algebraic soft-decision decoding of Reed–Solomon codes

Iterative algebraic soft-decision list decoding of reed-solomon codes (2005).

Novel Interpolation and Polynomial Selection for Low-Complexity Chase Soft-Decision Reed-Solomon Decoding

Iterative multivariate interpolation for low complexity reed-solomon codes.

Module minimisation based low-complexity soft decoding of Reed–Solomon codes

Similar Documents

Novel pipelined interpolator for low-complexity chase soft-decision Reed-Solomon decoder

Low-Complexity Chase Decoding of Reed–Solomon Codes Using Channel Evaluation

A Chase-type Koetter-Vardy algorithm for soft-decision Reed-Solomon decoding

Progressive Algebraic Soft-Decision Decoding of Reed-Solomon Codes

Progressive List-Enlarged Algebraic Soft Decoding of Reed-Solomon Codes

Efficient architecture for algebraic soft-decision decoding of Reed–Solomon codes

Iterative algebraic soft-decision list decoding of reed-solomon codes (2005).

Novel Interpolation and Polynomial Selection for Low-Complexity Chase Soft-Decision Reed-Solomon Decoding

Iterative multivariate interpolation for low complexity reed-solomon codes.

Module minimisation based low-complexity soft decoding of Reed–Solomon codes