Riccardo Raheli

Prof. Dr. Riccardo Raheli

orcid

Research Focus & Metrics

Academic Career Length

38Years (1989-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 February 1995 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
RRRiccardo Raheli
Riccardo Raheli
APA. Polydoros
A. Polydoros
CTChing-Kae Tzou
Ching-Kae Tzou
Per-survivor processing (PSP) provides a general framework for the approximation of maximum likelihood sequence estimation (MLSE) algorithms whenever the presence of unknown quantities prevents the precise use of the classical Viterbi algorithm. This principle stems from the idea that data-aided estimation of unknown parameters may be embedded into the structure of the Viterbi algorithm itself. Among the numerous possible applications, the authors concentrate on (a) adaptive MLSE, (b) simultaneous trellis coded modulation (TCM) decoding and phase synchronization, (c) adaptive reduced state sequence estimation (RSSE). As a matter of fact, PSP is interpretable as a generalization of decision feedback techniques of RSSE to decoding in the presence of unknown parameters. A number of algorithms for the simultaneous estimation of data sequence and unknown channel parameters are presented and compared with "conventional" techniques based on the use of tentative decisions. Results for uncoded modulations over interSymbol interference (ISI) fading channels and joint TCM decoding and carrier synchronization are presented. In all cases, it is found that PSP algorithms are clearly more robust than conventional techniques both in tracking a time-varying channel and acquiring its characteristics without training.

1 January 1999 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
GCGiulio Colavolpe
Giulio Colavolpe
RRRiccardo Raheli
Riccardo Raheli
In this paper, new noncoherent sequence detection algorithms for combined demodulation and decoding of coded linear modulations transmitted over additive white Gaussian noise channels, possibly affected by intersymbol interference, are presented. Optimal sequence detection in the presence of a random rotation of the signal phase, assumed to be constant during the entire transmission, requires a receiver complexity exponentially increasing with the duration of the transmission. Based on proper approximations, simple suboptimal detection schemes based on the Viterbi algorithm are presented, whose per- formance approaches that of coherent detection. In a companion paper by Colavolpe and Raheli, noncoherent sequence detection is extended to continuous phase modulations. In the proposed schemes, the tradeoff between complexity and performance is simply controlled by a parameter, referred to as implicit phase memory, and the number of states of a trellis diagram. Besides being realizable, these schemes have the convenient feature of allowing us to remove the constant phase assumption and encompass time-varying phase models. The proposed schemes compare favorably with other solutions previously proposed in the technical literature.

1 January 2000 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
GCGiulio Colavolpe
Giulio Colavolpe
Gianluigi FerrariGianluigi Ferrari
Gianluigi Ferrari
RRRiccardo Raheli
Riccardo Raheli
Recently, noncoherent sequence detection schemes for coded linear and continuous phase modulations have been proposed, which deliver hard decisions by means of a Viterbi algorithm. The current trend in digital transmission systems toward iterative decoding algorithms motivates an extension of these schemes. In this paper, we propose two noncoherent soft-output decoding algorithms. The first solution has a structure similar to that of the well-known algorithm by Bahl et al.(BCJR), whereas the second is based on noncoherent sequence detection and a reduced-state soft-output Viterbi algorithm. Applications to the combined detection and decoding of differen- tial or convolutional codes are considered. Further applications to noncoherent iterative decoding of turbo codes and serially concate- nated interleaved codes are also considered. The proposed nonco- herent detection schemes exhibit moderate performance loss with respect to corresponding coherent schemes and are very robust to phase and frequency instabilities.

27 January 2009 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
RPRiccardo Pighi
Riccardo Pighi
MFMichele Franceschini
Michele Franceschini
Gianluigi FerrariGianluigi Ferrari
Gianluigi Ferrari
RRRiccardo Raheli
Riccardo Raheli
In this paper, we investigate the ultimate performance limits, in terms of achievable information rate (IR), of communication systems impaired by impulse noise. We compare single carrier (SC) and multi-carrier (MC) transmission systems employing quadrature amplitude modulation (QAM) formats. More precisely, we consider SC schemes with coded modulations and MC systems based on orthogonal frequency division modulation (OFDM). For the MC schemes, we introduce a theoretically equivalent channel model which makes the computation of the IR feasible. This simple channel model will be referred to as interleaved MC. We show that, in the presence of impulse noise and except for systems operating at very high spectral efficiency, the IR of MC schemes is lower than that of SC schemes. More precisely, use of MC schemes may lead to an unavoidable fundamental loss with respect to SC schemes at typical coding rates, whereas MC schemes are to be preferred for very high coding rates or in uncoded systems. These results hold for additive white Gaussian noise (AWGN) and dispersive channels, either considering plain OFDM or MC schemes employing water-filling and bit-loading algorithms. In order to validate our theoretical results, we also obtain the bit error rate (BER) performance of SC and MC schemes through Monte Carlo simulations. A few trellis-coded modulation (TCM) and low-density parity-check (LDPC)-coded schemes are considered. The obtained SNR loss in the BER curves between the AWGN and impulse noise channels matches well with the corresponding IR gap.

11 December 2006 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
MFMichele Franceschini
Michele Franceschini
Gianluigi FerrariGianluigi Ferrari
Gianluigi Ferrari
RRRiccardo Raheli
Riccardo Raheli
In this letter, we discuss the performance of low-density parity-check (LDPC) codes on memoryless channels. Using a recently proposed analysis technique based on extrinsic information transfer (EXIT) charts, we present an interpretation of the known fact that the bit-error rate (BER) performance of an ensemble of LDPC codes shows little dependence on the specific memoryless channel. This result has been partially observed in the literature for symmetric channels and is here extended to asymmetric channels. We conjecture and demonstrate that the performance of an ensemble of LDPC codes depends primarily and solely on the mutual information (MI) between the input and the output of the channel. As a validation of this conjecture, we compare the performance of a few LDPC codes with various rates for five representative memoryless (both symmetric and asymmetric) channels, obtaining results in excellent agreement with the EXIT chart-based prediction

1 January 1997 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
GCGiulio Colavolpe
Giulio Colavolpe
RRRiccardo Raheli
Riccardo Raheli