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

Emmanuel Jaffrot

dblp:15/2230 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
0since 2021 · last 2007
—ORCID · none

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

Computer networks · 3Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

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 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications
diversity
0.012003
Recursive receivers for diversity channels with correlated flat fading · IEEE J. Sel. Areas Commun. 2003
Physical-layer communications
fading channels
0.012003
Recursive receivers for diversity channels with correlated flat fading · IEEE J. Sel. Areas Commun. 2003
Physical-layer communications
receiver design
0.012003
Recursive receivers for diversity channels with correlated flat fading · IEEE J. Sel. Areas Commun. 2003
Physical-layer communications
channel modeling
0.012003
Recursive receivers for diversity channels with correlated flat fading · IEEE J. Sel. Areas Commun. 2003
Physical-layer communications
state-space model
0.012003
Recursive receivers for diversity channels with correlated flat fading · IEEE J. Sel. Areas Commun. 2003

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

sequence detection · 0.0kalman filtering · 0.0a posteriori probability · 0.0
YearPublicationVenuePosition
2007 Computationally Efficient Algorithm for Optimal Power Allocation in Multicarrier Systems with Peak-Power Constraint
abstract
Multicarrier systems have shown better performance measures when system parameters (power, bits etc.) are optimized over different frequencies with respect to the channel gain factor. On the other hand stringent wireless spectrum constraints requiring inter-system spectrum sharing are giving birth to peak-power constrained multicarrier systems like MB-OFDM (A. Batra et al., 2004) based UWB system that rely on limiting peak emission power in order to inhibit interference with other systems using the same frequency spectrum. Power optimization for such systems must incorporate the additional peak-power constraint and at the same time respect the crucial time constraints of a very high data-rate system like that of UWB. This work addresses both of these issues by first analytically solving the peak power constrained BER minimizing power allocation problem and finally an important contribution comes in the development of a simplistic implementation algorithm which is found to converge faster than some recently proposed solutions based on iterative waterfilling for optimal power allocation in peak-power constrained systems.
Asad Mahmood, Emmanuel Jaffrot
VTC Spring2
2007 Greedy Check Allocation for Irregular LDPC Codes Optimization in Multicarrier Systems
abstract
The capacity approaching performances (Richardson et al., 2001) of different types of low density parity check (LDPC) codes have led them to undergo extensive research in recent years. Along with asymptotic performances analysis, the optimization of 'irregularity' profile for different channels and the performance analysis of practical finite-length codes has also been extensively explored. With multi-carrier communications becoming the physical layer choice for many emerging wireless systems, a feasible solution for optimizing the irregularity profile of irregular LDPC codes for a frequency selective channel is a problem of particular importance and interest. This paper proposes a simple-to-implement greedy 'check' allocation (GCA) based method for the construction of BER-optimized irregular LDPC codes using the criterion of Gallager upper bound (Gallager, 1962) for probabilistic decoding. A comparison of our GCA algorithm with some existing works (Mannoni et al., 2002) on the irregular LDPC codes optimization for multicarrier systems based on the classical Gaussian approximation of the 'density evolution' approach, shows that the same irregularity behavior can be achieved with a much simpler method.
Asad Mahmood, Emmanuel Jaffrot
WCNC2
2006 An Efficient Methodology for Optimal Discrete Bit-Loading with Spectral Mask Constraints
abstract
The recent adoption of ultra-wideband (UWB) technology for applications involving short-range very high data- rate wireless communication necessitates efficient allocation of system resources (bits, power etc.) because of the stringent spectral mask constraints. The multiband-OFDM(MB-OFDM) based UWB proposal permits usage of adaptive resource allocation over different sub-carriers so as to efficiently respond to the frequency-selective nature of the UWB channel.This paper proposes a new discrete bit-allocation methodology that results in minimizing power consumption for a fixed throughput and which appears to converge to the optimal solution faster than most known optimal discrete bit-loading methods. With peak- power-constraint and channel gain factor given for a sub-carrier, the sufficient condition for determining maximum permissible number of bits is also established. While earlier bit-loading algorithms have mostly targeted the ADSL-type systems, UWB application scenario is targeted in this paper to seek the total energy improvement factor with respect to a non-adaptive UWB system. However, the allocation methodology can be used for any multi-carrier based system.
Asad Mahmood, Emmanuel Jaffrot
GLOBECOM2
2004 Wavelet based channel model for OFDM systems
abstract
In this paper, we present first ideas on how highly time and frequency selective channels may be modeled using wavelet decomposition. This approach is compared to a previously developed channel model using Karhunen-Loeve decomposition. We focus our study on OFDM systems, but this means no restriction with respect to the application of such a modeling technique.
Emmanuel Jaffrot
PIMRC1
2003 Recursive receivers for diversity channels with correlated flat fading
abstract
This paper addresses the design and performance of time-recursive receivers for diversity based communication systems with flat Rayleigh or Ricean fading. The paper introduces a general state-space model for such systems, where there is temporal correlation in the channel gain. Such an approach encompasses a wide range of diversity systems such as spatial diversity, frequency diversity, and code diversity systems which are used in practice. The paper describes a number of noncoherent receiver structures derived from both sequence and a posteriori probability-based cost functions and compares their performance using an orthogonal frequency-division multiplex example. In this example, the paper shows how a standard physical delay-Doppler scattering channel model can be approximated by the proposed state-space model. The simulations show that significant performance gains can be made by exploiting temporal, as well as diversity channel correlations. The paper argues that such time-recursive receivers offer some advantages over block processing schemes such as computational and memory requirement reductions and the easier incorporation of adaptivity in the receiver structures.
Van Khanh Nguyen, Langford B. White, Emmanuel Jaffrot, Marcella Soamiadana, Inbar Fijalkow
IEEE J. Sel. Areas Commun.3
2000 Turbo channel estimation for OFDM systems on highly time and frequency selective channels
abstract
We propose an optimum turbo channel estimation algorithm for OFDM systems on highly selective fading channels. This algorithm performs an iterative estimation of the multiplicative fading channel according to the maximum a posteriori criterion. It requires a convenient representation of the highly time and frequency selective fading channel based on the Karhunen-Loeve expansion theorem. It also optimally takes into account the coded structure of the data symbols in the estimation process thanks to the Bahl (1974) algorithm.
Emmanuel Jaffrot, Mohamed Siala 0001
ICASSP1