• DocumentCode
    3013643
  • Title

    Bit reverse unscrambling for a radix-2MFFT

  • Author

    Burrus, C.S.

  • Author_Institution
    Rice University, Houston, Texas
  • Volume
    12
  • fYear
    1987
  • fDate
    31868
  • Firstpage
    1809
  • Lastpage
    1810
  • Abstract
    The traditional Cooley-Tukey and the prime factor FFT algorithms either produce the output in scrambled order or the input data order must be prescrambled. Several methods for scrambling and unscrambling the DFT are presented. The new result in this paper is the observation that the radix-4, radix-8, or any radix-2mFFT can be modified to give the output in the same bit-reversed order as the radix-2 FFT.
  • Keywords
    Arithmetic; Convolution; Counting circuits; FETs; Frequency; Hardware; Indexing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '87.
  • Type

    conf

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