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 for image encryption using Hartley transform with jigsaw transform and logistic map, which has been used to generate the random intensity mask which is known as chaotic randomintensity mask is proposed.
62 citations
TL;DR: The discrete Hartley transform is generalized into four classes in the same way as the generalized discrete Fourier transform to enable fast computation of skew-circular convolution by the generalized transforms for any composite number of data points.
Abstract: The discrete Hartley transform is generalized into four classes in the same way as the generalized discrete Fourier transform. Fast algorithms for the resulting transforms are derived. The generalized transforms are expected to be useful in applications such as digital filter banks, fast computation of the discrete Hartley transform for any composite number of data points, fast computations of convolution, and signal representation. The fast computation of skew-circular convolution by the generalized transforms for any composite number of data points is discussed in detail. >
62 citations
01 Jan 2010
TL;DR: In this article, a new integral transform, namely Sumudu transform, was applied to solve linear ordinary differential equation with and without constant coefficients having convolution terms, in particular, to solve Spring-Mass systems, population growth and financial problem.
Abstract: In this work a new integral transform, namely Sumudu transform was applied to solve linear ordinary differential equation with and without constant coefficients having convolution terms. In particular we apply Sumudu transform technique to solve Spring-Mass systems, Population Growth and financial problem. Mathematics Subject Classification: Primary 35G15, 44A85; Secondary 44A35
62 citations
TL;DR: A new approach for image encryption based on the real-valuedness of the reality-preserving multiple-parameter fractional Fourier transform and the decorrelation property of chaotic maps is proposed in order to meet the requirements of the secure image transmission.
62 citations
TL;DR: It is well known that the infinite Kramers-Kronig transform is equivalent to the infinite Hilbert transform, which is the equivalent of the allied Fourier integrals as discussed by the authors.
Abstract: It is well known that the infinite Kramers–Kronig transform is equivalent to the infinite Hilbert transform, which is equivalent to the allied Fourier integrals. The Hilbert transform can thus be i...
61 citations