NDLI: Efficient codeword recovery architecture for low-complexity Chase Reed-Solomon decoding

Content Provider	IEEE Xplore Digital Library
Author	Xinmiao Zhang Yu Zheng
Copyright Year	2011
Description	Author affiliation: Case Western Reserve University (Xinmiao Zhang; Yu Zheng)
Abstract	Compared to other soft-decision decoding algorithms of Reed-Solomon (RS) codes, the low-complexity Chase (LCC) algorithm can achieve better performance-complexity tradeoff. In order to reduce the complexity of the LCC decoding, the re-encoding and coordinate transformation techniques can be applied for high-rate codes. In this case, to recover a codeword for an (n, k) RS code, an erasure decoding needs to be employed after the errors in the k most reliable symbols are corrected by making use of the interpolation output. Alternatively, it can be done by reversing the coordinate transformation at the interpolation output followed by evaluating a polynomial of degree k over finite field elements. These approaches lead to significant overhead. A novel scheme and efficient architectures are proposed in this paper for codeword recovery in the LCC decoding. Our scheme computes the codeword symbols consecutively by applying the Chien search over the interpolation output and a polynomial of degree n-k. The Chien search can be implemented by constant multipliers, which cost much less area than general multipliers required by previous approaches. For the LCC decoding with eight test vectors for a (255, 239) RS code, adopting the proposed codeword recovery architecture can lead to 15% area reduction without sacrificing the throughput.
Starting Page	1
Ending Page	4
File Size	165296
Page Count	4
File Format	PDF
ISBN	9781457703607
e-ISBN	9781457703614
DOI	10.1109/ITA.2011.5743627
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-02-06
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Reed-Solomon codes Interpolation Computer architecture Polynomials Decoding Complexity theory Pipeline processing
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

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

Modified polynomial selection architecture for low-complexity chase decoding of Reed-Solomon codes

Systolic interpolation architectures for soft-decoding Reed-Solomon codes

Hardware complexities of low-complexity Chase Reed Solomon decoders and comparisons

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

Novel interpolation architecture for Low-Complexity Chase soft-decision decoding of Reed-Solomon codes

Reduced-complexity multi-interpolator algebraic soft-decision Reed-Solomon decoder

A Low-Complexity Method for Chase-Type Decoding of Reed-Solomon Codes

Low-complexity architecture for Chase soft-decision Reed-Solomon decoding

Efficient codeword recovery architecture for low-complexity Chase Reed-Solomon decoding

Similar Documents

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

Modified polynomial selection architecture for low-complexity chase decoding of Reed-Solomon codes

Systolic interpolation architectures for soft-decoding Reed-Solomon codes

Hardware complexities of low-complexity Chase Reed Solomon decoders and comparisons

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

Novel interpolation architecture for Low-Complexity Chase soft-decision decoding of Reed-Solomon codes

Reduced-complexity multi-interpolator algebraic soft-decision Reed-Solomon decoder

A Low-Complexity Method for Chase-Type Decoding of Reed-Solomon Codes

Low-complexity architecture for Chase soft-decision Reed-Solomon decoding

Efficient codeword recovery architecture for low-complexity Chase Reed-Solomon decoding