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

Improvements to the Sliding Discrete Fourier Transform Algorithm [Tips & Tricks]

Abstract: The IEEE Publication Services & Products Board (PSPB) last revised its Operations Manual Section 8.1.9 on Electronic Information Dissemination (known familiarly as "author posting policy") on 7 December 2012.PSPB accepted the recommendations of an ad hoc committee, which reviewed the policy that had previously been revised in November 2010. The highlights of the current policy are as follows: The policy reaffirms the principle that authors are free to post their own version of their IEEE periodical or confere… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 13 publications
(5 citation statements)
references
References 13 publications
(14 reference statements)
0
5
0
Order By: Relevance
“…The sliding transform efficiently computes frequencies using an incremental formula based on the relationship between adjacent frequency components in a short-time DFT/DCT/DST. SDFT is summarized in detail in the following papers [53]- [55].…”
Section: B Short-time Fourier and Sliding Transformsmentioning
confidence: 99%
“…The sliding transform efficiently computes frequencies using an incremental formula based on the relationship between adjacent frequency components in a short-time DFT/DCT/DST. SDFT is summarized in detail in the following papers [53]- [55].…”
Section: B Short-time Fourier and Sliding Transformsmentioning
confidence: 99%
“…In real-time application, the frequency-domain data must be processed frequently and promptly. Sliding DFT (SDFT) is deduced from the DFT circular shift property [26] with the time-domain sequence circularly shifted by one sample through multiplying e j 2πk N and the signal spectral being updated on a sample-by-sample basis [26], [27]. This attribute enables the SDFT to present higher computation efficiency and low computation cost than Fast Fourier Transform (FFT) in processing signals with selective frequencies [26].…”
Section: A Impedance Frequency Response Calculation By Gsdftmentioning
confidence: 99%
“…The linearization method as elaborated in [29] is applied to the non-linear matrices in (27) and the numerical values of the coefficient matrices A and B are further calculated by solving the corresponding linear algebraic equations.…”
Section: B Impedance Parameters Calculationmentioning
confidence: 99%
“…In [16], the SDFT was used for harmonic detection in the three-phase grid-tie inverter system; besides, SDFT has been often used in cooperation with the phase-locked loop for the stable operation and control of the grid-connected converters [17,18]. Although the SDFT algorithm is computationally efficient, this method still might have drawbacks, e.g., a slow dynamic performance and sensitivity to the frequency, and types of measures have been researched to make improvements [19], and types of improvements have been carried out in [20]. In [21], an adaptive sampling frequency based on the phase error was designed for the SDFT algorithm to improve the estimation accuracy.…”
Section: Introductionmentioning
confidence: 99%