Title:
Complexity of the Composite Length FFT Algorithms
Author:
Type:
Uncontrolled Keywords:
Fast Fourier transform (FFT) ; split-radix algorithm ; com-putational complexity
Abstract:
In this paper logarithmic formula is derived which al- lows to compute exact number of necessary operations for computing discrete Fourier transform (DFT) of com- posite (q 2p, where q is an arbitrary odd integer) length. Developed expressions allow to compute the number of arithmetic operations for both 2=4 and 2=8 split-radix algorithms.
Language:
URL:
Additional Information:
Affiliation:
Institute for Informatics and Automation Problems
Country:
Year:
Time period:
Conference title:
10 th International Conference on Computer Science and Information Technologies CSIT 2015