Building Conflict-Free FFT Schedules

Stephen Richardson; Dejan Marković; Andrew Danowitz; John Brunhaver; Mark Horowitz

doi:10.1109/TCSI.2015.2402935

Building Conflict-Free FFT Schedules

Stephen Richardson, Dejan Marković, Andrew Danowitz, John Brunhaver, Mark Horowitz

Research output: Contribution to journal › Article

8 Scopus citations

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.

Original language	English (US)
Article number	7070875
Pages (from-to)	1146-1155
Number of pages	10
Journal	IEEE Transactions on Circuits and Systems I: Regular Papers
Volume	62
Issue number	4
DOIs	https://doi.org/10.1109/TCSI.2015.2402935
State	Published - Apr 1 2015

Fingerprint

Keywords

Conflict-free scheduling
FFT
digital signal processor
fast Fourier transform
single-ported memory

ASJC Scopus subject areas

Electrical and Electronic Engineering

Cite this

Richardson, S., Marković, D., Danowitz, A., Brunhaver, J., & Horowitz, M. (2015). Building Conflict-Free FFT Schedules. IEEE Transactions on Circuits and Systems I: Regular Papers, 62(4), 1146-1155. [7070875]. https://doi.org/10.1109/TCSI.2015.2402935

@article{922c2ad3848c47ec99c29f23267173fc,

title = "Building Conflict-Free FFT Schedules",

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.",

keywords = "Conflict-free scheduling, FFT, digital signal processor, fast Fourier transform, single-ported memory",

author = "Stephen Richardson and Dejan Markovi{\'c} and Andrew Danowitz and John Brunhaver and Mark Horowitz",

year = "2015",

month = apr,

day = "1",

doi = "10.1109/TCSI.2015.2402935",

language = "English (US)",

volume = "62",

pages = "1146--1155",

journal = "IEEE Transactions on Circuits and Systems I: Regular Papers",

issn = "1549-8328",

number = "4",

}

TY - JOUR

T1 - Building Conflict-Free FFT Schedules

AU - Richardson, Stephen

AU - Marković, Dejan

AU - Danowitz, Andrew

AU - Brunhaver, John

AU - Horowitz, Mark

PY - 2015/4/1

Y1 - 2015/4/1

N2 - 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.

AB - 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.

KW - Conflict-free scheduling

KW - FFT

KW - digital signal processor

KW - fast Fourier transform

KW - single-ported memory

UR - http://www.scopus.com/inward/record.url?scp=84927553835&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84927553835&partnerID=8YFLogxK

U2 - 10.1109/TCSI.2015.2402935

DO - 10.1109/TCSI.2015.2402935

M3 - Article

AN - SCOPUS:84927553835

VL - 62

SP - 1146

EP - 1155

JO - IEEE Transactions on Circuits and Systems I: Regular Papers

JF - IEEE Transactions on Circuits and Systems I: Regular Papers

SN - 1549-8328

IS - 4

M1 - 7070875

ER -

Access to Document

10.1109/TCSI.2015.2402935