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: The sampling theorem for OLCT signals presented here serves as a unification and generalization of previously developed sampling theorems.
Abstract: The offset linear canonical transform (OLCT) is the name of a parameterized continuum of transforms which include, as particular cases, the most widely used linear transforms in engineering such as the Fourier transform (FT), fractional Fourier transform (FRFT), Fresnel transform (FRST), frequency modulation, time shifting, time scaling, chirping and others. Therefore the OLCT provides a unified framework for studying the behavior of many practical transforms and system responses. In this paper the sampling theorem for OLCT is considered. The sampling theorem for OLCT signals presented here serves as a unification and generalization of previously developed sampling theorems.
100 citations
TL;DR: A new multi-image encryption scheme based on quaternion discrete fractional Hartley transform (QDFrHT) and an improved pixel adaptive diffusion is proposed, which can simultaneously increase the encryption capacity and reduce the consumption of keys.
100 citations
TL;DR: The system parameters of Arnold transform and gyrator transform in each channel serve as additional keys in color image encryption and decryption, and hence enhances the security of the system.
97 citations
TL;DR: This paper presents a generalized transform called general reverse jacket transform (GRJT) that unifies all the three classes of transforms, WHT, CWHT, and CRJT, and is also applicable for any even length vectors, that is of size 2/sup r//spl times/2/Sup r/.
Abstract: Generalization of the well-known Walsh-Hadamard transform (WHT), namely center-weighted Hadamard transform (CWHT) and complex reverse-jacket transform (CRJT) have been proposed and their fast implementation and simple index generation algorithms have recently been reported. These transforms are of size 2/sup r//spl times/2/sup r/ for integral values or r, and defined in terms of binary radix representation of integers. In this paper, using appropriate mixed-radix representation of integers, we present a generalized transform called general reverse jacket transform (GRJT) that unifies all the three classes of transforms, WHT, CWHT, and CRJT, and is also applicable for any even length vectors, that is of size 2/sup r//spl times/2/sup r/. A subclass of GRJT which includes CRJT (but not CWHT) is applicable for finite fields and useful for constructing error control codes.
97 citations
TL;DR: It is shown that the DCT, DST, DHT and their inverse transforms share an almost identical lattice structure so that they are very suitable for VLSI implementation for high-speed applications.
Abstract: Unified efficient computations of the discrete cosine transform (DCT), discrete sine transform (DST), discrete Hartley transform (DHT), and their inverse transforms employing the time-recursive approach are considered. Unified parallel lattice structures that can dually generate the DCT and DST simultaneously as well the DHT are developed. These structures can obtain the transformed data for sequential input time recursively with a throughput rate of one per clock cycle. The total number of multipliers required is a linear function of the transform size N, with no constraint on N. The resulting architectures are regular, modular, and without global communication so that they are very suitable for VLSI implementation for high-speed applications. It is shown that the DCT, DST, DHT and their inverse transforms share an almost identical lattice structure. The tradeoff between time and area for the block data processing is considered. >
97 citations