Asymptotic theory for a fast frequency detector
Sid Yakowitz · IEEE Transactions on Information Theory · 1993
A fast technique for efficient online signal detection and tracking is extended by analyzing the asymptotic distribution of the detector. A version of the technique is seen to have potentially greater precision than other fast estimators, the upper bound being O(1/n/sup 2/3/). Coupled with another device, there is potential for achieving the convergence precision of the maximum likelihood estimate, which, by conventional methods, entails considerably computational expense.>