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

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

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
90
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
6
2
2

Relationship

0
10

Authors

Journals

citations
Cited by 92 publications
(101 citation statements)
references
References 3 publications
0
90
0
Order By: Relevance
“…This is accomplished by the multiplication of the input signal x½n by the modulation sequence W −k n N . This approach allows to exclude the complex twiddle factor from the resonator and avoids accumulated errors and potential instabilities [9]. The recursive realization of the mSDFT is:…”
Section: Modulated Sliding Discrete Fourier Transformmentioning
confidence: 99%
“…This is accomplished by the multiplication of the input signal x½n by the modulation sequence W −k n N . This approach allows to exclude the complex twiddle factor from the resonator and avoids accumulated errors and potential instabilities [9]. The recursive realization of the mSDFT is:…”
Section: Modulated Sliding Discrete Fourier Transformmentioning
confidence: 99%
“…1 is known. In [8], [11] it is suggested to use the sliding discrete Fourier transform (SDFT) [12]- [14] to calculate the fundamental voltage U s1 and current I s1 components based on consecutive measurement samples (shown in Fig. 6) in a computationally efficient manner.…”
Section: Load Angle Estimationmentioning
confidence: 99%
“…DFT may be computed recursively using sliding window techniques [17]. Main problem associated with computing DFT of power grid signals is its spectral leakage resulting from varying fundamental frequency of the grid.…”
Section: Power System Modelmentioning
confidence: 99%