2009 IEEE Power &Amp; Energy Society General Meeting 2009
DOI: 10.1109/pes.2009.5275212
|View full text |Cite
|
Sign up to set email alerts
|

Sliding window recursive DFT with dyadic downsampling — A new strategy for time-varying power harmonic decomposition

Abstract: DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
11
0

Year Published

2010
2010
2021
2021

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 14 publications
(11 citation statements)
references
References 9 publications
0
11
0
Order By: Relevance
“…In [6], for example, a method based on the formulas derived from the analysis of errors of the DFT is present and good results are archived, but the proposed tracking is focused only on the fundamental component. In [24], a sliding-window recursive DFT is proposed and it is further improved in [25] by the usage of a downsampling operator before the extraction of each group of harmonics to be analyzed. Good results are presented in [24] and better ones in [25], but both proposals are vulnerable to frequency variation and interharmonics.…”
Section: B Time-frequency Representationsmentioning
confidence: 99%
See 2 more Smart Citations
“…In [6], for example, a method based on the formulas derived from the analysis of errors of the DFT is present and good results are archived, but the proposed tracking is focused only on the fundamental component. In [24], a sliding-window recursive DFT is proposed and it is further improved in [25] by the usage of a downsampling operator before the extraction of each group of harmonics to be analyzed. Good results are presented in [24] and better ones in [25], but both proposals are vulnerable to frequency variation and interharmonics.…”
Section: B Time-frequency Representationsmentioning
confidence: 99%
“…In [24], a sliding-window recursive DFT is proposed and it is further improved in [25] by the usage of a downsampling operator before the extraction of each group of harmonics to be analyzed. Good results are presented in [24] and better ones in [25], but both proposals are vulnerable to frequency variation and interharmonics. In [26], a hybrid method that uses both STFT and Wavelet Multi-resolution Analysis (MRA) [27] is proposed to the study of transient waveforms.…”
Section: B Time-frequency Representationsmentioning
confidence: 99%
See 1 more Smart Citation
“…Many solutions have been proposed in the relevant literature to overcome the spectral leakage problems by using DFT-based methods or parametric methods, such as Prony and Estimation of Signal Parameters by Rotational Invariance Technique (ESPRIT) [24][25][26][27][28][29][30]. In particular, in [27,28], the Sliding-Window Prony method and the Sliding-Window ESPRIT method were used to provide an accurate estimation of both the harmonic and interharmonic components with high-frequency resolution, but the computational burden was excessive.…”
Section: Introductionmentioning
confidence: 99%
“…These signals are injected sequentially including silence space of one cycle between two consecutive MGS signals. After the injection of each modulated signal, the SWRDFT [14] is used to process the signals and extract the impedance at modulated frequency. The main advantage of this methodology is that instead of injecting a single signal that has energy in a large frequency range, small signals are injected in different frequencies, so it is possible to have control of all spectra of interest.…”
Section: Introductionmentioning
confidence: 99%