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...

Full description

Bibliographic Details

Published in:	Electronics (Basel) Vol. 10; no. 9; p. 1117
Main Authors:	Li, Bin, Jiang, Zhikang, Chen, Jie
Format:	Journal Article
Language:	English
Published:	Basel MDPI AG 01.05.2021
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!