Avtomatika i Telemekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find






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


Avtomatika i Telemekhanika, 1975, Issue 4, Pages 138–147 (Mi at7865)  

Computers in Control

A fast-Fourier-transform algorithm

M. Sh. Rozenblat, B. I. Shvetskii

L'vov
Abstract: An algorithm is found that minimizes the storage in quick Fourier transformation of real even (odd) vectors and requiring as few as $(log_2N-3)N/4$ multiplications. The accuracy is estimated and it is shown that the algorithm error is comparable with thai of conventional complex rapid Fourier transformation algorithm.

Received: 07.02.1974
Bibliographic databases:
Document Type: Article
UDC: 681.332.5
Language: Russian
Citation: M. Sh. Rozenblat, B. I. Shvetskii, “A fast-Fourier-transform algorithm”, Avtomat. i Telemekh., 1975, no. 4, 138–147; Autom. Remote Control, 36:4 (1975), 648–656
Citation in format AMSBIB
\Bibitem{RozShv75}
\by M.~Sh.~Rozenblat, B.~I.~Shvetskii
\paper A fast-Fourier-transform algorithm
\jour Avtomat. i Telemekh.
\yr 1975
\issue 4
\pages 138--147
\mathnet{http://mi.mathnet.ru/at7865}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=449002}
\transl
\jour Autom. Remote Control
\yr 1975
\vol 36
\issue 4
\pages 648--656
Linking options:
  • https://www.mathnet.ru/eng/at7865
  • https://www.mathnet.ru/eng/at/y1975/i4/p138
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Avtomatika i Telemekhanika
    Statistics & downloads:
    Abstract page:100
    Full-text PDF :43
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024