Computing Haar transform using algebraic integers

作者: R. Baghaie , V. Dimitrov

DOI: 10.1109/ACSSC.2000.910993

关键词:

摘要: A novel algorithm for computing the Haar transform is presented that based on algebraic integer-encoding scheme. For implementation of a fully pipelined systolic architecture with O(N) throughput proposed.

参考文章(21)
J. Cozzens, L. Finkelstein, Range and error analysis for a fast Fourier transform computed over Z[{omega}] IEEE Transactions on Information Theory. ,vol. 33, pp. 582- 590 ,(1987) , 10.1109/TIT.1987.1057322
V. Dimitrov, R. Baghaie, Computing discrete Hartley transform using algebraic integers asilomar conference on signals, systems and computers. ,vol. 2, pp. 1351- 1355 ,(1999) , 10.1109/ACSSC.1999.831927
R. Baghaie, V. Dimitrov, Systolic implementation of real-valued discrete transforms via algebraic integer quantization Computers & Mathematics With Applications. ,vol. 41, pp. 1403- 1416 ,(2001) , 10.1016/S0898-1221(01)00105-5
G. Kaiser, The fast Haar transform IEEE Potentials. ,vol. 17, pp. 34- 37 ,(1998) , 10.1109/45.666645
Complex approximations using algebraic integers IEEE Transactions on Information Theory. ,vol. 31, pp. 565- 579 ,(1985) , 10.1109/TIT.1985.1057099
K.J. Ray Liu, VLSI computing architectures for Haar transform Electronics Letters. ,vol. 26, pp. 1962- 1963 ,(1990) , 10.1049/EL:19901269
R. Games, An algorithm for complex approximations in Z[e^{2{pi}i/8}] (Corresp.) IEEE Transactions on Information Theory. ,vol. 32, pp. 603- 607 ,(1986) , 10.1109/TIT.1986.1057203