Loading [MathJax]/jax/output/SVG/config.js
Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

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
Full-text PDF (161 kB) Citations (2)
References:
PDF
HTML
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.
Funding agency Grant number
Russian Foundation for Basic Research 17-01-00485а
Supported in part by the Russian Foundation for Basic Research, project no. 17-01-00485a.
Received: 29.08.2016
Revised: 21.11.2016
English version:
Problems of Information Transmission, 2017, Volume 53, Issue 3, Pages 284–293
DOI: https://doi.org/10.1134/S0032946017030103
Bibliographic databases:
Document Type: Article
UDC: 621.391.1+519.1
Language: Russian
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
Citation in format AMSBIB
\Bibitem{Ser17}
\by I.~S.~Sergeev
\paper On the real complexity of a~complex~DFT
\jour Probl. Peredachi Inf.
\yr 2017
\vol 53
\issue 3
\pages 90--99
\mathnet{http://mi.mathnet.ru/ppi2247}
\elib{https://elibrary.ru/item.asp?id=29966414}
\transl
\jour Problems Inform. Transmission
\yr 2017
\vol 53
\issue 3
\pages 284--293
\crossref{https://doi.org/10.1134/S0032946017030103}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000412936700010}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85031720238}
Linking options:
  • https://www.mathnet.ru/eng/ppi2247
  • https://www.mathnet.ru/eng/ppi/v53/i3/p90
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
    Statistics & downloads:
    Abstract page:262
    Full-text PDF :50
    References:62
    First page:17
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025