• DocumentCode
    1093913
  • Title

    Prime power synthesis of linear transformations

  • Author

    Morgera, Salvatore D.

  • Author_Institution
    Concordia University, Montréal, Québec, Canada
  • Volume
    28
  • Issue
    2
  • fYear
    1980
  • fDate
    4/1/1980 12:00:00 AM
  • Firstpage
    252
  • Lastpage
    254
  • Abstract
    A systematic technique is presented for synthesizing and efficiently performing large discrete Fourier transformations (DFT) in the range from 60-5000 points. Computational complexity is estimated and compared with the fast Fourier transform (FFT). Prime power pairs are found which minimize the computational complexity.
  • Keywords
    Computational complexity; Convolution; Discrete Fourier transforms; Fast Fourier transforms; Polynomials; Radar signal processing; Signal design; Signal processing algorithms; Signal synthesis; Sonar applications;
  • fLanguage
    English
  • Journal_Title
    Acoustics, Speech and Signal Processing, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0096-3518
  • Type

    jour

  • DOI
    10.1109/TASSP.1980.1163395
  • Filename
    1163395
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1093913