EFFICIENT VECTOR IMPLEMENTATION OF THE FFT ALGORITHM ON IBM 3090VF.

Abstract

An efficient vector implementation of the fast Fourier transform (FFT) algorithm on the IBM 3090 Vector Facility is presented. The algorithm a part of the Engineering and Scientific Subroutine Library (ESSL). The implementation works with the full vector length of the machine and the cache is also efficiently managed to achieve very good performance. For short-length transforms, a multiple number of transforms could be computed to improve performance. The performance of the vector routines is compared with that of state-of-the-art scalar routines and performance improvements of up to a factor of 8 are observed.