Aravind R. Nayak

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

Demo Data from EDBT 2026 / reviewers in the wild / expert

dblp:58/1070 · DBLP profile ↗

← Back

2ranked-venue papers

2as first author

0since 2021 · last 2006

—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

2 papers

Physical-layer communications · 100%

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

Topic	Weight	Papers	Last	Evidence papers
Physical-layer communications › synchronization synchronization and timing recovery	0.1	2	2006	Timing Recovery With Frequency Offset and Random Walk: Cramér-Rao Bound and a Phase- Locked Loop Postprocessor · IEEE Trans. Commun. 2006 Timing Recovery With Frequency Offset and Random Walk: Cramer-Rao Bound and a Phase-Locked Loop Postprocessor · IEEE Trans. Commun. 2006
Physical-layer communications › synchronization › timing recovery timing recovery with frequency offset	0.1	2	2006	Timing Recovery With Frequency Offset and Random Walk: Cramér-Rao Bound and a Phase- Locked Loop Postprocessor · IEEE Trans. Commun. 2006 Timing Recovery With Frequency Offset and Random Walk: Cramer-Rao Bound and a Phase-Locked Loop Postprocessor · IEEE Trans. Commun. 2006
Physical-layer communications › signal processing for communications › statistical signal processing › estimation theory cramér-rao lower bound	0.0	2	2006	Timing Recovery With Frequency Offset and Random Walk: Cramér-Rao Bound and a Phase- Locked Loop Postprocessor · IEEE Trans. Commun. 2006 Timing Recovery With Frequency Offset and Random Walk: Cramer-Rao Bound and a Phase-Locked Loop Postprocessor · IEEE Trans. Commun. 2006
Physical-layer communications › synchronization phase-locked loop	0.0	2	2006	Timing Recovery With Frequency Offset and Random Walk: Cramér-Rao Bound and a Phase- Locked Loop Postprocessor · IEEE Trans. Commun. 2006 Timing Recovery With Frequency Offset and Random Walk: Cramer-Rao Bound and a Phase-Locked Loop Postprocessor · IEEE Trans. Commun. 2006
Physical-layer communications receiver design	0.0	2	2006	Timing Recovery With Frequency Offset and Random Walk: Cramér-Rao Bound and a Phase- Locked Loop Postprocessor · IEEE Trans. Commun. 2006 Timing Recovery With Frequency Offset and Random Walk: Cramer-Rao Bound and a Phase-Locked Loop Postprocessor · IEEE Trans. Commun. 2006

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

phase-locked loop · 0.1maximum a posteriori estimation · 0.1interpolation · 0.1

Year	Publication	Venue	Position
2006	Timing Recovery With Frequency Offset and Random Walk: Cramer-Rao Bound and a Phase-Locked Loop Postprocessor abstract We consider the problem of timing recovery for bandlimited, baud-rate sampled systems with intersymbol interference and a timing offset that can be modeled as a combination of a frequency offset and a random walk. We first derive the Cramer–Rao bound (CRB), which is a lower bound on the estimation-error variance for any timing estimator. Conventional timing recovery is based on a phase-locked loop (PLL). We compare the conventional timing recovery method with the CRB for realistic timing parameters for the magnetic recording channel, and observe a 7 dB signal-to-noise ratio gap between the two. Next, we propose a PLL postprocessor based on the maximum a posteriori estimation principle that performs to within 1.5 dB of the CRB. This postprocessor performs time-invariant filtering and time-varying scaling of the PLL timing estimates. The refined timing estimates from the postprocessor are then used to get refined samples by interpolating the samples taken at the PLL's timing estimates. Finally, we present suboptimal implementations that allow a performance-complexity tradeoff. Aravind R. Nayak, John R. Barry, German S. Feyh, Steven W. McLaughlin	IEEE Trans. Commun.	1
2006	Timing Recovery With Frequency Offset and Random Walk: Cramér-Rao Bound and a Phase- Locked Loop Postprocessor abstract We consider the problem of timing recovery for bandlimited, baud-rate sampled systems with intersymbol interference and a timing offset that can be modeled as a combination of a frequency offset and a random walk. We first derive the Crameacuter-Rao bound (CRB), which is a lower bound on the estimation error variance for any timing estimator. Conventional timing recovery is based on a phase-locked loop (PLL). We compare the conventional timing-recovery method with the CRB for realistic timing parameters for the magnetic recording channel, and observe a 7 dB signal-to-noise ratio gap between the two. Next, we propose a PLL postprocessor based on the maximum a posteriori estimation principle that performs to within 1.5 dB of the CRB. This postprocessor performs time-invariant filtering and time-varying scaling of the PLL timing estimates. The refined timing estimates from the postprocessor are then used to get refined samples by interpolating the samples taken at the PLL's timing estimates. Finally, we present suboptimal implementations that allow a performance-complexity tradeoff Aravind R. Nayak, John R. Barry, German S. Feyh, Steven W. McLaughlin	IEEE Trans. Commun.	1