Algebraic Soft-Decision Decoding of Reed–Solomon Codes Using Bit-Level Soft Information

Authors:
Jing Jiang;K. R. Narayanan
Affiliations:
Qualcomm Inc., San Diego, CA;-
Venue:
IEEE Transactions on Information Theory
Year:
2008

Citing 0
Cited 8

A rate-distortion perspective on multiple decoding attempts for Reed-Solomon codes

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Application of pattern-output Viterbi algorithm to algebraic soft-decision decoding over partial response channels

IEEE Communications Letters
Code automorphisms and permutation decoding of certain Reed-Solomon binary images

IEEE Transactions on Information Theory
High-throughput interpolation architecture for algebraic soft-decision Reed-Solomon decoding

IEEE Transactions on Circuits and Systems Part I: Regular Papers
Algebraic soft-decision decoder architectures for long Reed-Solomon codes

IEEE Transactions on Circuits and Systems II: Express Briefs
Backward interpolation architecture for algebraic soft-decision reed-solomon decoding

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Modified Low-Complexity Chase Soft-Decision Decoder of Reed---Solomon Codes

Journal of Signal Processing Systems
Efficient Generalized Minimum-distance Decoders of Reed-Solomon Codes

Journal of Signal Processing Systems

Quantified Score

Hi-index	754.90

Visualization

Abstract

The performance of algebraic soft-decision decoding of Reed-Solomon codes using bit-level soft information is investigated. Optimal multiplicity assignment strategies for algebraic soft-decision decoding (SDD) with infinite cost are first studied over erasure channels and the binary-symmetric channel. The corresponding decoding radii are calculated in closed forms and tight bounds on the error probability are derived. The multiplicity assignment strategy and the corresponding performance analysis are then generalized to characterize the decoding region of algebraic SDD over a mixed error and bit-level erasure channel. The bit-level decoding region of the proposed multiplicity assignment strategy is shown to be significantly larger than that of conventional Berlekamp-Massey decoding. As an application, a bit-level generalized minimum distance decoding algorithm is proposed. The proposed decoding compares favorably with many other Reed-Solomon SDD algorithms over various channels. Moreover, owing to the simplicity of the proposed bit-level generalized minimum distance decoding, its performance can be tightly bounded using order statistics.