27 October 2013 A novel fast algorithm for discrete Hartley transform of type-III base on the split-radix and first-order moments
Author Affiliations +
Proceedings Volume 8920, MIPPR 2013: Parallel Processing of Images and Optimization and Medical Imaging Processing; 892007 (2013) https://doi.org/10.1117/12.2031007
Event: Eighth International Symposium on Multispectral Image Processing and Pattern Recognition, 2013, Wuhan, China
Abstract
This paper introduces and evaluates a new algorithm for the computation of type-III discrete Hartley transforms (DHT) of length N = 2n. The length-N type-III discrete Hartley transforms can be decomposed into several length-16 type-III discrete Hartley transforms based on the radix-2 fast algorithm, and the length-16 type-III discrete Hartley transforms can be computed by first- order moments. It can save a lot of arithmetic operations and the computational complexity of the algorithms is lower than some existing methods. Moreover, this algorithm can be easily implemented.
© (2013) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Xia Hua, Xia Hua, Jianguo Liu, Jianguo Liu, } "A novel fast algorithm for discrete Hartley transform of type-III base on the split-radix and first-order moments", Proc. SPIE 8920, MIPPR 2013: Parallel Processing of Images and Optimization and Medical Imaging Processing, 892007 (27 October 2013); doi: 10.1117/12.2031007; https://doi.org/10.1117/12.2031007
PROCEEDINGS
6 PAGES


SHARE
RELATED CONTENT


Back to Top