DocumentCode
2360839
Title
Fast parallel FFT on a reconfigurable computation platform
Author
Kamalizad, Amir H. ; Pan, Chengzhi ; Bagherzadeh, Nader
Author_Institution
Dept. of Electr. Eng. & Comput. Sci., California Univ., Irvine, CA, USA
fYear
2003
fDate
10-12 Nov. 2003
Firstpage
254
Lastpage
259
Abstract
We present implementation of a very fast parallel complex FFT on M2, the second generation of MorphoSys reconfigurable computation platform, which is targeting on streamed applications such as multimedia and DSP. The proposed mapping comprises fast presorting, cascaded radix-2 stages, and postreordering. Data and twiddle factors are 16-bit real and 16-bit imaginary in 2\´s complement format and scaling is performed to avoid overflow. The mapping is tested on our cycle-accurate simulator, "mulate", and the performance is encouragingly better than other architectures such as Imagine and VIRAM. Moreover, the performance is scalable according to FFT sizes. Since there is no functionality specifically tailored to FFT, the results demonstrate the capability of MorphoSys architecture to extract parallelism from streamed applications. Further rationales are given based on the concepts of scalar operand networks and memory hierarchy.
Keywords
fast Fourier transforms; parallel programming; reconfigurable architectures; storage management; 2´s complement format; DSP; Imagine architecture; MorphoSys reconfigurable computation platform; VIRAM architecture; memory hierarchy; mulate cycle-accurate simulator; multimedia; parallel FFT; parallelism; scalar operand networks; twiddle factors; Application software; Application specific integrated circuits; Bandwidth; Computer architecture; Concurrent computing; Delay; Digital signal processing; Parallel processing; Scalability; Streaming media;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Architecture and High Performance Computing, 2003. Proceedings. 15th Symposium on
Print_ISBN
0-7695-2046-4
Type
conf
DOI
10.1109/CAHPC.2003.1250345
Filename
1250345
Link To Document