Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Romain Piton

dblp:19/6348 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2008
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Physical-layer communications · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications
channel estimation
0.112008
A Divergence Minimization Approach to Joint Multiuser Decoding for Coded CDMA · IEEE J. Sel. Areas Commun. 2008
Physical-layer communications › channel coding › decoding algorithms › iterative decoding
iterative multiuser decoding
0.112008
A Divergence Minimization Approach to Joint Multiuser Decoding for Coded CDMA · IEEE J. Sel. Areas Commun. 2008
Physical-layer communications › signal detection
multiuser detection
0.112008
A Divergence Minimization Approach to Joint Multiuser Decoding for Coded CDMA · IEEE J. Sel. Areas Commun. 2008
Physical-layer communications
code-division multiple access
0.012008
A Divergence Minimization Approach to Joint Multiuser Decoding for Coded CDMA · IEEE J. Sel. Areas Commun. 2008

Methods — techniques the papers use, named apart from their topics

factor graph · 0.1expectation-maximization · 0.1divergence minimization · 0.1SAGE · 0.1
YearPublicationVenuePosition
2008 A Divergence Minimization Approach to Joint Multiuser Decoding for Coded CDMA
abstract
In this paper, a theoretical framework of divergence minimization (DM) is applied to derive iterative receiver algorithms for coded CDMA systems. The DM receiver obtained performs joint channel estimation, multiuser decoding, and noise- covariance estimation. While its structure is similar to that of many ad-hoc receivers in the literature, the DM receiver is the result of applying a formal framework for optimization without further simplifications, namely the DM approach with a factorizable auxiliary model distribution. The well-known expectation- maximization (EM) algorithm and space-alternating generalized expectation-maximization (SAGE) algorithm are special cases of degenerate model distributions within the DM framework. Furthermore, many ad-hoc receiver structures from literature are shown to represent approximations of the proposed DM receiver. The DM receiver has four interesting properties that all result directly from applying the formal framework: (i) The covariances of all estimates involved are taken into account, (ii) The residual interference after interference cancellation is handled by the noise-covariance estimation as opposed to by LMMSE filters in other receivers, (iii) Posterior probabilities of the code symbols are employed rather than extrinsic probabilities, (iv) The iterative receiver is guaranteed to converge in divergence. The theoretical insights are illustrated by simulation results.
Ingmar Land, Lars K. Rasmussen, Romain Piton, Bernard H. Fleury
IEEE J. Sel. Areas Commun.4
2007 A Bayesian Framework for Iterative Channel Estimation and Multiuser Decoding in Coded DS-CDMA
abstract
This paper deals with a novel design approach for a converging iterative receiver for coded CDMA that estimates both the channel coefficients and the transmitted symbols. The receiver design is based on the variational Bayesian space-alternating generalized expectation-maximization (VB-SAGE) method. Conceptually, the probability distribution of each user's code sequence and the probability distribution of all channel coefficients are updated in an iterative fashion. The obtained receiver, which we refer to as VB-SAGE receiver, performs iterative channel estimation, interference cancellation and single-user decoding. Even though the design is based on code sequence probabilities, only the soft decisions (mean values) and the variances of the code symbols are required for channel estimation and interference cancellation; moreover, the variances are functions of the soft decisions. These soft decisions are computed by the single-user decoders based on the outputs of the interference cancellation device. The iterative process of the VB-SAGE receiver is guaranteed to converge in the free energy. The VB-SAGE method proposed in this paper may also be used for other applications.
Ingmar Land, Romain Piton, Bernard H. Fleury
GLOBECOM3
2007 Iterative SAGE-Based Receivers for Synchronous Coded DS-CDMA
abstract
In this paper, the space alternating generalized expectation-maximization (SAGE) method is applied to derive receivers for coded CDMA systems. In the so-called SAGE receiver, hard decision code symbols are fed back from the single user decoders to the joint channel estimator and interference canceler. Using multivariate Gaussian approximations, the SAGE receiver is then modified such that soft values of code symbols are fed back from the single user decoders. We refer to this modified receiver as SAGE-based receiver. Compared to the SAGE receiver, the SAGE-based receiver considers the statistical properties of the code symbols, thus the channel estimation and the interference cancellation take symbol estimation errors into account. A performance improvement in terms of bit error rate (BER) and system load of the SAGE-based receiver compared to the SAGE receiver and other receivers is shown by means of Monte Carlo simulations.
Ingmar Land, Romain Piton, Bernard H. Fleury
VTC Fall3