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:

English

URL:


Additional Information:

rafayelbarseghyan@ipia.sci.am

Affiliation:

Institute for Informatics and Automation Problems

Country:

Armenia

Year:

2015

Time period:

September 28 - October 2

Conference title:

10 th International Conference on Computer Science and Information Technologies CSIT 2015

Place:

Yerevan

Participation type:

oral

Object collections:

Last modified:

Mar 3, 2021

In our library since:

Jul 27, 2020

Number of object content hits:

1

All available object's versions:

https://noad.sci.am/publication/149531

Show description in RDF format:

RDF

Show description in OAI-PMH format:

OAI-PMH

This page uses 'cookies'. More information