0 Datasets
0 Files
Get instant academic access to this publication’s datasets.
Yes. After verification, you can browse and download datasets at no cost. Some premium assets may require author approval.
Files are stored on encrypted storage. Access is restricted to verified users and all downloads are logged.
Yes, message the author after sign-up to request supplementary files or replication code.
Join 50,000+ researchers worldwide. Get instant access to peer-reviewed datasets, advanced analytics, and global collaboration tools.
✓ Immediate verification • ✓ Free institutional access • ✓ Global collaborationJoin our academic network to download verified datasets and collaborate with researchers worldwide.
Get Free AccessA 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.
Stephen Richardson, Dejan Marković, Andrew Danowitz, John Brunhaver, Mark Horowitz (2015). Building Conflict-Free FFT Schedules. IEEE Transactions on Circuits and Systems I Regular Papers, 62(4), pp. 1146-1155, DOI: 10.1109/tcsi.2015.2402935.
Datasets shared by verified academics with rich metadata and previews.
Authors choose access levels; downloads are logged for transparency.
Students and faculty get instant access after verification.
Type
Article
Year
2015
Authors
5
Datasets
0
Total Files
0
Language
English
Journal
IEEE Transactions on Circuits and Systems I Regular Papers
DOI
10.1109/tcsi.2015.2402935
Access datasets from 50,000+ researchers worldwide with institutional verification.
Get Free Access
