A new algorithm for the estimation of the frequency of a complex exponential in additive Gaussian noise

Reisenfeld, Sam; Aboutanios, Elias

doi:10.1109/lcomm.2003.815637

Cited by 52 publications

(26 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [7], is selected as 2 to produce a fine frequency estimate , which has excellent performance but requires three iterations to approach CRB accurately (0.063 dB above the CRB) [7].…”

Section: Icsp2006 Proceedingsmentioning

confidence: 99%

See 1 more Smart Citation

Novel Frequency Estimation by Interpolation Using Fourier Coefficients

Xiao

Wei

2006

2006 8th International Conference on Signal Processing

View full text Add to dashboard Cite

A novel algorithm for estimating the frequency of a single complex sinusoid in complex white Gaussian noise is proposed. The proposed discrete Fourier transform -based algorithm performs a frequency interpolation on the results of an N point complex Fourier transform very well with a novel residue frequency discriminator. Simulation results are included to demonstrate that the estimator is unbiased and approaches the Cramér-Rao bound uniformly over the frequency estimation range. The algorithm has low computational complexity and is well suited for real time applications.

show abstract

“…In [7], is selected as 2 to produce a fine frequency estimate , which has excellent performance but requires three iterations to approach CRB accurately (0.063 dB above the CRB) [7].…”

Section: Icsp2006 Proceedingsmentioning

confidence: 99%

“…Various fine-frequency estimators have been proposed in the literature [1]- [7]. Zakharov and Tozer [4] present a simple algorithm that consists of an iterative binary search for the true signal frequency.…”

Section: Introductionmentioning

confidence: 99%

Novel Frequency Estimation by Interpolation Using Fourier Coefficients

Xiao

Wei

2006

2006 8th International Conference on Signal Processing

View full text Add to dashboard Cite

show abstract

“…FLL has more advantage in anti-noise capability than PLL, but tracking precision is lower. Based on the advantages of PLL and FLL, the most common way of carrier tracking is combining PLL with FLL, under the condition of low signal-to-noise rate and high dynamic [1][2][3]. By the method mentioned above, the anti-noise performance of carrier acquisition is not very good.…”

Section: Introductionmentioning

confidence: 99%

Fast Acquisition and Tracking for Carrier in High Dynamic Condition

Cheng

Pan

2012

2012 International Conference on Computer Science and Electronics Engineering

View full text Add to dashboard Cite

In order to actualize the fast synchronization of carrier in high dynamic, A New union carrier synchronization algorithm based on FFT and PLL (Phase Locked Loop) is proposed. The basic idea is that firstly get a coarse estimation by using the peak of a period gram and then gain an accurate estimation by using a new interpolation formula about the two lines beside the pea. Next, using the frequency as guide frequency, to control the frequency of the sine signal produced by the NCO (Numerically Controlled Oscillator). And finally achieve the goal of carrier synchronization through the adaptive algorithm of the PLL. With the method of real-time and precise estimation of carrier, it can reduce the tracking time in low signal-to-noise rate and high dynamic condition. The results show that it can effectively achieve the expectations of carrier quickly capture and carrier accurate tracking.

show abstract

“…Determining the frequencies, i.e., the locations of local maxima of the spectrum, is the most difficult problem in these methods. For this purpose, iterative algorithms have been applied [6][7][8][9][10], the nonparametric spectrum interpolation methods [11][12] are applicable (zero padding technique [13], chirped-Z transform [14][15][16][17], warped DFT [18][19][20] and interpolation by decimation [11]) and the methods of interpolated DFTs have been developed . Nonparametric spectrum interpolation methods make it possible to zoom in on the frequency domain but do not decrease the errors caused by long-range spectral leakage (i.e., by sidelobes of spectrum lines of neighbor components in the spectrum), which are defined by the frequency characteristic of the data window applied [47].…”

Section: Introduction: Spectral Analysis and The Unit Circle Approximmentioning

confidence: 99%

Minimization of Maximum Errors in Universal Approximation of the Unit Circle by a Polygon

Borkowski¹

2011

Metrology and Measurement Systems

View full text Add to dashboard Cite

This paper presents a universal approximation of the unit circle by a polygon that can be used in signal processing algorithms. Optimal choice of the values of three parameters of this approximation allows one to obtain a high accuracy of approximation. The approximation described in the paper has a universal character and can be used in many signal processing algorithms, such as DFT, that use the mathematical form of the unit circle. One of the applications of the described approximation is the DFT linear interpolation method (LIDFT). Applying the results of the presented paper to improve the LIDFT method allows one to significantly decrease the errors in estimating the amplitudes and frequencies of multifrequency signal components. The paper presents the derived formulas, an analysis of the approximation accuracy and the region of best values for the approximation parameters.

show abstract

A new algorithm for the estimation of the frequency of a complex exponential in additive Gaussian noise

Cited by 52 publications

References 3 publications

Novel Frequency Estimation by Interpolation Using Fourier Coefficients

Novel Frequency Estimation by Interpolation Using Fourier Coefficients

Fast Acquisition and Tracking for Carrier in High Dynamic Condition

Minimization of Maximum Errors in Universal Approximation of the Unit Circle by a Polygon

Contact Info

Product

Resources

About