Title :
Fast computation of R-dimensional DHT with size Q(L1)×Q(L2)×…×Q(LR )
Author :
Zeng, Vonghong ; Bi, Guoan ; Kot, Alex C.
Author_Institution :
Sch. of Electr. & Electron. Eng., Nanyang Technol. Inst., Singapore
Abstract :
Fast algorithms are presented for multi-dimensional discrete Hartley transform (MD-DHT) with size q(l1)×q(l2 )×…×q(lr), where q is an odd prime number, and r>1 is the number of dimensions. By using the multi-dimensional polynomial transform, the MD-DHT can be converted into a series of reduced one-dimensional DHTs. Compared to other fast algorithms, the proposed one substantially reduces the overall computational complexity and has a simple computational structure
Keywords :
computational complexity; discrete Hartley transforms; multidimensional signal processing; R-dimensional DHT; computational complexity reduction; fast algorithms; fst computation; multi-dimensional discrete Hartley transform; multi-dimensional polynomial transform; multi-dimensional signal processing; one-dimensional DHT; simple computational structure; transform size; Bismuth; Content addressable storage; Discrete transforms; Image converters; Kernel; Multidimensional signal processing; Optical signal processing; Polynomials; Signal processing algorithms; Video signal processing;
Conference_Titel :
Signal Processing Proceedings, 2000. WCCC-ICSP 2000. 5th International Conference on
Conference_Location :
Beijing
Print_ISBN :
0-7803-5747-7
DOI :
10.1109/ICOSP.2000.894450
