论文部分内容阅读
本文对所提出的计算DFT(2~m)和DCT(2~m)的递归快速新算法在实现即位运算方面作了讨论,给山了新算法的计算机程序。运行的结果证明了这种递归新算法不仅具有执行时间短和精度高的优点,而且对于各种输入有很好的适应性。
In this paper, the proposed recursive fast new algorithm for computing DFT (2 ~ m) and DCT (2 ~ m) is discussed in terms of the realization of the bit operation, giving a computer program of a new algorithm. The results of running prove that the new recursive algorithm not only has the advantages of short execution time and high precision, but also has good adaptability to various inputs.