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.

Alain Glavieux

dblp:60/665 · DBLP profile ↗
← Back
7ranked-venue papers
1as first author
0since 2021 · last 2001
—ORCID · none

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

Computer networks · 6 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1

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
4 papers
Physical-layer communications · 100%
Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
channel coding
0.022001
Turbo equalization: adaptive equalization and channel decoding jointly optimized · IEEE J. Sel. Areas Commun. 2001
Orthogonal frequency division multiplexing with BFSK modulation in frequency selective Rayleigh and Rician fading channels · IEEE Trans. Commun. 1994
Physical-layer communications
equalization
0.012001
Turbo equalization: adaptive equalization and channel decoding jointly optimized · IEEE J. Sel. Areas Commun. 2001
Physical-layer communications › channel coding › decoding algorithms
iterative decoding
0.012001
Turbo equalization: adaptive equalization and channel decoding jointly optimized · IEEE J. Sel. Areas Commun. 2001
Physical-layer communications › equalization
joint equalization and decoding
0.012001
Turbo equalization: adaptive equalization and channel decoding jointly optimized · IEEE J. Sel. Areas Commun. 2001
Physical-layer communications › channel coding › decoding algorithms › iterative decoding
turbo decoding
0.012001
Turbo equalization: adaptive equalization and channel decoding jointly optimized · IEEE J. Sel. Areas Commun. 2001
Physical-layer communications › equalization
turbo equalization
0.012001
Turbo equalization: adaptive equalization and channel decoding jointly optimized · IEEE J. Sel. Areas Commun. 2001
Coding theory › error-correcting codes
convolutional codes
0.011996
Near optimum error correcting coding and decoding: turbo-codes · IEEE Trans. Commun. 1996
Coding theory
error-correcting codes
0.011996
Near optimum error correcting coding and decoding: turbo-codes · IEEE Trans. Commun. 1996
Coding theory › error-correcting codes › convolutional codes › convolutional encoders
recursive systematic convolutional codes
0.011996
Near optimum error correcting coding and decoding: turbo-codes · IEEE Trans. Commun. 1996
Coding theory › channel coding
turbo codes
0.011996
Near optimum error correcting coding and decoding: turbo-codes · IEEE Trans. Commun. 1996
Physical-layer communications › spread spectrum
frequency hopping
0.021990
Error probability of fast frequency hopping spread spectrum with BFSK modulation in selective Rayleigh and selective Rician fading channels · IEEE Trans. Commun. 1990
Equal gain diversity improvement in fast frequency hopping spread spectrum multiple-access (FFH-SSMA) communications over Rayleigh fading channels · IEEE J. Sel. Areas Commun. 1989
Physical-layer communications
spread spectrum
0.021990
Error probability of fast frequency hopping spread spectrum with BFSK modulation in selective Rayleigh and selective Rician fading channels · IEEE Trans. Commun. 1990
Equal gain diversity improvement in fast frequency hopping spread spectrum multiple-access (FFH-SSMA) communications over Rayleigh fading channels · IEEE J. Sel. Areas Commun. 1989
Physical-layer communications › fading channels › frequency-selective fading
frequency-selective fading channels
0.011994
Orthogonal frequency division multiplexing with BFSK modulation in frequency selective Rayleigh and Rician fading channels · IEEE Trans. Commun. 1994
Physical-layer communications › signal detection
noncoherent detection
0.011994
Orthogonal frequency division multiplexing with BFSK modulation in frequency selective Rayleigh and Rician fading channels · IEEE Trans. Commun. 1994
Physical-layer communications › channel modeling
frequency-selective channel
0.012001
Turbo equalization: adaptive equalization and channel decoding jointly optimized · IEEE J. Sel. Areas Commun. 2001
Physical-layer communications › interference
intersymbol interference
0.012001
Turbo equalization: adaptive equalization and channel decoding jointly optimized · IEEE J. Sel. Areas Commun. 2001
Physical-layer communications › modulation › frequency-shift keying
BFSK
0.011990
Error probability of fast frequency hopping spread spectrum with BFSK modulation in selective Rayleigh and selective Rician fading channels · IEEE Trans. Commun. 1990
Physical-layer communications
fading channels
0.011990
Error probability of fast frequency hopping spread spectrum with BFSK modulation in selective Rayleigh and selective Rician fading channels · IEEE Trans. Commun. 1990
Physical-layer communications
modulation
0.011990
Error probability of fast frequency hopping spread spectrum with BFSK modulation in selective Rayleigh and selective Rician fading channels · IEEE Trans. Commun. 1990
Physical-layer communications › fading channels › fading models
rayleigh and rician fading
0.011990
Error probability of fast frequency hopping spread spectrum with BFSK modulation in selective Rayleigh and selective Rician fading channels · IEEE Trans. Commun. 1990
Physical-layer communications › diversity
diversity techniques
0.011989
Equal gain diversity improvement in fast frequency hopping spread spectrum multiple-access (FFH-SSMA) communications over Rayleigh fading channels · IEEE J. Sel. Areas Commun. 1989
Physical-layer communications › diversity combining
equal gain combining
0.011989
Equal gain diversity improvement in fast frequency hopping spread spectrum multiple-access (FFH-SSMA) communications over Rayleigh fading channels · IEEE J. Sel. Areas Commun. 1989
Physical-layer communications › fading channels
rayleigh fading
0.011989
Equal gain diversity improvement in fast frequency hopping spread spectrum multiple-access (FFH-SSMA) communications over Rayleigh fading channels · IEEE J. Sel. Areas Commun. 1989

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

soft-input soft-output decoding · 0.0adaptive equalization · 0.0iterative decoding · 0.0extrinsic information · 0.0bit error rate analysis · 0.0bit error probability derivation · 0.0noncoherent demodulation · 0.0
YearPublicationVenuePosition
2001 Turbo equalization: adaptive equalization and channel decoding jointly optimized
abstract
This paper deals with a receiver scheme where adaptive equalization and channel decoding are jointly optimized in an iterative process. This receiver scheme is well suited for transmissions over a frequency-selective channel with large delay spread and for high spectral efficiency modulations. A low-complexity soft-input soft-output M-ary channel decoder is proposed. Turbo equalization allows intersymbol interference to be reduced drastically. For most time-invariant discrete channels, the turbo-equalizer performance is close to the coded Gaussian channel performance, even for low signal-to-noise ratios. Finally, results over a time-varying frequency-selective channel proves the excellent behavior of the turbo equalizer.
Christophe Laot, Alain Glavieux, Joël Labat
IEEE J. Sel. Areas Commun.2
1997 Turbo-Detection: A New Approach to Combat Channel Frequency Selectivity
abstract
In this paper, a receiver is proposed to combat intersymbol interference (ISI) generated over a frequency selective channel. The receiver is based on a symbol detector and a channel decoder separated by a deinterleaver. Through an iterative detecting-decoding process, using turbo-codes principle, the so-called turbo-detector manages to overcome frequency selectivity, especially over a Gaussian channel. Simulation results show the turbo-detector efficiency over both Gaussian and GSM channels.
Annie Picart, Pierre Didier, Alain Glavieux
ICC (3)3
1996 Near optimum error correcting coding and decoding: turbo-codes
abstract
This paper presents a new family of convolutional codes, nicknamed turbo-codes, built from a particular concatenation of two recursive systematic codes, linked together by nonuniform interleaving. Decoding calls on iterative processing in which each component decoder takes advantage of the work of the other at the previous step, with the aid of the original concept of extrinsic information. For sufficiently large interleaving sizes, the correcting performance of turbo-codes, investigated by simulation, appears to be close to the theoretical limit predicted by Shannon.
Claude Berrou, Alain Glavieux
IEEE Trans. Commun.2
1994 Orthogonal frequency division multiplexing with BFSK modulation in frequency selective Rayleigh and Rician fading channels
abstract
The performance of noncoherent reception with orthogonal frequency division multiplexing (OFDM) and binary frequency-shift-keying (BFSK) modulation over multipath fading channels with noise is investigated. This analysis demonstrates that it is possible to transmit information in selective channels with no symbol interference. Expressions of the bit error probability (BEP) are derived in the context of frequency selective Rayleigh and frequency selective Rician fading channels with and without convolutional coding.>
Alain Glavieux, Pierre Y. Cochet, Annie Picart
IEEE Trans. Commun.1
1990 Error probability of fast frequency hopping spread spectrum with BFSK modulation in selective Rayleigh and selective Rician fading channels
abstract
The performance of noncoherent reception in fast frequency hopped spread-spectrum (FFH-SS) communication systems operating through noisy, fading multipath channels is investigated. Systems operating with binary frequency-shift keying (BFSK) modulation and noncoherent demodulation are examined under the assumption of very slow fading. These analyses demonstrate the frequency hopping benefits in selective channels. Expressions are derived for the bit error rate in the context of selective Rayleigh and selective Rician fading channels, as a function of channel and system parameters.>
Bassel Solaiman, Alain Glavieux, Alain Hillion
IEEE Trans. Commun.2
1989 Equal gain diversity improvement in fast frequency hopping spread spectrum multiple-access (FFH-SSMA) communications over Rayleigh fading channels
abstract
The authors present the performance analysis of an FFH-SSMA system with a binary frequency-shift keying modulation scheme and noncoherent demodulation, operating in a combined environment of Rayleigh selective fading, other users interference, and additive white Gaussian noise. Improvement due to the use of equal gain diversity (EGD) is studied in terms of bit-error rate (BER). Expressions of the BER are evaluated when a maximum-likelihood decision criterion is used to show the advantages of the use of frequency hopping selective Rayleigh fading channels. Results show the equivalence between frequency hopping and direct-sequence (DS) modulation in combating multipath fading. The performance, in terms of irreducible error probability, of the system under study and that of the DS-CPSK when using EGD are not significantly different.>
Bassel Solaiman, Alain Glavieux, Alain Hillion
IEEE J. Sel. Areas Commun.2
1988 Performance of a slow frequency hopping BFSK system using convolutional coding in underwater acoustic media
abstract
The noncoherent reception performance of a slow frequency-hopped binary frequency-shift-keying (SFH-BFSK) modulation scheme in an underwater acoustic channel is investigated. Expressions of the bit error rate (BER) are obtained in the context of Rayleigh selective and Rician selective fading channels as a function of channel and system parameters. Improvements due to the use of error correcting codes (convolutional coding with Viterbi decoding algorithm) are investigated. Because of the difficulty in exact evaluation of the BER, upper bounds are generally used. In this case, the Monte Carlo simulation approach was used to obtain numerical results for high BERs. The Union-Bhattacharyya upper bound is used for low BERs.>
Bassel Solaiman, Alain Glavieux, Alain Hillion
ICASSP2