Enviar artigo por via de e-mail On the real complexity of a complex DFT
- Autores: Sergeev I.S.1
-
Afiliações:
- Federal State Unitary Enterprise “Kvant Scientific Research Institute,”
- Edição: Volume 53, Nº 3 (2017)
- Páginas: 284-293
- Seção: Large Systems
- URL: https://journal-vniispk.ru/0032-9460/article/view/166429
- DOI: https://doi.org/10.1134/S0032946017030103
- ID: 166429
Citar
Acesso aberto
Acesso está concedido
Somente assinantes
Resumo
We present a method to construct a theoretically fast algorithm for computing the discrete Fourier transform (DFT) of order N = 2n. We show that the DFT of a complex vector of length N is performed with complexity of 3.76875N log2N real operations of addition, subtraction, and scalar multiplication.
Sobre autores
I. Sergeev
Federal State Unitary Enterprise “Kvant Scientific Research Institute,”
Autor responsável pela correspondência
Email: isserg@gmail.com
Rússia, Moscow
Arquivos suplementares
