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
47 citations
14 Apr 1991
TL;DR: In this paper, an extended lapped transform (ELT) based on a type-IV discrete cosine transform (DCT-IV) is proposed for AR (autoregressive) signals and also for real speech signals.
Abstract: The author presents a fast algorithm for extended lapped transform (ELT), which is a modulated lapped transform (MLT) with longer basis functions. The proposed algorithm is based on a type-IV discrete cosine transform (DCT-IV). For AR (autoregressive) signals and also for real speech signals, the coding performance of the ELT is shown to be significantly higher than that of a block transform such as the DCT (discrete cosine transform), actually approaches the performance of ideal filter banks. Therefore, the ELT is a promising substitute for traditional block transforms in transform coding systems, and also a good substitute for less efficient filter banks in subband coding systems. >
47 citations
TL;DR: This work shows how to implement the fractional Hilbert transform for two-dimensional inputs, which is now suitable for image processing.
Abstract: The classical Hilbert transform can be implemented optically as a spatial-filtering process, whereby half the Fourier spectrum is π-phase shifted. Recently the Hilbert transform was generalized. The generalized version, called the fractional Hilbert transform, is quite easy to implement optically if the input is one dimensional. Here we show how to implement the fractional Hilbert transform for two-dimensional inputs. Hence the new transform is now suitable for image processing.
47 citations
01 Jan 2012
TL;DR: In this correspondence paper, biometrics is chosen as the primary application; and hence, a new technique is proposed for securing fingerprints during communication and transmission over insecure channel, i.e., fractional random wavelet transform (FrRnWT).
Abstract: In this correspondence paper, the wavelet transform, which is an important tool in signal and image processing, has been generalized by coalescing wavelet transform and fractional random transform. The new transform, i.e., fractional random wavelet transform (FrRnWT) inherits the excellent mathematical properties of wavelet transform and fractional random transform. Possible applications of the proposed transform are in biometrics, image compression, image transmission, transient signal processing, etc. In this correspondence paper, biometrics is chosen as the primary application; and hence, a new technique is proposed for securing fingerprints during communication and transmission over insecure channel.
46 citations
TL;DR: The discrete Hartley transform as mentioned in this paper is a new tool for the analysis, design and implementation of digital signal processing algorithms and systems, which is strictly symmetric concerning the transformation and its inverse.
Abstract: The discrete Hartley transform is a new tool for the analysis, design and implementation of digital signal processing algorithms and systems. It is strictly symmetrical concerning the transformation and its inverse. A new fast Hartley transform algorithm has been developed. Applied to real signals, it is faster than a real fast Fourier transform, especially in the case of the inverse transformation. The speed of operation for a fast convolution can thus be increased.
46 citations