• DocumentCode
    1107190
  • Title

    Computation of the Fast Fourier Transform from Data Stored in External Auxiliary Memory for Any General Radix r=2n, n ≥ 1

  • Author

    Drubin, Meir

  • Author_Institution
    IEEE
  • Issue
    12
  • fYear
    1971
  • Firstpage
    1552
  • Lastpage
    1558
  • Abstract
    A general method is presented for the computation of the fast Fourier transform from data stored in external auxiliary memory, for any general radix r = 2nn ≥e external data storage is necessitated whenever the internal computer memory is limited. The general radix requirement arises in the tradeoff in serial FFT processor machines, between the number of passes required to address storage and the number of equivalent sparse matrix multiplicative operations required to compute the fast Fourier transform.
  • Keywords
    Discrete FFT exponential sequences, external auxiliary memory, general radices r = 2; Data mining; Fast Fourier transforms; Memory; Registers; Sparse matrices; Tree graphs; Discrete FFT exponential sequences, external auxiliary memory, general radices r = 2;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/T-C.1971.223168
  • Filename
    1671761
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1107190