On Performance of Sparse Fast Fourier Transform Algorithms Using the Aliasing Filter

Computing the sparse fast Fourier transform (sFFT) has emerged as a critical topic for a long time because of its high efficiency and wide practicability. More than twenty different sFFT algorithms compute discrete Fourier transform (DFT) by their unique methods so far. In order to use them properly...

Celý popis

Podrobná bibliografia

Vydané v:	Electronics (Basel) Ročník 10; číslo 9; s. 1117
Hlavní autori:	Li, Bin, Jiang, Zhikang, Chen, Jie
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Basel MDPI AG 01.05.2021
Predmet:	Algorithms Aliasing Computation Experiments Fast Fourier transformations Fourier transforms Graph theory Iterative methods Magnetic resonance imaging Performance evaluation Run time (computers)
ISSN:	2079-9292, 2079-9292
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!