Work

Radix-2 Fast Hartley Transform Revisited

Year: 2015

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1503.03794

Authors: de Oliveira, H. M., Sousa, V. L., N., H. A., de Souza, R. M. Campello

Language: English

Topic: Digital Filter Design and Implementation

Subfield: Signal Processing

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W1823876341

Cites: 12

Cited by: 1

Related to: 10