Building Conflict-Free FFT Schedules

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

Research output: Contribution to journalArticle

8 Citations (Scopus)

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 languageEnglish (US)
Article number7070875
Pages (from-to)1146-1155
Number of pages10
JournalIEEE Transactions on Circuits and Systems I: Regular Papers
Volume62
Issue number4
DOIs
StatePublished - Apr 1 2015

Fingerprint

Fast Fourier transforms
Data storage equipment
Pipelines

Keywords

  • Conflict-free scheduling
  • digital signal processor
  • fast Fourier transform
  • FFT
  • 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

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 journalArticle

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, vol. 62, no. 4, 7070875, pp. 1146-1155. https://doi.org/10.1109/TCSI.2015.2402935
Richardson, Stephen ; Marković, Dejan ; Danowitz, Andrew ; Brunhaver, John ; Horowitz, Mark. / Building Conflict-Free FFT Schedules. In: IEEE Transactions on Circuits and Systems I: Regular Papers. 2015 ; Vol. 62, No. 4. pp. 1146-1155.
@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, digital signal processor, fast Fourier transform, FFT, single-ported memory",
author = "Stephen Richardson and Dejan Marković and Andrew Danowitz and John Brunhaver and Mark Horowitz",
year = "2015",
month = "4",
day = "1",
doi = "10.1109/TCSI.2015.2402935",
language = "English (US)",
volume = "62",
pages = "1146--1155",
journal = "IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications",
issn = "1549-8328",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
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 - 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 -