A Chase-type algorithm for soft-decision Reed-Solomon decoding on Rayleigh fading channels
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.
- SourceAvailable from: ucsd.edu
Conference Proceeding: Iterative soft-decision Reed-Solomon decoding on partial response channels[show abstract] [hide abstract]
ABSTRACT: Since the discovery of turbo codes, iterative decoding has gained enormous momentum. The idea of repeatedly passing information between components of a receiver or decoder to increase the overall system performance has attracted much research effort. In this work, we present an iterative soft-decision decoding architecture for Reed-Solomon (RS) codes on a partial-response (PR) channel. The architecture incorporates a symbol-based a-posteriori probability (APP) detector for the channel, and an enhanced soft-decision RS decoder based upon the recently introduced Koetter-Vardy (KY) algorithm. From the list of candidate RS codewords generated by the KV decoder, we calculate output symbol reliabilities that can be fed back to the APP detector as extrinsic information to be used in a subsequent decoding iteration. Through simulations, we show the efficacy of this approach, especially when the initial KV list size is large. We will also propose ways to modify the decoding scheme in order to beneficially increase the size of the candidate codeword list and thereby improve the overall system performance.Global Telecommunications Conference, 2003. GLOBECOM '03. IEEE; 01/2004
- [show abstract] [hide abstract]
ABSTRACT: A class of decoding algorithms that utilizes channel measurement information, in addition to the conventional use of the algebraic properties of the code, is presented. The maximum number of errors that can, with high probability, be corrected is equal to one less than d , the minimum Hamming distance of the code. This two-fold increase over the error-correcting capability of a conventional binary decoder is achieved by using channel measurement (soft-decision) information to provide a measure of the relative reliability of each of the received binary digits. An upper bound on these decoding algorithms is derived, which is proportional to the probability of an error for d th order diversity, an expression that has been evaluated for a wide range of communication channels and modulation techniques. With the aid of a lower bound on these algorithms, which is also a lower bound on a correlation (maximum-likelihood) decoder, we show for both the Gaussian and Rayleigh fading channels, that as the signal-to-noise ratio (SNR) increases, the asymptotic behavior of these decoding algorithms cannot be improved. Computer simulations indicate that even for !ow SNR the performance of a correlation decoder can be approached by relatively simple decoding procedures. In addition, we study the effect on the performance of these decoding algorithms when a threshold is used to simplify the decoding process.IEEE Transactions on Information Theory 02/1972; · 2.62 Impact Factor
Article: Algebraic coding theory /[show abstract] [hide abstract]
ABSTRACT: Includes Pascal computer program. Thesis (B.S.)--James Madison University, 1995. Includes bibliographical references (leaf 52).