Zeng Yonghong. FAST ALGORITHMS FOR DISCRETE HARTLEY TRANSFORM OF ARBITRARY LENGTH[J]. Journal of Electronics & Information Technology, 1993, 15(2): 121-127.
Citation:
Zeng Yonghong. FAST ALGORITHMS FOR DISCRETE HARTLEY TRANSFORM OF ARBITRARY LENGTH[J]. Journal of Electronics & Information Technology, 1993, 15(2): 121-127.
Zeng Yonghong. FAST ALGORITHMS FOR DISCRETE HARTLEY TRANSFORM OF ARBITRARY LENGTH[J]. Journal of Electronics & Information Technology, 1993, 15(2): 121-127.
Citation:
Zeng Yonghong. FAST ALGORITHMS FOR DISCRETE HARTLEY TRANSFORM OF ARBITRARY LENGTH[J]. Journal of Electronics & Information Technology, 1993, 15(2): 121-127.
DHT of length plq (p is odd. q is arbitrary) is turned into p-DHT's of length q and some additional operations while the additional operations only invol ves the computation of cos-DFT and sin-DFT with length p. If the length of a DHT is p1l1psls2l)(p1,, ps are odd primes), a fast algorithm is obtained by the similar recursive technique. Therefore, the algorithm can compute DHT of arbitrary length. The paper also proves that operations for computing DHT of length N by the algorithm are no more than O(Nlog2N). When the length is N=pl, operations
of the algorithm are less than that of other known algorithms.
R. N. Bracewell, IEEE Trans. on ASSP, ASSP-38 (1990) 12, 2174-2176.[2]王中德, 快速w变涣--算法与程序,中国科学(A辑),1988年,第5期,第549-560页.[3]S. C. Pei, J. L. Wu, Electron. Lett., 22 (1986) 1, 26-27.[4]R. N. Braceweil.[J].Electron. Lett..1987,23:10-[5]H. V. Sorensen et al., IEEE Trans. on ASSP, ASSP-33 (1985) 10, 1231-1238.[6]茅一民, 电子科学学刊, 12(1990)6,584-592.[7]H. J.努斯鲍默, 快速傅里叶变换和卷积算法,上海科技文献版,上海,1984年.[8]曾永红,电子学报,19(1991)5,87-95.
DownLoad: