Conference Paper

A Chase-type algorithm for soft-decision Reed-Solomon decoding on Rayleigh fading channels

Sch. of Electr. & Comput. Eng., Oklahoma Univ., Norman, OK, USA
DOI: 10.1109/GLOCOM.2003.1258537 Conference: Global Telecommunications Conference, 2003. GLOBECOM '03. IEEE, Volume: 3
Source: IEEE Xplore

ABSTRACT A soft-decision Reed-Solomon decoding algorithm has been proposed by Koetter and Vardy, which provides a significant coding gain by utilizing channel output reliability information. In this paper we present a Chase-type soft-decision algorithm which provides additional gains at the expense of a small increase in complexity. We evaluate the performance of this decoding algorithm on additive white Gaussian noise channel and Rayleigh fading channels. Simulation results show that coding gains on the order of several dB can be achieved on uncorrelated Rayleigh fading channels over traditional hard-decision Reed-Solomon decoding algorithms.

  • [Show abstract] [Hide abstract]
    ABSTRACT: Algebraic soft-decision Reed–Solomon (RS) decoding algorithms with improved error-correcting capability and comparable complexity to standard algebraic hard-decision algorithms could be very attractive for possible implementation in the next generation of read channels. In this work, we investigate the performance of a low-complexity Chase (LCC)-type soft-decision RS decoding algorithm, recently proposed by Bellorado and Kavčić, on perpendicular magnetic recording channels for sector-long RS codes of practical interest. Previous results for additive white Gaussian noise channels have shown that for a moderately long high-rate code, the LCC algorithm can achieve a coding gain comparable to the Koetter–Vardy algorithm with much lower complexity. We present a set of numerical results that show that this algorithm provides small coding gains, on the order of a fraction of a dB, with similar complexity to the hard-decision algorithms currently used, and that larger coding gains can be obtained if we use more test patterns, which significantly increases its computational complexity.
    Journal of Magnetism and Magnetic Materials. 01/2008;
  • [Show abstract] [Hide abstract]
    ABSTRACT: Type-II hybrid ARQ protocols are widely used in current packet-oriented systems, such as wireless ATM, in combination with powerful error-correction codes for robust transmission and high channel throughput. In this paper, we investigate Reed-Solomon codes and soft-decision decoding algorithms for type-II hybrid ARQ systems, which lead to improved performance and higher channel throughput.
    Global Telecommunications Conference, 2004. GLOBECOM '04. IEEE; 01/2004
  • [Show abstract] [Hide abstract]
    ABSTRACT: We propose efficient forward recursive algorithms for algebraic soft-decision list decoding of Reed-Solomon codes, which utilize channel reliability information, and outperform the Koetter-Vardy (KV) algorithm with lower decoding latency. We evaluate the performance of the proposed decoding algorithms on additive white Gaussian noise and partial response channels. Simulation results show that we can achieve better performance on a modified extended-extended partial response class 4 channel than on the best possible performance of the KV algorithm, as given by the asymptotic bound for high-rate codes.
    IEEE Transactions on Communications 08/2007; · 1.75 Impact Factor