tailieunhanh - Báo cáo hóa học: " Research Article GPU-Based FFT Computation for Multi-Gigabit WirelessHD Baseband Processing"

Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: Research Article GPU-Based FFT Computation for Multi-Gigabit WirelessHD Baseband Processing | Hindawi Publishing Corporation EURASIP Journal on Wireless Communications and Networking Volume 2010 Article ID 359081 13 pages doi 2010 359081 Research Article GPU-Based FFT Computation for Multi-Gigabit WirelessHD Baseband Processing Nicholas Hinitt1 and Taskin Kocak2 department of Electric Electronic Engineering University of Bristol Bristol BS8 1UB UK 2 Department of Computer Engineering Bahcesehir University 34538 Istanbul Turkey Correspondence should be addressed to Taskin Kocak Received 13 November 2009 Revised 19 May 2010 Accepted 29 June 2010 Academic Editor Mustafa Badaroglu Copyright 2010 N. Hinitt and T. Kocak. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use distribution and reproduction in any medium provided the original work is properly cited. The next generation Graphics Processing Units GPUs are being considered for non-graphics applications. Millimeter wave 60Ghz wireless networks that are capable of multi-gigabit per second Gbps transfer rates require a significant baseband throughput. In this work we consider the baseband of WirelessHD a 60 GHz communications system which can provide a data rate of up to Gbps over a short range wireless link. Thus we explore the feasibility of achieving gigabit baseband throughput using the GPUs. One of the most computationally intensive functions commonly used in baseband communications the Fast Fourier Transform FFT algorithm is implemented on an NVIDIA GPU using their general-purpose computing platform called the Compute Unified Device Architecture CUDA . The paper first investigates the implementation of an FFT algorithm using the GPU hardware and exploiting the computational capability available. It then outlines the limitations discovered and the methods used to overcome these challenges. Finally a new algorithm to compute FFT is proposed which reduces interprocessor communication. It is .