Rotators in Fast Fourier Transforms

Fahad Qureshi, Jarmo Takala, Shuvra Bhattacharyya

Research output: Chapter in Book/Report/Conference proceedingChapterScientificpeer-review

Abstract

This chapter discusses architectures for computing the rotations in fast Fourier transforms. There are two principal methods, which can be exploited: general complex multipliers or multiplier-less techniques. We describe different architectures, each with different advantages, indicating that the final selection depends on the requirements of the application at hand.
Original languageEnglish
Title of host publicationEmbedded, Cyber-Physical, and IoT Systems: Essays Dedicated to Marilyn Wolf on the Occasion of Her 60th Birthday
EditorsShuvra S. Bhattacharyya, Miodrag Potkonjak, Senem Velipasalar
PublisherSpringer International Publishing
Pages245-262
Number of pages18
ISBN (Electronic)978-3-030-16949-7
ISBN (Print)978-3-030-16948-0
DOIs
Publication statusE-pub ahead of print - 29 Jun 2019
Publication typeA3 Book chapter

Publication forum classification

  • Publication forum level 2

Fingerprint

Dive into the research topics of 'Rotators in Fast Fourier Transforms'. Together they form a unique fingerprint.

Cite this