Journal or Publication Title:
Date of publication:
Volume:
ISSN:
Additional Information:
Title:
About Complexity of FFT Algorithms for Length of q x 2p
Other title:
q x 2p - երկարության ՖԱԶ-բարդության մասին; О сложности алгоритмов БПФ для длины q x 2p
Creator:
Subject:
Uncontrolled Keywords:
Fast Fourier transform (FFT) ; Split-radix algorithm ; Computational complexity.
Coverage:
Abstract:
The paper presents logarithmic formula which allows to compute the exact number of necessary operations for computing the discrete Fourier transform (DFT) of an arbitrary q x 2p - length, where q is an odd integer.