scispace - formally typeset
Journal ArticleDOI

The Hopping Discrete Fourier Transform [sp Tips&Tricks]

Reads0
Chats0
TLDR
The discrete Fourier transform produces a Fourier representation for finite-duration data sequences and plays a key role in the implementation of a variety of digital signal-?processing algorithms.
Abstract
The discrete Fourier transform (DFT) produces a Fourier representation for finite-duration data sequences. In addition to its theoretical importance, the DFT plays a key role in the implementation of a variety of digital signal-?processing algorithms. Several algorithms including the fast Fourier transform (FFT) and the Goertzel algorithm have been introduced for the fast implementation of the DFT [1], [2].

read more

Citations
More filters
Journal ArticleDOI

2D Discrete Fourier Transform on Sliding Windows

TL;DR: The theoretical analysis shows that the computational requirement of the proposed 2D SDFT algorithm is the lowest among existing 2D DFT algorithms, and the output of the 2DSDFT is mathematically equivalent to that of the traditional DFT at all pixel positions.
Journal ArticleDOI

Fast, Accurate, and Guaranteed Stable Sliding Discrete Fourier Transform [sp Tips&Tricks]

TL;DR: A new guaranteed stable SDFT (gSDFT) algorithm of which the computational requirement is the lowest among the existing stable S DFT algorithms and is mathematically equivalent to that of the DFT regardless of the window size and the time index.
Journal ArticleDOI

Fast Computation of Sliding Discrete Tchebichef Moments and Its Application in Duplicated Regions Detection

TL;DR: This paper presents an efficient algorithm for the fast computation of one-dimensional and two-dimensional sliding discrete Tchebichef moments and proposes an original way to fast compute the moments of one window by utilizing the moment values of its previous window.
Proceedings ArticleDOI

Integration of an IEEE Std. C37.118 compliant PMU into a real-time simulator

TL;DR: The design and the deployment of a C37.118 class-P compliant PMU into the Opal-RT RTS is illustrated and the simulated PMU has been experimentally validated and demonstrated to be well suited for its integration into any RTS.
Journal ArticleDOI

Time-Variant In-Circuit Impedance Monitoring Based on the Inductive Coupling Method

TL;DR: Experimental results show that with careful design consideration, the proposed method has the ability to measure the in-circuit impedance of a time-variant system in real time, which facilitates useful inputs for early detection of abnormality of the monitored electrical system that is time variant in nature.
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

Accurate, Guaranteed Stable, Sliding Discrete Fourier Transform [DSP Tips & Tricks]

TL;DR: The twiddle factor from the feedback in a traditional SDFT resonator is removed and thus the finite precision of its representation is no longer a problem and the accumulated errors and potential instabilities are drastically reduced in the mSDFT.
Journal ArticleDOI

Generalized sliding FFT and its application to implementation of block LMS adaptive filters

TL;DR: The generalized sliding fast Fourier transform (GSFFT) as an efficient implementation of the hopping FFT is introduced, and the frequency domain block LMS (FBLMS) adaptive filters are revised, and their implementations for block lengths less than the length of the adaptive filter are studied.