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 | |
| State | Published - Apr 1 2015 |
Fingerprint
Keywords
- Conflict-free scheduling
- digital signal processor
- fast Fourier transform
- FFT
- single-ported memory
ASJC Scopus subject areas
- Electrical and Electronic Engineering
Cite this
Building Conflict-Free FFT Schedules. / Richardson, Stephen; Marković, Dejan; Danowitz, Andrew; Brunhaver, John; Horowitz, Mark.
In: IEEE Transactions on Circuits and Systems I: Regular Papers, Vol. 62, No. 4, 7070875, 01.04.2015, p. 1146-1155.Research output: Contribution to journal › Article
}
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 - digital signal processor
KW - fast Fourier transform
KW - FFT
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: Fundamental Theory and Applications
JF - IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications
SN - 1549-8328
IS - 4
M1 - 7070875
ER -