Title

Building Conflict-Free FFT Schedules

Author Info

Stephen Richardson, Stanford University
Dejan Markovic, University of California - Los Angeles
Andrew Danowitz, California Polytechnic State University, San Luis ObispoFollow
John Brunhaver, University of Arizona
Mark Horowitz, Stanford University

Recommended Citation

Postprint version. Published in IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS—I: REGULAR PAPERS, Volume 62, Issue 4, April 1, 2015, pages 1146-1155.

The definitive version is available at https://doi.org/10.1109/TCSI.2015.2402935.

Abstract

A conflict-free schedule lets an FFT run to completion without ever having to pause for memory-conflict resolution. We show how to build such schedules for FFTs having any number of butterfly units B operating at any radix R, transforming any number of datapoints D. Our algorithm works for FFT datapaths with or without pipeline overlap, and for memory banks having any number of access ports. Specifically, it enables construction of conflict-free schedules using single-ported memory banks, which require less area than more traditional multi-ported designs.

Disciplines

Computer Sciences

Copyright

2015 IEEE

Publisher statement

Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.