|
Problemy Peredachi Informatsii, 2017, Volume 53, Issue 3, Pages 90–99
(Mi ppi2247)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Large Systems
On the real complexity of a complex DFT
I. S. Sergeev Federal State Unitary Enterprise "Kvant Scientific Research Institute", Moscow, Russia
Abstract:
We present a method to construct a theoretically fast algorithm for computing the discrete Fourier transform (DFT) of order $N=2^n$. We show that the DFT of a complex vector of length $N$ is performed with complexity of $3{,}76875N\log_2N$ real operations of addition, subtraction, and scalar multiplication.
Received: 29.08.2016 Revised: 21.11.2016
Citation:
I. S. Sergeev, “On the real complexity of a complex DFT”, Probl. Peredachi Inf., 53:3 (2017), 90–99; Problems Inform. Transmission, 53:3 (2017), 284–293
Linking options:
https://www.mathnet.ru/eng/ppi2247 https://www.mathnet.ru/eng/ppi/v53/i3/p90
|
Statistics & downloads: |
Abstract page: | 213 | Full-text PDF : | 26 | References: | 36 | First page: | 17 |
|