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

Ching-Kae Tzou

dblp:26/10900 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1995
—ORCID · none

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

Computer networks · 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
1 paper
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › channel estimation
adaptive channel estimation
0.011995
Per-Survivor Processing: a general approach to MLSE in uncertain environments · IEEE Trans. Commun. 1995
Physical-layer communications › synchronization
carrier synchronization
0.011995
Per-Survivor Processing: a general approach to MLSE in uncertain environments · IEEE Trans. Commun. 1995
Physical-layer communications
channel estimation
0.011995
Per-Survivor Processing: a general approach to MLSE in uncertain environments · IEEE Trans. Commun. 1995
Physical-layer communications › signal detection › sequence estimation
maximum-likelihood sequence estimation
0.011995
Per-Survivor Processing: a general approach to MLSE in uncertain environments · IEEE Trans. Commun. 1995
Physical-layer communications › signal detection › sequence estimation
per-survivor processing
0.011995
Per-Survivor Processing: a general approach to MLSE in uncertain environments · IEEE Trans. Commun. 1995
Physical-layer communications › synchronization
phase synchronization
0.011995
Per-Survivor Processing: a general approach to MLSE in uncertain environments · IEEE Trans. Commun. 1995
Physical-layer communications › signal detection
sequence estimation
0.011995
Per-Survivor Processing: a general approach to MLSE in uncertain environments · IEEE Trans. Commun. 1995
Physical-layer communications › modulation › coded modulation
trellis-coded modulation
0.011995
Per-Survivor Processing: a general approach to MLSE in uncertain environments · IEEE Trans. Commun. 1995

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

viterbi algorithm · 0.0decision feedback · 0.0
YearPublicationVenuePosition
1995 Per-Survivor Processing: a general approach to MLSE in uncertain environments
abstract
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.>
Riccardo Raheli, Andreas Polydoros, Ching-Kae Tzou
IEEE Trans. Commun.3