Radix-2 Fast Hartley Transform Revisited

2015/03/12 by H. M. de Oliveira, de Oliveira, H. M., Viviane L. Sousa +8
Computer Science · Engineering · #Advanced Wireless Communication Techniques #Advancements in PLL and VCO Technologies #Digital Filter Design and Implementation #cs.DM

paper · pdf · doi:10.48550/arxiv.1503.03794

5 pages, 4 figures: Anais do I Congresso de Informática da Amazônia, 2001. v.1.pp.285-292

arxiv created 2015/03/12 · arxiv updated 2015/03/13

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.

Related

• Multilayer Hadamard Decomposition of Discrete Hartley Transforms
• Fast Finite Field Hartley Transforms Based on Hadamard Decomposition
• Faster Walsh-Hadamard and Discrete Fourier Transforms From Matrix Non-Rigidity
• A Factorization Scheme for Some Discrete Hartley Transform Matrices
• Rounded Hartley Transform: A Quasi-involution