IEEE Transactions on Circuits and Systems I Regular Papers 62(4): 1146-1155
Article 2015 English
Authors
SR
Stephen Richardson
DM
Dejan Marković
AD
Andrew Danowitz
Abstract
1 min read
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.
Efstathios Kastritis, Evangelos Terpos, Zoi Evangelakou, Foteini Theodorakakou, Despina Fotiou, Maria S. Manola, Despoina D. Gianniou, Tina Bagratuni, Nikolaos Kanellias, Magdalini Migkou, Maria Gavriatopoulou, Ioannis P. Trougakos, Meletios A Dimopoulos
Discussion(0)
No comments yet. Be the first to comment.