Topic
Hartley transform
About: Hartley transform is a research topic. Over the lifetime, 2709 publications have been published within this topic receiving 79944 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: A new method to evaluate the WVD of a real signal using the fast Hartley transform (FHT) is presented, compared with the existing fast Fourier transform (FFT) method in terms of computation time.
Abstract: The Wigner-Ville distribution (WVD) is of great significance in time-frequency signal analysis. In the letter we present a new method to evaluate the WVD of a real signal using the fast Hartley transform (FHT). This is compared with the existing fast Fourier transform (FFT) method in terms of computation time. The FHT method presented turns out to be much faster than the FFT method.
13 citations
TL;DR: The purpose of this correspondence is to point out a number of significant references, in the area of Walsh-Fourier transform conversion, that were missed in a recent paper.
Abstract: The purpose of this correspondence is to point out a number of significant references, in the area of Walsh-Fourier transform conversion, that were missed in a recent paper [1].
13 citations
TL;DR: A signal-dependent wavelet transform based on the lifting scheme is proposed and results indicate that the proposed method is superior to the S+P method.
Abstract: A signal-dependent wavelet transform based on the lifting scheme is proposed. The transform can be made reversible (i.e. an integer-to-integer transform). The reversible transform, followed by arithmetic coding, is applied to lossless image compression. Simulation results indicate that the proposed method is superior to the S+P method.
13 citations
TL;DR: A new polynomial transform algorithm for the MDDWT is obtained that needs no operations on complex data and the number of multiplications for computing an r-dimensional DWT is only 1 times that of the commonly used row-column method.
Abstract: The multidimensional (MD) polynomial transform is used to convert the MD W transform (MDDWT) into a series of one-dimensional (1-D) W transforms (DWTs). Thus, a new polynomial transform algorithm for the MDDWT is obtained. The algorithm needs no operations on complex data. The number of multiplications for computing an r-dimensional DWT is only 1 times that of the commonly used row-column method. The number of additions is also reduced considerably.
13 citations
24 May 2011
TL;DR: In this paper, a discrete Hartley transform (DHT) was used as an alternative to replace the conventional complex valued and mature discrete Fourier transform (DFT) as OFDM modulator and demodulator.
Abstract: The investigation on discrete Hartley transform (DHT) as an alternative to replace the conventional complex valued and mature discrete Fourier transform (DFT) as OFDM modulator and demodulator was carried out in this research. The random binary data was generated and transmitted via the dispersive channel with using additive white Gaussian noise(AWGN) channel model. The performance of the system was evaluated by calculating the number of bit errors for several value of signal to noise ratio (SNR). The measurements of parameters were repeated five times to obtain and to calculate the accuracy of the new system. The plotted graph of average BER verses SNR showed that the BER was decreased with the increasing of given value SNR. The analysis of system performance was also evaluated for several numbers of sub carriers used and the results showcased some advantages. The modification of DHT algorithm is expected to reduce the complexity and time consuming for long-length of computational on the performing of OFDM modulator and demodulator based on DHT.
13 citations