Pruning split-radix FFT with time shift

Eliminating computations on zeros when the number of nonzero inputs is considerably less than the length of Fast Fourier Transform (FFT) is considered as one of the methods to increase the computational efficiency of an FFT algorithm. This paper proposes a new split-radix FFT pruning algorithm with...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Longtao Yuan, Xiang Tian, Yaowu Chen
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Algorithm design and analysis Computational complexity computional complexity Discrete Fourier transforms FFT pruning Flow graphs Hardware hardware implementation Random access memory Signal processing algorithms split-radix FFT time shift
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!