Work

About Complexity of FFT Algorithms for Length of q × 2p

Year: 2017

Type: article

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 × 2 p - length, where q is an odd integer.

Source: Mathematical Problems of Computer Science

Author: Rafayel Barseghyan

Institution: Institute for Informatics and Automation Problems

Language: English

Topic: Digital Filter Design and Implementation

Subfield: Signal Processing

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W3211882615

FWCI:

Cites: 7

Cited by:

Related to: 10