We propose a soft-decision Reed-Solomon (RS) decoding algorithm, which uses the combined approaches of the Chase and the generalized minimum distance (GMD) algorithms and exploits the recursive property of interpolation-based RS decoding algorithms. We evaluate the performance of this Chase- GMD type algorithm on perpendicular magnetic recording systems, and present simulation results that show that we can achieve better performance with fairly short latency and lower decoding complexity than the current state-of-art algorithms.

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.

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.

Increasingly, the change of telecom service management takes on more integrated features with the application of service level agreements. Although the TOM model can provide a generic reference framework for the organization of SLA-based management functions, there are still unresolved SLA-particular issues in management scenarios, especially on the measurement problem in an SLA. We first analyze the special aspects of SLA measurability problem. Aided by the service end-to-end view, we present a two-phased QoS metrics integration approach to fulfill the expected SLA measurability. In phase 1, the model collects the crude performance metrics in the network and then integrates the metrics to the whole QoS effects in an SLA (SLA measurability) in two directions.

A reduced complexity implementation of a soft Chase algorithm for algebraic soft-decision decoding of Reed-Solomon (RS) codes, based on the recently proposed algorithm of Koetter and Vardy, is presented. The reduction in complexity is obtained at the algorithm level by integrating the re-encoding and Chase algorithms and at the architecture level by considering a backup mode which sharply reduces the average computational complexity of the hybrid decoder.

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.

A soft-decision Reed-Solomon decoding algorithm has been recently proposed by Koetter and Vardy, which provides significant coding gains by fully utilizing channel output reliability information. The algorithm converts this reliability information into a set of interpolation points and their multiplicities, and consists of three day steps: multiplicity matrix calculation, soft interpolation, and polynomial factorization. Large coding gains have been observed only for low-rate codes in additive white Gaussian noise channels, and with very high decoding complexity. Here we present a new suboptimal algorithm for computing the multiplicity matrix, discuss architectures for soft-decision decoders and evaluate the performance of the soft-decision algorithm on magnetic recording channels in the presence of erasures.