2020
DOI: 10.1109/msp.2020.2982167
|View full text |Cite
|
Sign up to set email alerts
|

An Observer-Based Adaptive Fourier Analysis [Tips & Tricks]

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
9
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(9 citation statements)
references
References 13 publications
0
9
0
Order By: Relevance
“…• Architecture: radix-2, radix-4, or pipelined streaming • Transform length: 2 3 − 2 16 • Data representation: fixed or floating point • Data handling: scaling and rounding • Output ordering • Resource usage The goal of the applied FFT design is to aim for the highest achievable processing speed. This way the best comparison can be made with the processing speeds of the oSDFT structures.…”
Section: Fft Ipmentioning
confidence: 99%
See 1 more Smart Citation
“…• Architecture: radix-2, radix-4, or pipelined streaming • Transform length: 2 3 − 2 16 • Data representation: fixed or floating point • Data handling: scaling and rounding • Output ordering • Resource usage The goal of the applied FFT design is to aim for the highest achievable processing speed. This way the best comparison can be made with the processing speeds of the oSDFT structures.…”
Section: Fft Ipmentioning
confidence: 99%
“…This structure is highly stable and insensitive to numerical precision errors due to its control feedback loop [14]. Moreover, its added benefit is that it can be used efficiently for various applications, such as frequency estimation [15], [16], system identification [17] or digital filtering [13]. The disadvantage of this structure is that all the frequency bins -not just the ones of interest -must be calculated, as an observer first deconstructs the signal then reconstructs an estimation which is also used for the global control feedback loop.…”
Section: Introductionmentioning
confidence: 99%
“…A previously published sliding spectrum analysis network cleverly implements a bank of N paths where each path is equivalent to the complex resonator in Figure 2 tuned to a frequency of 2k/N radians/sample [11,12]. The value for k in each path are one of the integers in the set k  {1,2,...,N-1}.…”
Section: Comparison With Previously Published Sdft Algorithmsmentioning
confidence: 99%
“…Other than increasing k and N, at the cost of additional computations alternate processing techniques can be effective in reducing the unwanted non-integer k SDFT output magnitude fluctuations. Those techniques are: 1) performing simple unity-gain lowpass filtering of the Figure 7(b) output magnitude samples; 2) implementing time-domain windowing of the input signal by means of frequency-domain convolution [1]; 3) if a real-valued input signal is a single tone we can convert that input signal to a positive-frequency only analytic signal, prior to SDFT processing, using a Hilbert transform network [14] (note that unlike the other listed options, this Hilbert option will not reduce the fluctuations caused by additional input frequency components); and 4) using the oSDFT networks in [11,12] will eliminate unwanted signal magnitude tracking fluctuations because their sinc frequency functions stretch rather than shift to provide complete attenuation of a real-valued input signal's negative-frequency spectral components and a periodic input signal's harmonics.…”
Section: Integer K and Non-integer K Sdft Signal Tracking Examplesmentioning
confidence: 99%
“…The leakage can be reduced by various omethods [25][26][27][28][29], which are mostly based on the estimation of fundamental frequency. However, the optimal measurement condition is to make the sampling process satisfy the requirement of coherent sampling for both the fundamental frequency and its harmonic frequencies simultaneously, which significantly increases the spectral resolution of the FFT and creates an ideal environment for critically ADDR performance evaluation of the DUT.…”
Section: Leakagementioning
confidence: 99%