Matrix expansions for computing the discrete hartley transform for blocklength N ≡ 0 (mod 4)
نویسندگان
چکیده
Abstract— A new fast algorithm for computing the discrete Hartley transform (DHT) is presented, which is based on the expansion of the transform matrix. The algorithm presents a better performance, in terms of multiplicative complexity, than previously known fast Hartley transform algorithms and same performance, in terms of additive complexity, than Split-Radix algorithm. A detailed description of the computation of DHTs with blocklengths 8 and 16 is shown. The algorithm is very attractive for blocklengths N ≥ 128.
منابع مشابه
GENERATION OF MULTIPLE SPECTRUM-COMPATIBLE ARTIFICIAL EARTHQUAKE ACCELEGRAMS WITH HARTLEY TRANSFORM AND RBF NEURAL NETWORK
The Hartley transform, a real-valued alternative to the complex Fourier transform, is presented as an efficient tool for the analysis and simulation of earthquake accelerograms. This paper is introduced a novel method based on discrete Hartley transform (DHT) and radial basis function (RBF) neural network for generation of artificial earthquake accelerograms from specific target spectrums. Acce...
متن کاملA Matrix Laurent Series-based Fast Fourier Transform for Blocklengths N=4 (mod 8)
— General guidelines for a new fast computation of blocklength 8m+4 DFTs are presented, which is based on a Laurent series involving matrices. Results of non-trivial real multiplicative complexity are presented for blocklengths N≤64, achieving lower multiplication counts than previously published FFTs. A detailed description for the cases m=1 and m=2 is presented.
متن کاملEfficient systolic solution for a new prime factor discrete Hartley transform algorithm - Circuits, Devices and Systems, IEE Proceedings G
Recently, a novel systolic structure has been proposed for the computation of DFT for transform length N = 4 M , M being prime to 4. In this paper, we have proposed a similar structure for the computation of DHT by prime factor decomposition. A new recursive algorithm is also proposed for computing DHT using a linear systolic array of cordic processing elements. The proposed structure has nearl...
متن کاملA DHT Based Measure of Randomness
This paper presents a new discrete Hilbert transform (DHT) based measure of randomness for discrete sequences. The measure has been used to test three different classes of sequences with satisfactory results. Introduction Random numbers are used in different fields as in cryptography for generating encryption keys, in simulating and modeling complex phenomena and for selecting random samples fr...
متن کاملDHT algorithm based on encoding algebraic integers
Introduction: The discrete Hartley transform (DHT) is an attractive alternative to the discrete Fourier transform (DFT) because of its real-valued computation and properties similar to those of the DFT [1]. Another interesting property of the DHT is that the same kernel is used for both the transform and its inverse transform. Consequently, since its introduction the DHT has found its way to ma...
متن کامل