Frequency estimation, phase unwrapping and the nearest lattice point problem

Authors:
I. V. L. Clarkson
Affiliations:
Dept. of Electr. & Electron. Eng., Melbourne Univ., Parkville, Vic., Australia
Venue:
ICASSP '99 Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03
Year:
1999

Citing 0
Cited 4

Frequency estimation by phase unwrapping

IEEE Transactions on Signal Processing
Polynomial-phase estimation, phase unwrapping and the nearest lattice point problem

Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Linear-time nearest point algorithms for coxeter lattices

IEEE Transactions on Information Theory
A time-frequency technique for blind separation and localization of pure delayed sources

LVA/ICA'10 Proceedings of the 9th international conference on Latent variable analysis and signal separation

Quantified Score

Hi-index	0.06

Visualization

Abstract

In this paper, we examine the relationship between frequency estimation and phase unwrapping and a problem in algorithmic number theory known as the nearest lattice point problem. After briefly reviewing the theory of these three topics, we introduce an interpretation of the maximum likelihood frequency estimation problem as a nearest lattice point problem. We develop an algorithm based on this approach and present numerical results to compare its performance with other estimation techniques. We find that the algorithm has good powers of estimation.