FFT Implementation on a Streaming Architecture
19th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP), 2011
@conference{lobeiras2011fft,
title={FFT Implementation on a Streaming Architecture},
author={Lobeiras, J. and Amor, M. and Doallo, R.},
booktitle={Parallel, Distributed and Network-Based Processing (PDP), 2011 19th Euromicro International Conference on},
pages={119–126},
issn={1066-6192},
organization={IEEE}
}
Fast Fourier Transform (FFT) is a useful tool for applications requiring signal analysis and processing. However, its high computational cost requires efficient implementations, specially if real time applications are used, where response time is a decisive factor. Thus, the computational cost and wide application range that requires FFT transforms has motivated the research of efficient implementations. Recently, GPU computing is becoming more and more relevant because of their high computational power and low cost, but due to its novelty there is some lack of tools and libraries. In this paper we propose an efficient implementation of the FFT with AMD’s Brook+ language. We describe several features and optimization strategies, analyzing the scalability and performance compared to other well-known existing solutions.
April 10, 2011 by hgpu
