Papers by Matteo Albanese
2004 Ieee 15th International Symposium on Personal Indoor and Mobile Radio Communications, 2004
The authors present a method for computing the probability of undetected error of hybrid ARQ over... more The authors present a method for computing the probability of undetected error of hybrid ARQ over the Gilbert-Elliott channel. The method described by Elliott is extended to the case where the code is used for error detection and error correction simultaneously (hybrid ARQ. type-I). This analytical approach to the evaluation of the probability of undetected error allows to calculate the throughput as a function of the code rate and length, and to design systems that maximize the throughput, given the channel parameters and the desired undetected error probability.
Tit, 2004
This correspondence presents performance analysis of symbol-level soft-decision decoding of-ary m... more This correspondence presents performance analysis of symbol-level soft-decision decoding of-ary maximum-distance-separable (MDS) codes based on the ordered statistics algorithm. The method we present is inspired by the one recently proposed by Agrawal and Vardy, who approximately evaluate the performance of generalized minimum-distance decoding. The correspondence shows that in our context, the method allows to compute the exact value of the probability that the transmitted codeword is not one of the candidate codewords. This leads to a close upper bound on the performance of the decoding algorithm. Application of the ordered statistics algorithm to MDS codes is not new. Nevertheless, its advantages seem not to be fully explored. We show an example where the decoding algorithm is applied to singly extended 16-ary Reed-Solomon (RS) codes in a 128-dimensional multilevel coded-modulation scheme that approaches the sphere lower bound within 0.5 dB at the word error probability of 10 with manageable decoding complexity.
Ieee Transactions on Information Theory, 2004
This correspondence presents performance analysis of symbol-level soft-decision decoding of-ary m... more This correspondence presents performance analysis of symbol-level soft-decision decoding of-ary maximum-distance-separable (MDS) codes based on the ordered statistics algorithm. The method we present is inspired by the one recently proposed by Agrawal and Vardy, who approximately evaluate the performance of generalized minimum-distance decoding. The correspondence shows that in our context, the method allows to compute the exact value of the probability that the transmitted codeword is not one of the candidate codewords. This leads to a close upper bound on the performance of the decoding algorithm. Application of the ordered statistics algorithm to MDS codes is not new. Nevertheless, its advantages seem not to be fully explored. We show an example where the decoding algorithm is applied to singly extended 16-ary Reed-Solomon (RS) codes in a 128-dimensional multilevel coded-modulation scheme that approaches the sphere lower bound within 0.5 dB at the word error probability of 10 with manageable decoding complexity.
Ieee Transactions on Communications, Oct 1, 2008
In this paper two symbol-level soft-decision decoding algorithms for Reed-Solomon codes, derived ... more In this paper two symbol-level soft-decision decoding algorithms for Reed-Solomon codes, derived form the Ordered Statistics (OS) and from the Generalized Minimum-Distance (GMD) decoding methods, are presented and analyzed. Both the OS and the GMD algorithms are based on the idea of producing a list of candidate code words, among which the one having the larger likelihood is selected as output. We propose variants of the mentioned algorithms that allow to finely tune the size of the list in order to obtain the desired decoding complexity. The method proposed by Agrawal and Vardy for computing the error probability of the GMD algorithm is extended to our decoding methods. Examples are presented where these algorithms are applied to singly-extended Reed-Solomon codes over GF(16) used as outer codes in a 128-dimensional coded modulation scheme that attains good performance, with manageable decoding complexity.
The 13th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, 2002
The authors describe a multilevel coded modulation scheme that has been designed for being implem... more The authors describe a multilevel coded modulation scheme that has been designed for being implemented on FPGA. The goal of the design is to obtain good performance while keeping decoding delay and computational complexity as low as possible. This goal is obtained by a two-level scheme, where the partition chain of the 8-dimensional Gosset lattice is associated to a combination of 16-ary convolutional and block codes, at the first and second level respectively. The motivations behind the design choices are illustrated and the implementation on FPGA is presented. The authors conclude by analyzing the performance of the system and by showing experimental results.
Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674), 2003
Abstract - The authors propose and analyze a re-duced complexity ordered statistics decoding algo... more Abstract - The authors propose and analyze a re-duced complexity ordered statistics decoding algorithm for maximum-distance separable codes. The proposed algo-rithm provides a high degree of flexibility in the maxi-mum number of candidate code words tested by the algo- ...
Communications, IEEE Transactions …, 2008
AbstractIn this paper two symbol-level soft-decision de-coding algorithms for Reed-Solomon codes... more AbstractIn this paper two symbol-level soft-decision de-coding algorithms for Reed-Solomon codes, derived form the Ordered Statistics (OS) and from the Generalized Minimum-Distance (GMD) decoding methods, are presented and analyzed. Both the OS and the GMD ...
ABSTRACT The authors present an analysis and the FPGA implementation of an ordered statistics dec... more ABSTRACT The authors present an analysis and the FPGA implementation of an ordered statistics decoder for the singly extended Reed-Solomon code seRS(16,14). The goal of the design is to maintain good performance while reducing computational complexity and area with respect to the maximum-likelihood decoder of the same code or a Viterbi decoder of a high-rate punctured convolutional code of comparable performance. The authors also analyse a multilevel coded modulation system based on the partition chain E8/RE8/2E8, that makes use of a rate-1/2 16-ary convolutional code at the first level and of the seRS(16,14) code at the second level. This scheme is well suited to STM1 data transmission (155.52 Mbit/s) with 28 MHz channel spacing and 256 QAM modulation.
Uploads
Papers by Matteo Albanese