Open AccessPosted Content
Radix-2 Fast Hartley Transform Revisited.
TLDR
A Fast algorithm for the Discrete Hartley Transform (DHT) is presented, which resembles radix-2 fast Fourier Transform (FFT) and brings some light about the deep relationship between fast DHT algorithms and a multiplication-free fast algorithm forThe Hadamard Transform.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.read more
Citations
More filters
Journal ArticleDOI
Fast algorithms for digital signal processing
TL;DR: This new textbook by R. E. Blahut contains perhaps the most comprehensive coverage of fast algorithms todate, with an emphasis on implementing the two canonical signal processing operations of convolution and discrete Fourier transformation.
Posted Content
A Matrix Laurent Series-based Fast Fourier Transform for Blocklengths N=4 (mod 8).
TL;DR: General guidelines for a new fast computation of blocklength 8m+4 DFTs are presented, which is based on a Laurent series involving matrices, achieving lower multiplication counts than previously published FFTs.
References
More filters
Book
Fast Algorithms for Digital Signal Processing
TL;DR: Fast algorithms for digital signal processing, Fast algorithms fordigital signal processing , and so on.
Journal ArticleDOI
On computing the discrete Fourier transform
TL;DR: New algorithms for computing the Discrete Fourier Transform of n points are described, which use substantially fewer multiplications than the best algorithm previously known, and about the same number of additions.
Journal ArticleDOI
Discrete Hartley transform
TL;DR: The discrete Hartley transform (DHT) resembles the discrete Fourier transform (DFT) but is free from two characteristics of the DFT that are sometimes computationally undesirable and promises to speed up Fourier-transform calculations.
Book
The Hartley transform
TL;DR: The author describes the fast algorithm he discovered for spectral analysis and indeed any purpose to which Fourier Transforms and the Fast Fourier Transform are normally applied.
Journal ArticleDOI
A More Symmetrical Fourier Analysis Applied to Transmission Problems
TL;DR: In this article, the Fourier identity is expressed in a more symmetrical form which leads to certain analogies between the function of the original variable and its transform, and it permits a function of time to be analyzed into two independent sets of sinusoidal components, one of which is represented in terms of positive frequencies, and the other of negative.