Topic
Discrete sine transform
About: Discrete sine transform is a research topic. Over the lifetime, 3269 publications have been published within this topic receiving 73181 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: A fast recursive algorithm for the discrete sine transform (DST) is developed that can be considered as a generalization of the Cooley-Tukey FFT (fast Fourier transform) algorithm.
Abstract: A fast recursive algorithm for the discrete sine transform (DST) is developed. An N-point DST can be generated from two identical N/2-point DSTs. Besides being recursive, this algorithm requires fewer multipliers and adders than other DST algorithms. It can be considered as a generalization of the Cooley-Tukey FFT (fast Fourier transform) algorithm. The structure of the algorithm is suitable for VLSI implementation. >
80 citations
TL;DR: This paper suggests a generalization of the Hartley transformation based on the fractional Fourier transform, coined it “fractional Hartley transform (FHT)” and additional useful transformations used for signal processing are discussed.
80 citations
TL;DR: A novel double-image encryption–compression scheme proposed by combining compressive sensing with discrete fractional random transform based on two circular matrices, demonstrating the validity and security of the scheme.
79 citations
TL;DR: Fast recursive algorithms for the computation of the discrete cosine and sine transforms are developed, which have less multiplications by two, and add operations are better positioned, giving rise to faster computation and easier VLSI implementation.
Abstract: Fast recursive algorithms for the computation of the discrete cosine and sine transforms are developed. An N-point discrete cosine transform (DCT) or discrete sine transform (DST) can be computed from two N/2-point DCTs or DSTs. Compared to the existing algorithms the algorithms have less multiplications by two, and add operations are better positioned, giving rise to faster computation and easier VLSI implementation. >
79 citations
TL;DR: In this article, a generalized discrete cosine transform with three parameters was proposed and its orthogonality was proved for some new cases, and a new type of discrete W transform was proposed.
Abstract: The discrete cosine transform (DCT), introduced by Ahmed, Natarajan and Rao, has been used in many applications of digital signal processing, data compression and information hiding. There are four types of the discrete cosine transform. In simulating the discrete cosine transform, we propose a generalized discrete cosine transform with three parameters, and prove its orthogonality for some new cases. A new type of discrete cosine transform is proposed and its orthogonality is proved. Finally, we propose a generalized discrete W transform with three parameters, and prove its orthogonality for some new cases. Keywords: Discrete Fourier transform, discrete sine transform, discrete cosine transform, discrete W transform Nigerian Journal of Technological Research , vol7(1) 2012
79 citations