ScholarLens Back to search
2010•Unpublished venueRequires access

Hardware complexities of algebraic soft-decision Reed-Solomon decoders and comparisons

Xinmiao Zhang, Jiangli Zhu

Open publisher page 4 citations

Abstract

Algebraic soft-decision (ASD) decoding of Reed-Solomon (RS) codes can achieve significant coding gain over hard-decision decoding. For practical implementation purpose, ASD algorithms with simple multiplicity assignment schemes are preferred. This paper answers the question of which practical ASD algorithm has lower hardware complexity. In addition, decoder complexity comparisons for an example (458, 410) RS code constructed over GF(210) are presented. This paper also provides discussions on how the hardware complexities of ASD decoders change with codeword length, code rate and other parameters.

About this research paper

What this paper is about

Algebraic soft-decision (ASD) decoding of Reed-Solomon (RS) codes can achieve significant coding gain over hard-decision decoding. For practical implementation purpose, ASD algorithms with simple multiplicity assignment schemes are preferred. This paper answers the question of which practical ASD algorithm has lower hardware complexity. In addition, decoder complexity comparisons for an example (458, 410) RS code constructed over GF(210) are presented. This paper also provides discussions on how the hardware complexities of ASD decoders change with codeword length, code rate and other parameters.

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Algebraic soft-decision (ASD) decoding of Reed-Solomon (RS) codes can achieve significant coding gain over hard-decision decoding. For practical implementation purpose, ASD algorithms with simple multiplicity assignment schemes are preferred. This paper answers the question of which practical ASD algorithm has lower hardware complexity. In addition, decoder complexity comparisons for an example (458, 410) RS code constructed over GF(210) are presented. This paper also provides discussions on how the hardware complexities of ASD decoders change with codeword length, code rate and other parameters.

Key concepts: Decoding methods, Code word, Computer science, Coding (social sciences), Algebraic number, Reed–Solomon error correction, Theoretical computer science, Code (set theory)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Hardware complexities of algebraic soft-decision Reed-Solomon decoders and comparisons — Research Paper | ScholarLens