scispace - formally typeset
Search or ask a question
Author

M. Rouanne

Bio: M. Rouanne is an academic researcher from University of Notre Dame. The author has contributed to research in topics: Turbo code & Berlekamp–Welch algorithm. The author has an hindex of 1, co-authored 1 publications receiving 136 citations.

Papers
More filters
Journal ArticleDOI
TL;DR: An algorithm to compute the distance spectrum of linear, regular, and quasiregular trellis codes is presented, derived from a bidirectional stack algorithm, although it could also be based on the Viterbi algorithm.
Abstract: A class of quasiregular codesis defined for which the distance spectrum can be calculated from the codeword corresponding to the all-zero information sequence. Convolutional codes and regular codes are both quasiregular, as well as most of the best known trellis codes. An algorithm to compute the distance spectrum of linear, regular, and quasiregular trellis codes is presented. In particular, it can calculate the weight spectrum of convolutional (linear trellis) codes and the distance spectrum of most of the best known trellis codes. The codes do not have to be linear or regular, and the signals do not have to be used with equal probabilities. The algorithm is derived from a bidirectional stack algorithm, although it could also be based on the Viterbi algorithm. The algorithm is used to calculate the beginning of the distance spectrum of some of the best known trellis codes and to compute tight estimates on the first-event-error probability and on the bit-error probability. >

136 citations


Cited by
More filters
Journal ArticleDOI
TL;DR: The authors apply a general method of bounding the event error probability of TCM (trellis-coded modulation) schemes to fading channels and use the effective length and the minimum-squared-product distance to replace theminimum-free-squaring-Euclidean distance as code design parameters for Rayleigh and Rician fading channels with a substantial multipath component.
Abstract: The authors apply a general method of bounding the event error probability of TCM (trellis-coded modulation) schemes to fading channels and use the effective length and the minimum-squared-product distance to replace the minimum-free-squared-Euclidean distance as code design parameters for Rayleigh and Rician fading channels with a substantial multipath component. They present 8-PSK (phase-shift-keying) trellis codes specifically constructed for fading channels that outperform equivalent codes designed for the AWGN (additive white Gaussian noise) channel when v>or=5. For quasiregular trellis codes there exists an efficient algorithm for evaluating event error probability, and numerical results which demonstrate the importance of the effective length as a code design parameter for fading channels with or without side information have been obtained. This is consistent with the case for binary signaling, where the Hamming distance remains the best code design parameter for fading channels. The authors show that the use of Reed-Solomon block codes with expanded signal sets becomes interesting only for large value of E/sub s//N/sub 0/, where they begin to outperform trellis codes. >

265 citations

Book
01 Jan 2004
TL;DR: This chapter discusses Communication Theory Basics, Convolutional Codes, Parallel Concatenation, and Turbo Coded Modulation, as well as some of the techniques used in Turbo Codes, which were developed in the second edition of this book.
Abstract: 1. Introduction. 2. Communication Theory Basics. 3. Trellis Coded Modulation. 4. Convolutional Codes. 5. Link to Block Codes. 6. Performance Bounds. 7. Decoding Strategies. 8. Factor Graphs. 9. Low-Density Parity Check Codes. 10. Parallel Concatenation (Turbo Codes). 11. Serial Concatenation. 12. Turbo Coded Modulation.

225 citations

Journal ArticleDOI
TL;DR: Coded APSK, recently selected for the new standard -DVB-S2- for digital video broadcasting and interactive broadband satellite services, is shown to represent a powerand spectral-efficient solution for satellite nonlinear channels.
Abstract: This paper investigates the performance of M-ary amplitude-phase shift keying (APSK) digital modulation over typical nonlinear satellite channels. The effect of the satellite nonlinearity is studied, and distortion pre- and post-compensation techniques for coded APSK are presented. Moreover, clock timing, signal amplitude and carrier phase recovery schemes are discussed. For the latter, a new class of non turbo decoder-aided closed-loop phase synchronizers featuring good performance and low complexity is studied. Finally, an end-to-end coded APSK system simulator inclusive of the satellite channel model and synchronization sub-systems is discussed and its performance compared to standard trellis-coded QAM concatenated with Reed-Solomon codes, showing a remarkable gain in both power and spectral efficiency. Coded APSK, recently selected for the new standard -DVB-S2- for digital video broadcasting and interactive broadband satellite services, is shown to represent a powerand spectral-efficient solution for satellite nonlinear channels

197 citations

Book
20 Jun 2006
TL;DR: Upper and lower bounds on the error probability of linear codes under ML decoding are surveyed and applied to codes and ensembles of codes on graphs and establish the goodness of linear Codes under optimal maximum-likelihood (ML) decoding.
Abstract: This article is focused on the performance evaluation of linear codes under optimal maximum-likelihood (ML) decoding. Though the ML decoding algorithm is prohibitively complex for most practical codes, their performance analysis under ML decoding allows to predict their performance without resorting to computer simulations. It also provides a benchmark for testing the sub-optimality of iterative (or other practical) decoding algorithms. This analysis also establishes the goodness of linear codes (or ensembles), determined by the gap between their achievable rates under optimal ML decoding and information theoretical limits. In this article, upper and lower bounds on the error probability of linear codes under ML decoding are surveyed and applied to codes and ensembles of codes on graphs. For upper bounds, we discuss various bounds where focus is put on Gallager bounding techniques and their relation to a variety of other reported bounds. Within the class of lower bounds, we address de Caen's based bounds and their improvements, and also consider sphere-packing bounds with their recent improvements targeting codes of moderate block lengths.

190 citations

Patent
21 Apr 2003
TL;DR: In this article, joint error control coding and linear precoding techniques are proposed for fading-resilient transmissions over frequency- at and frequency-selective fading channels encountered with high-rate wireless OFDM transmissions.
Abstract: In general, joint error-control coding and linear precoding techniques are proposed for fading-resilient transmissions over frequency- at and frequency-selective fading channels encountered with high-rate wireless OFDM transmissions. For example, a wireless communication system includes a transmitter that applies non-linear codes and a linear precoder to a data stream to produce a joint coded-precoded waveform. A receiver receives the joint coded-precoded waveform from the transmitter via a wireless communication channel, and demodulates the joint-coded precoded waveform to produce estimated data. The combination offers a multiplicative benefit to the diversity achievable by the wireless communication system.

113 citations