scispace - formally typeset
Journal ArticleDOI

Recursive sliding discrete Fourier transform with oversampled data

A. van der Byl, +1 more
- 01 Feb 2014 - 
- Vol. 25, pp 275-279
Reads0
Chats0
TLDR
This work shows that it is possible to compute a fine-grained spectral decomposition while increasing usable signal bandwidths through higher sampling rates, and takes the recursive approach one step further, and enables the processing of multiple samples acquired through oversampling, to update the spectral output.
About
This article is published in Digital Signal Processing.The article was published on 2014-02-01. It has received 11 citations till now. The article focuses on the topics: Non-uniform discrete Fourier transform & Discrete Fourier transform.

read more

Citations
More filters
Journal ArticleDOI

Improved discrete Fourier transform algorithm for harmonic analysis of rotor system

TL;DR: A new harmonic analysis approach based on an improved discrete Fourier transform algorithm is proposed, which can dramatically reduce the computation load through replacing multiplication by shift operation and is faster and more accurate than both the DFT- based methods and the FFT-based methods.
Proceedings ArticleDOI

Overview of voltage dips detection analysis methods

TL;DR: Categorization of harmonics estimation techniques and methods of signal analysis, both parametric and nonparametric, are explained and hybrid methods, recursive methods and methods based on artificial intelligence are presented.
Journal ArticleDOI

Constraining error-A sliding discrete Fourier transform investigation

TL;DR: The results highlight that the sliding discrete Fourier transform with error correction provides consistent error performance over a range of test cases, and indicates the limitations applicable to all techniques.
Posted Content

Digital Filter Designs for Recursive Frequency Analysis

TL;DR: In this paper, a review of existing recursive techniques for recursively computing the discrete Fourier transform (DFT) and estimating the frequency spectrum of sampled signals are examined, with an emphasis on magnitude-response and numerical stability.
References
More filters
Journal ArticleDOI

The sliding DFT

TL;DR: The sliding DFT process for spectrum analysis was presented and shown to be more efficient than the popular Goertzel (1958) algorithm for sample-by-sample DFT bin computations and a modified slide DFT structure is proposed that provides improved computational efficiency.
Journal ArticleDOI

An update to the sliding DFT

TL;DR: Those properties allow us to create Table 1, listing the appropriate arctan approximation based on the octant location of complex x, and to check the signs of Q and I, and see if |Q | > |I |, to determine theOctant location and then use the appropriate approximation in Table 1.
Journal ArticleDOI

Moving discrete Fourier transform

TL;DR: The moving fast Fourier transform (MFFT) algorithms developed in the paper apply to the particular case where the window is moved one data point along the signal between successive transforms, using less computation than in directly evaluating the new transform with the FFT algorithm.
Journal ArticleDOI

High resolution time delay estimation using sliding discrete Fourier transform

TL;DR: A novel time delay estimation approach based on sliding the discrete Fourier transform (DFT) analysis window, sample by sample, over the received short continuous wave (CW) pulse signal with the DFT evaluated successively.
Journal ArticleDOI

Analytic derivation of the finite wordlength effect of the twiddle factors in recursive implementation of the sliding-DFT

TL;DR: Analytic derivation of the erroneous effect is presented for the sliding-DFT, which is implemented in a recursive way with the finite-bit approximation of the twiddle factors, and obtained in a closed-form equation of the noise-to-signal power ratio.
Related Papers (5)