The Serial Commutator FFT

Mario Garrido, Shen Jui Huang, Sau-Gee Chen, Oscar Gustafsson

Research output: Contribution to journalArticle

17 Scopus citations

Abstract

This brief presents a new type of fast Fourier transform (FFT) hardware architectures called serial commutator (SC) FFT. The SC FFT is characterized by the use of circuits for bit-dimension permutation of serial data. The proposed architectures are based on the observation that, in the radix-2 FFT algorithm, only half of the samples at each stage must be rotated. This fact, together with a proper data management, makes it possible to allocate rotations only every other clock cycle. This allows for simplifying the rotator, halving the complexity with respect to conventional serial FFT architectures. Likewise, the proposed approach halves the number of adders in the butterflies with respect to previous architectures. As a result, the proposed architectures use the minimum number of adders, rotators, and memory that are necessary for a pipelined FFT of serial data, with 100% utilization ratio.

Original languageEnglish
Article number7425187
Pages (from-to)974-978
Number of pages5
JournalIEEE Transactions on Circuits and Systems II: Express Briefs
Volume63
Issue number10
DOIs
StatePublished - 1 Oct 2016

Keywords

  • Fast Fourier transform (FFT)
  • pipelined architecture
  • serial commutator (SC)

Fingerprint Dive into the research topics of 'The Serial Commutator FFT'. Together they form a unique fingerprint.

  • Cite this