A Non-Feedback-Loop and Low-Computation- Complexity Algorithm Design for a Novel 2-D Sliding DFT Computation

This paper presents a forward-path, novel, two-dimensional (2-D) sliding discrete Fourier transform (SDFT) algorithm based on the column-row 2-D DFT concept and the shifted window property. After applying a descending dimension method (DDM), a mixed-radix and butterfly-based structure can be further...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE access Jg. 7; S. 104912 - 104920
Hauptverfasser: Juang, Wen-Ho, Lai, Shin-Chi
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Piscataway IEEE 2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithms
column-row 2-D DFT
Complexity
Computation
Computational complexity
DDM-based 2-D SDFT
descending dimension method (DDM)
Discrete Fourier transforms
Feedback loops
Fourier transforms
Mathematical analysis
Microsoft Windows
Multiplication
Signal processing algorithms
Sliding
Sliding discrete Fourier transform (SDFT)
Time-frequency analysis
Two dimensional displays
two-dimension SDFT (2-D SDFT)
ISSN:2169-3536, 2169-3536
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper presents a forward-path, novel, two-dimensional (2-D) sliding discrete Fourier transform (SDFT) algorithm based on the column-row 2-D DFT concept and the shifted window property. After applying a descending dimension method (DDM), a mixed-radix and butterfly-based structure can be further employed to effectively implement the proposed algorithm. Conceptually, it has many advantages, including greater stability, more accuracy, and less computational complexity because there are no extra feedback loops in the calculation. The evaluation results are based on the following conditions: (1) the window size (<inline-formula> <tex-math notation="LaTeX">N </tex-math></inline-formula>) to <inline-formula> <tex-math notation="LaTeX">16\times16 </tex-math></inline-formula>; (2) the test pattern is an SVC grayscale video, and the formats are CIF and 4CIF with 30fps; (3) one multiplication involves four real multiplications and two real additions. The proposed 2-D SDFT method clearly reduced the number of multiplications by 43.8% and only increased the number of additions by 33%, compared with the state-of-the-art Park's method. Additionally, for the first 100 frames of the CIF and 4CIF sequences, the proposed method saves 10.8% and 10.9% of the processing time, respectively, on average. Overall, the proposed DDM-based 2-D SDFT algorithm can be applied to calculate not only 1-D but also 2-D SDFT spectrum, and are especially appropriate for hybrid applications.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2019.2930833