These results show the performance of the GPU or host PC when calculating the
Fast-Fourier-Transform
of a vector of complex numbers. The number of operations for a vector
of length N
is assumed to be 5*N*log2(N)
.
This calculation is usually memory-bound, i.e. the performance depends mainly on how fast the GPU or host PC can read and write data.