• DocumentCode
    2885574
  • Title

    Fourier analysis using adaptive AFT

  • Author

    Li, Weiping

  • Author_Institution
    Comput. Sci. & Electron. Eng. Dept., Lehigh Univ., Bethlehem, PA, USA
  • fYear
    1990
  • fDate
    3-6 Apr 1990
  • Firstpage
    1523
  • Abstract
    The arithmetic Fourier transform (AFT) is a computationally efficient technique for Fourier analysis. It does not need any multiplication of twiddle factors, but it requires O(N 2) time-domain samples for computing N frequency components. A solution to this problem is proposed. By using an iterative algorithm with the AFT, it is possible to use the Nyquist sampling rate in the time domain and obtain O(N2 ) samples in the frequency domain. Simulation results for the algorithm are included
  • Keywords
    Fourier analysis; Fourier transforms; digital arithmetic; Fourier analysis; Nyquist sampling rate; adaptive AFT; arithmetic Fourier transform; frequency components; frequency domain; iterative algorithm; simulation results; time-domain samples; Algorithm design and analysis; Arithmetic; Delta modulation; Discrete Fourier transforms; Fourier transforms; Frequency domain analysis; Interpolation; Iterative algorithms; Least squares approximation; Sampling methods; Time domain analysis;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Acoustics, Speech, and Signal Processing, 1990. ICASSP-90., 1990 International Conference on
  • Conference_Location
    Albuquerque, NM
  • ISSN
    1520-6149
  • Type

    conf

  • DOI
    10.1109/ICASSP.1990.115699
  • Filename
    115699
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2885574