• DocumentCode
    813407
  • Title

    Recursive fast algorithm and the role of the tensor product

  • Author

    Granata, John ; Conner, Michael ; Tolimieri, Richard

  • Author_Institution
    Center for Large Scale Comput., City Univ. of New York, NY, USA
  • Volume
    40
  • Issue
    12
  • fYear
    1992
  • fDate
    12/1/1992 12:00:00 AM
  • Firstpage
    2921
  • Lastpage
    2930
  • Abstract
    The use of the tensor product for modeling and designing FFT algorithms is addressed. The benefit of the tensor product approach lies in the strong connection between certain tensor product constructs and important computer architectures. The scope of the tensor product approach is generalized to include a much larger class of fast recursive algorithms. This greatly enhances the versatility of the tensor product technique and brings many different algorithms to the level of understanding and flexibility enjoyed by the FFT
  • Keywords
    fast Fourier transforms; signal processing; tensors; transforms; FFT algorithms; fast recursive algorithms; signal processing; tensor product; Algorithm design and analysis; Computer architecture; Flow graphs; Helium; History; Matrices; Matrix decomposition; Signal design; Signal processing algorithms; Tensile stress;
  • fLanguage
    English
  • Journal_Title
    Signal Processing, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1053-587X
  • Type

    jour

  • DOI
    10.1109/78.175736
  • Filename
    175736