Object
Title: Complexity of the Composite Length FFT Algorithms
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.
Identifier:
oai:noad.sci.am:135938
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
Place:
Participation type:
Object collections:
- Digital Library > Academic Insitutions > Insitute for Informatics and Automation Problems of NAS RA > Conferences
Last modified:
Mar 3, 2021
In our library since:
Jul 27, 2020
Number of object content hits:
12
All available object's versions:
https://noad.sci.am/publication/149531
Show description in RDF format:
Show description in OAI-PMH format:
| Edition name | Date |
|---|---|
| Rafayel Barseghyan, Complexity of the Composite Length FFT Algorithms | Mar 3, 2021 |
