• DocumentCode
    122798
  • Title

    Folded FFT architecture for real-valued signals based on Radix-23 algorithm

  • Author

    Zode, Pradnya ; Thor, Abhilesh ; Deshmukh, A.Y.

  • Author_Institution
    Dept. of Electron. Eng., YCCE, Nagpur, India
  • fYear
    2014
  • fDate
    6-8 March 2014
  • Firstpage
    1
  • Lastpage
    4
  • Abstract
    A new FFT architecture for real-valued signal is proposed using Radix-23 algorithm. It is based on modifying flow graph of the FFT algorithm such that it has both real and complex datapaths. A redundant operation in flow graph is replaced by imaginary part. Using folding technique RFFT architecture with any level of parallelism can be achieved. This RFFT architecture will lead to low hardware complexity as compare to radix-2 and radix 22 algorithm in terms of adder, multiplier and delay. N-point 2 parallel radix-23 architecture requires (log8N-) complex multiplier, 2log2N adders, 3N/2-2 delays. RFFT which is used for real time applications and in portable devices for which low power consumption is main requirement, so accordingly carry propagate adder which has least power consumption and CSD multiplier is selected for our proposed architecture.
  • Keywords
    adders; carry logic; delay circuits; energy consumption; fast Fourier transforms; flow graphs; parallel processing; 3N-2-2 delays; CSD multiplier; N-point 2 parallel radix-23 architecture; RFFT architecture; adder; delay; flow graph; folded FFT architecture; log8N-1; low hardware complexity; power consumption; real-valued signal; redundant operation; Adders; Computer architecture; Delays; Flow graphs; Hardware; Power demand; Signal processing algorithms; FFT; Folding; Parallel Processing; Pipelining; Real Signals; radix-23;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Devices, Circuits and Systems (ICDCS), 2014 2nd International Conference on
  • Conference_Location
    Combiatore
  • Type

    conf

  • DOI
    10.1109/ICDCSyst.2014.6926178
  • Filename
    6926178