Radix-2 Fast Hartley Transform Revisited
Discrete Mathematics
2015-03-13 v1
Abstract
A Fast algorithm for the Discrete Hartley Transform (DHT) is presented, which resembles radix-2 fast Fourier Transform (FFT). Although fast DHTs are already known, this new approach bring some light about the deep relationship between fast DHT algorithms and a multiplication-free fast algorithm for the Hadamard Transform.
Keywords
Cite
@article{arxiv.1503.03794,
title = {Radix-2 Fast Hartley Transform Revisited},
author = {H. M. de Oliveira and V. L. Sousa and H. A. N. and R. M. Campello de Souza},
journal= {arXiv preprint arXiv:1503.03794},
year = {2015}
}
Comments
5 pages, 4 figures: Anais do I Congresso de Inform\'atica da Amaz\^onia, 2001. v.1.pp.285-292