首页 | 本学科首页   官方微博 | 高级检索  
     


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 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号