• DocumentCode
    1095409
  • Title

    Fast discrete Fourier transform with exponentially spaced points

  • Author

    Boje, Edward

  • Author_Institution
    Dept. of Electr. & Control Eng., Durban-Westville Univ., South Africa
  • Volume
    43
  • Issue
    12
  • fYear
    1995
  • fDate
    12/1/1995 12:00:00 AM
  • Firstpage
    3033
  • Lastpage
    3035
  • Abstract
    The use of fast algorithms for evaluation of discrete Fourier transform-inverse transform pairs with uniformly spaced input data but with output data required only at exponentially spaced intervals is investigated. The algorithms require order (N) arithmetic operations, rather than the order (N log(N)) required for the full FFT algorithm
  • Keywords
    digital arithmetic; discrete Fourier transforms; inverse problems; signal processing; DFT; FFT algorithm; arithmetic operations; exponentially spaced intervals; exponentially spaced points; fast algorithms; fast discrete Fourier transform; inverse transform; output data; uniformly spaced input data; Arithmetic; Communication system control; Control systems; Discrete Fourier transforms; Discrete transforms; Displays; Fast Fourier transforms; Frequency domain analysis; Signal resolution; Speech processing;
  • fLanguage
    English
  • Journal_Title
    Signal Processing, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1053-587X
  • Type

    jour

  • DOI
    10.1109/78.476451
  • Filename
    476451
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1095409