A 0.75-million-point fourier-transform chip for frequency-sparse signals

Omid Abari, Ezz Hamed, Haitham Hassanieh, Abhinav Agarwal, Dina Katabi, Anantha P. Chandrakasan, Vladimir Stojanovic

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Applications like spectrum sensing, radar signal processing, and pattern matching by convolving a signal with a long code, as in GPS, require large FFT sizes. ASIC implementations of such FFTs are challenging due to their large silicon area and high power consumption. However, the signals in these applications are sparse, i.e., the energy at the output of the FFT/IFFT is concentrated at a limited number of frequencies and with zero/negligible energy at most frequencies. Recent advances in signal processing have shown that, for such sparse signals, a new algorithm called the sparse FFT (sFFT) can compute the Fourier transform more efficiently than traditional FFTs [1].

Original languageEnglish (US)
Title of host publication2014 IEEE International Solid-State Circuits Conference, ISSCC 2014 - Digest of Technical Papers
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages458-459
Number of pages2
ISBN (Print)9781479909186
DOIs
StatePublished - Jan 1 2014
Externally publishedYes
Event2014 61st IEEE International Solid-State Circuits Conference, ISSCC 2014 - San Francisco, CA, United States
Duration: Feb 9 2014Feb 13 2014

Publication series

NameDigest of Technical Papers - IEEE International Solid-State Circuits Conference
Volume57
ISSN (Print)0193-6530

Other

Other2014 61st IEEE International Solid-State Circuits Conference, ISSCC 2014
CountryUnited States
CitySan Francisco, CA
Period2/9/142/13/14

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A 0.75-million-point fourier-transform chip for frequency-sparse signals'. Together they form a unique fingerprint.

Cite this