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

Gent Paparisto

dblp:35/10936 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1999
—ORCID · none

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

Computer networks · 2 · 2 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 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications › signal processing for communications
array signal processing
0.011999
PSP array processing for multipath fading channels · IEEE Trans. Commun. 1999
Physical-layer communications
channel estimation
0.011999
PSP array processing for multipath fading channels · IEEE Trans. Commun. 1999
Physical-layer communications › fading channels
multipath fading channel
0.011999
PSP array processing for multipath fading channels · IEEE Trans. Commun. 1999
Physical-layer communications › signal detection › sequence estimation
per-survivor processing
0.011999
PSP array processing for multipath fading channels · IEEE Trans. Commun. 1999

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

stochastic gradient estimation · 0.0per-survivor processing · 0.0
YearPublicationVenuePosition
1999 PSP array processing for multipath fading channels
abstract
The performance of per-survivor processing (PSP) algorithms with stochastic gradient estimators is investigated for frequency-selective channels and array measurements. The focus is on the degree to which the underlying channel structure can be reliably exploited by such algorithms in tracking the time-varying channel and detecting the data.
Gent Paparisto, Keith M. Chugg
IEEE Trans. Commun.1
1998 The performance of adaptive MLSD for frequency-selective channels with array measurements
abstract
The problem of performing adaptive maximum likelihood sequence detection (MLSD) for a slowly time-varying, frequency-selective, multipath channel based on array measurements is considered. Two adaptive MLSD algorithms with LMS estimation of the overall channel (i.e., all filtering and physical channel effects) are compared through simulations: conventional adaptive MLSD (CA-MLSD) and per survivor processing (PSP) based adaptive MLSD. The results suggest that PSP based adaptive MLSD is particularly effective and robust to variations in the channel structure, level of dynamics, delay spread profile, and timing offsets. Analytical characterization of the PSP based algorithm is developed. This algorithm has the additional advantage that it may be fully initialized with the same training overhead used in current single-antenna systems for channel identification.
Gent Paparisto, Keith M. Chugg
ICC1