Algebraic Soft-decision decoding of reed-solomon codes using bit-level soft information
Conference Paper
Overview
Identity
Additional Document Info
View All
Overview
abstract
The performance of algebraic soft-decision decoding (ASD) of Reed-Solomon (RS) codes using bit-level soft information is investigated. Based on the performance analysis of ASD over the binary erasure channel (BEC) and the binary symmetric channels (BSC) [10], we study the multiplicity assignment strategies (MAS) and the corresponding performance analysis of ASD for medium to high rate RS codes over a mixed bit-level error and erasure channel. The bit-level decoding region of the proposed MAS is shown to be significantly larger than that of conventional Berlekamp-Massey (BM) decoding. As an important application, a bit-level generalized minimum distance (BGMD) decoding algorithm is proposed. The proposed BGMD compares favorably with many other RS soft-decision decoding algorithms on various channels. Moreover, owing to the simplicity of BGMD, its performance can be tightly bounded using ordered statistics.