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: An efficient method for the realization of the paired algorithm for calculation of the one-dimensional (1-D) discrete Fourier transform (DFT), by simplifying the signal-flow graph of the transform, is described.
Abstract: An efficient method for the realization of the paired algorithm for calculation of the one-dimensional (1-D) discrete Fourier transform (DFT), by simplifying the signal-flow graph of the transform, is described. The signal-flow graph is modified by separating the calculation for real and imaginary parts of all inputs and outputs in the signal-flow graph and using properties of the transform. The examples for calculation of the eight- and 16-point DFTs are considered in detail. The calculation of the 16-point DFT of real data requires 12 real multiplications and 58 additions. Two multiplications and 20 additions are used for the eight-point DFT.
17 citations
TL;DR: In this article, the authors prove a sampling theorem for holomorphic functions on the hyperboloid (or its stereographic projection onto the open unit disk), seen as a homogeneous space of the pseudo-unitary group SU(1,1), and provide a reconstruction formula for bandlimited functions, through a sinc-type kernel, and a discrete Fourier transform from N samples properly chosen.
Abstract: Using Coherent-State (CS) techniques, we prove a sampling theorem for holomorphic functions on the hyperboloid (or its stereographic projection onto the open unit disk $\mathbb{D}_{1}$
), seen as a homogeneous space of the pseudo-unitary group SU(1,1). We provide a reconstruction formula for bandlimited functions, through a sinc-type kernel, and a discrete Fourier transform from N samples properly chosen. We also study the case of undersampling of band-unlimited functions and the conditions under which a partial reconstruction from N samples is still possible and the accuracy of the approximation, which tends to be exact in the limit N→∞.
17 citations
04 Oct 1998
TL;DR: A discrete two-dimensional Fourier transform based on quaternion (or hypercomplex) numbers allows colour images to be transformed as a whole, rather than as colour-separated components.
Abstract: A discrete two-dimensional Fourier transform based on quaternion (or hypercomplex) numbers allows colour images to be transformed as a whole, rather than as colour-separated components. The transform is reviewed and its basis functions presented with example images.
17 citations
01 Jul 1991
TL;DR: In this paper, a conceptually simple algorithm is presented for the determination of the transfer function for two-dimensional generalised or singular systems using the discrete Fourier transform (DFT).
Abstract: A systematic and conceptually simple algorithm is presented for the determination of the transfer function for two-dimensional generalised or singular systems. The method uses the discrete Fourier transform (DFT) and can easily be applied. The simplicity and efficiency of the algorithm are illustrated by two examples.
17 citations
TL;DR: The use of the Hartley transform (HT) in cepstrum analysis, as a substitute for the more commonly used Fourier transform (FT), is examined.
Abstract: The use of the Hartley transform (HT) in cepstrum analysis, as a substitute for the more commonly used Fourier transform (FT), is examined. With this substitution, the input to the cepstrum must be in the real domain only. The benefits of using the HT are approximately 50% less data memory required and approximately 40% faster program execution, at no loss in accuracy. >
17 citations