Skip to main navigation Skip to search Skip to main content

FFT compiler: From math to efficient hardware

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

This paper presents a high-level compiler that generates hardware implementations of the discrete Fourier transform (DFT) from mathematical specifications. The matrix formula input language captures not only the DFT calculation but also the implementation options at the algorithmic and architectural levels. By selecting the appropriate formula, the resulting hardware implementations (described in a synthesizable Verilog description) can achieve a wide range of tradeoffs between implementation cost and performance. The compiler is also parameterized for a set of technology-specific optimizations, to allow it to target specific implementation platforms. This paper gives a brief overview of the system and presents synthesis results.

Original languageEnglish
Title of host publicationProceedings - IEEE International High-Level Design Validation and Test Workshop, HLDVT
Pages137-139
Number of pages3
DOIs
StatePublished - 2007
EventIEEE International High-Level Design Validation and Test Workshop, HLDVT - Irvine, CA, United States
Duration: Nov 7 2007Nov 9 2007

Publication series

NameProceedings - IEEE International High-Level Design Validation and Test Workshop, HLDVT

Conference

ConferenceIEEE International High-Level Design Validation and Test Workshop, HLDVT
Country/TerritoryUnited States
CityIrvine, CA
Period11/7/0711/9/07

Fingerprint

Dive into the research topics of 'FFT compiler: From math to efficient hardware'. Together they form a unique fingerprint.

Cite this