Timing of some fast DFT-algorithms |
| |
Authors: | AJ van der Steen |
| |
Affiliation: | Academic Computing Centre Utrecht, University of Utrecht, The Netherlands |
| |
Abstract: | Timing experiments of 6 fast DFT-algorithms are performed on 3 computers. Results show that the complexity of an algorithm in terms of the number of multiplications and additions is not a satisfactory measure for the speed of a DFT-algorithm. |
| |
Keywords: | Fast DFT-algorithms timing |
本文献已被 ScienceDirect 等数据库收录! |