Conflict-free parallel memory access scheme for FFT processors
Authors:
- J.H. TakalaJTJ.H. Takala
- T.S. JarvinenTJT.S. Jarvinen
- H.T. SorokinHSH.T. Sorokin
- 4 November 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- An effective memory addressing scheme for FFT processorsIEEE Transactions on Signal Processing, 1999
- Area-efficient architecture for Fast Fourier transformIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 1999
- Recursive fast algorithm and the role of the tensor productIEEE Transactions on Signal Processing, 1992
- Conflict free memory addressing for dedicated FFT hardwareIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 1992
- Increased memory performance during vector accesses through the use of linear address transformationsIEEE Transactions on Computers, 1992
- Block, multistride vector, and FFT accesses in parallel memory systemsIEEE Transactions on Parallel and Distributed Systems, 1991
- Simplified control of FFT hardwareIEEE Transactions on Acoustics, Speech, and Signal Processing, 1976
- Organization of Large Scale Fourier ProcessorsJournal of the ACM, 1969