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: In this paper, a new family of integral transforms depending on two parameters and related to the Dunkl transform is introduced, and the intimate connection that exists between this transformation and the quantum harmonic oscillator is developed.
10 citations
11 Dec 2006
TL;DR: The converged very large scale integration (VLSI) architecture for these hybrid transforms for video compression are designed, simulated and synthesized, and hybrid transforms architecture is proposed.
Abstract: In analog signal processing of multimedia applications, audio need not be compressed but video must be compressed in order to conserve the bandwidth. For this purpose fast cosine transform (FCT) is preferred, which is developed using fast Fourier transform (FFT). But it has several limitations of delays, area and power. In this paper the similarities among fast Fourier transform (FFT), fast cosine transform (FCT) and fast Hartley transform (FHT) have been studied. The converged very large scale integration (VLSI) architecture for these hybrid transforms for video compression are designed, simulated and synthesized. Implementing FCT, FFT, and FST from fast Hartley transform is developed and hybrid transforms architecture is proposed. Further more, delays and area overheads have been calculated. For all these transforms the layouts have been drawn using magma tools with 0.13 mum technology. Compression ratio for image with each transform and Hybrid transform is also implemented
10 citations
TL;DR: In this paper, the Fourier-based method of phasors is reformulated as an all-real calculation method which is based on the Hartley transform, which is applied to the calculation of harmonics in electric power distribution systems.
Abstract: The Fourier-based method of phasors is reformulated as an all-real calculation method which is based on the Hartley transform. In that transform, the all-real kernel cas (vt) is used rather than the familiar e/sup -jvt/ which is used in the Fourier transform. The concept of an all-real Hartley impedance is developed. The advantages and disadvantages of this alternate formulation are discussed. The method is applied to the calculation of harmonics in electric power distribution systems. >
10 citations
TL;DR: A new fast radix-3 algorithm for the computation of the length-N generalized discrete Hartley transform of type-II (GDHT-II), where n = 3, where m ≥ 2, which is lower than that of the traditional approach for length N.
Abstract: We present a new fast radix-3 algorithm for the computation of the length-N generalized discrete Hartley transform of type-II (GDHT-II), where N = 3m, m ≥ 2. Then we apply this algorithm to the direct computation of length-N GDHT-II coefficients when given three adjacent length-N/3 GDHT-II coefficients. The computational complexity of the proposed method is lower than that of the traditional approach for length N ≥ 9. The arithmetic operations can be saved from 19% to 29% for N = 3m varying from 9 to 243 and from 17% to 29% for N = 3×2m varying from 12 to 384. Furthermore, the new approach can be easily implemented.
10 citations
29 May 1989
TL;DR: In this paper, the concept of self-similarity of patterns is introduced, and it is proved that the class of selfsimilar patterns is closed with respect to spectral transformation, which is the case for both the Chrestenson and the Zhang-Hartley transforms.
Abstract: The idea of mosaics (of patterns) is introduced, and this structure is analyzed in the spectral domain. Also introduced is the concept of self-similarity of patterns, and it is proved that the class of self-similar patterns is closed with respect to spectral transformation. Self-similar patterns can be studied both with the Chrestenson and the Zhang-Hartley transforms. The latter has the advantage of being a real-valued transform. >
10 citations