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

W. Shaw Yuan

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

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

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › synchronization
carrier synchronization
0.011999
Rapid carrier acquisition from baud-rate samples · IEEE Trans. Commun. 1999
Physical-layer communications › channel estimation
maximum likelihood estimation
0.011999
Rapid carrier acquisition from baud-rate samples · IEEE Trans. Commun. 1999
Physical-layer communications › signal processing for communications › signal parameter estimation
phase and frequency estimation
0.011999
Rapid carrier acquisition from baud-rate samples · IEEE Trans. Commun. 1999
Physical-layer communications › channel estimation
blind estimation
0.011999
Rapid carrier acquisition from baud-rate samples · IEEE Trans. Commun. 1999

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

maximum likelihood estimation · 0.0linearization · 0.0cramér-rao bound · 0.0
YearPublicationVenuePosition
1999 Rapid carrier acquisition from baud-rate samples
abstract
Maximum-likelihood estimation of phase and frequency offset involves the maximization of a nonlinear likelihood function. We develop an estimator for carrier acquisition by linearizing the likelihood-function, and show that its performance is close to the Cramer-Rao bound (CRB). The estimator is then extended to blind frequency acquisition and combined with testing to eliminate unlikely hypotheses. With proper modeling of the likelihood resulting from the blind search, simulations show that the algorithm quickly rejects all but the correct frequency hypothesis.
W. Shaw Yuan, Costas N. Georghiades
IEEE Trans. Commun.1