Radix-2 Fast Hartley Transform Revisited
H.M. de Oliveira, V.L. Sousa, H.A.N., R.M. Campello de Souza
TL;DR
This paper introduces a radix-2 fast algorithm for the Discrete Hartley Transform that highlights its relationship with the Hadamard Transform and offers insights into multiplication-free computation methods.
Contribution
It presents a novel radix-2 fast Hartley Transform algorithm that clarifies its connection to the Hadamard Transform, enhancing understanding of efficient transform computations.
Findings
Revealed the deep relationship between fast DHT and Hadamard Transform
Provided a multiplication-free perspective for fast DHT algorithms
Enhanced understanding of efficient transform computation methods
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDigital Filter Design and Implementation · Advanced Wireless Communication Techniques · Advancements in PLL and VCO Technologies