【摘要】 本文对所提出的计算DFT(2~m)和DCT(2~m)的递归快速新算法在实现即位运算方面作了讨论,给山了新算法的计算机程序。运行的结果证明了这种递归新算法不仅具有执行时间短和精度高的优点,而且对于各种输入有很好的适应性。更多还原

【Abstract】 This paper presents art efficient Fortran program that computesDFT and DCT by new recursive factorization algorithms proposedby(7).A very simple modification is employed that results in aflexible,modular algorithm that efficiently calculates the DFT andDCT in-place.A comparison of running results shows that the newalgorithms have the advantage of shorter running time,higherprecision and adaptability.更多还原