Collaborative Decoding of Interleaved Reed-Solomon Codes and Concatenated Code Designs

نویسندگان

  • Georg Schmidt
  • Vladimir Sidorenko
  • Martin Bossert
چکیده

Interleaved Reed–Solomon codes are applied in numerous data processing, data transmission, and data storage systems. They are generated by interleaving several codewords of ordinary Reed–Solomon codes. Usually, these codewords are decoded independently by classical algebraic decoding methods. However, by collaborative algebraic decoding approaches, such interleaved schemes allow the correction of error patterns beyond half the minimum distance, provided that the errors in the received signal occur in bursts. In this work, collaborative decoding of interleaved Reed–Solomon codes by multi-sequence shift-register synthesis is considered and analyzed. Based on the framework of interleaved Reed–Solomon codes, concatenated code designs are investigated, which are obtained by interleaving several Reed–Solomon codes, and concatenating them with an inner block code.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Collaborative Decoding of Interleaved Reed-Solomon Codes using Gaussian Elimination

We propose an alternative method for collaborative decoding of interleaved Reed-Solomon codes. Simulation results for a concatenated coding scheme using polar codes as inner codes are included.

متن کامل

On bit-error probability of a concatenated coding scheme

This paper presents a method for evaluating the bit-error probability of a concatenated coding system for BPSK transmission over the AWGN channel. In the concatenated system, a linear binary block code is used as the inner code and is decoded with the soft-decision maximum likelihood decoding, and a maximum distance separable code (or its interleaved code) is used as the outer code and is decod...

متن کامل

An Efficient Construction and Low Complexity Collaborative Decoding of Reed-Solomon Concatenated with Modified Polar Codes

Polar codes are the first explicit code sequences that provably achieve capacity for discrete memory-less channels. However, their performance with successive cancellation (SC) decoding is unimpressive at practical block-lengths. In this paper, we propose a scheme of concatenating Reed-Solomon (RS) with modified polar codes to improve the performance of SC. Firstly, short repetition block codes...

متن کامل

Unambiguous Decoding of Generalized Reed–Solomon Codes Beyond Half the Minimum Distance

The Schmidt–Sidorenko–Bossert scheme extends a low-rate Reed–Solomon code to an Interleaved Reed–Solomon code and achieves the decoding radius of Sudan’s original list decoding algorithm while the decoding result remains unambiguous. We adapt this result to the case of Generalized Reed– Solomon codes and calculate the parameters of the corresponding Interleaved Generalized Reed–Solomon code. Fu...

متن کامل

Optimal thresholds for GMD decoding with ℓ+1 over ℓ-extended Bounded Distance decoders

We investigate threshold–based multi–trial decoding of concatenated codes with an inner Maximum–Likelihood decoder and an outer error/erasure l+1 l –extended Bounded Distance decoder, i.e. a decoder which corrects ε errors and τ erasures if l+1 l ε+τ ≤ d−1, where d is the minimum distance of the outer code and l ∈ N\{0}. This is a generalization of Forney’s GMD decoding, which was considered on...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 55  شماره 

صفحات  -

تاریخ انتشار 2009