GPU-based FFT computation for multi-gigabit wirelessHD baseband processing

  • Authors:
  • Nicholas Hinitt;Taskin Kocak

  • Affiliations:
  • Department of Electric & Electronic Engineering, University of Bristol, Bristol, UK;Department of Computer Engineering, Bahcesehir University, Istanbul, Turkey

  • Venue:
  • EURASIP Journal on Wireless Communications and Networking
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 60GHz communications system, which can provide a data rate of up to 3.8Gbps 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 further optimized by improving memory access, enabling the processing rate to exceed 4Gbps, achieving a processing time of a 512-point FFT in less than 200 ns using a two-GPU solution.