• DocumentCode
    897891
  • Title

    Discrete Fourier transforms when the number of data samples is prime

  • Author

    Rader, Charles

  • Volume
    56
  • Issue
    6
  • fYear
    1968
  • fDate
    6/1/1968 12:00:00 AM
  • Firstpage
    1107
  • Lastpage
    1108
  • Abstract
    The discrete Fourier transform of a sequence of N points, where N is a prime number, is shown to be essentially a circular correlation. This can be recognized by rearranging the members of the sequence and the transform according to a rule involving a primitive root of N. This observation permits the discrete Fourier transform to be computed by means of a fast Fourier transform algorithm, with the associated increase in speed, even though N is prime.
  • Keywords
    Circuit noise; Discrete Fourier transforms; Discrete transforms; Electrons; Equivalent circuits; Fast Fourier transforms; Fourier transforms; Frequency;
  • fLanguage
    English
  • Journal_Title
    Proceedings of the IEEE
  • Publisher
    ieee
  • ISSN
    0018-9219
  • Type

    jour

  • DOI
    10.1109/PROC.1968.6477
  • Filename
    1448407
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=897891