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: Since Givens-Jacobi rotation can be factored into a product of Gauss elementary matrices being unit lower and unit upper triangular matrices, the new fast rotation-based computational structures are suitable for an integer approximation of the DCT-IV/DST-IV and MDCT/MDST which are currently modern transform technologies for lossless audio coding.
21 citations
TL;DR: In this article, an alternative discrete Fourier transform algorithm with suppressed aliasing is presented, inspired by work done by Sorella and Ghosh [Rev. Sci. Instrum.
Abstract: An alternative discrete (fast) Fourier transform algorithm with suppressed aliasing is presented. It is inspired by work done by Sorella and Ghosh [Rev. Sci. Instrum. 55, 1348 (1984)]. While using their idea of expanding the time function as a series (as Schutte [Rev. Sci. Instrum. 52, 400 (1981)] and Makinen [Rev. Sci. Instrum. 53, 627 (1982)] have done), it corrects a flaw in their method. The remarkable quality of the calculation is illustrated for an exponential decay by comparing the results to analytical values.
21 citations
TL;DR: This paper proposes a novel approach for computing real-valued discrete transforms such as the discrete cosine transform and the discrete Hartley transform based on the algebraic integer encoding scheme, and proposes a fully pipelined systolic architecture with O ( N ) throughput.
Abstract: In this paper, we propose a novel approach for computing real-valued discrete transforms such as the discrete cosine transform (DCT) and the discrete Hartley transform (DHT). The approach is based on the algebraic integer encoding scheme. With the aid of this scheme, an error-free representation of the cos, sin , and cas functions becomes possible. For further complexity reduction, two different approximation methods are presented. Furthermore, for the implementation of these algorithms, a fully pipelined systolic architecture with O ( N ) throughput is proposed.
21 citations
TL;DR: A new real-valued lapped transform for 2D-signal and image processing that allows unambiguous detection of spatial orientation from spectral energy and compares it to the complex-valued discrete Fourier transform.
21 citations
30 May 1994
TL;DR: The general factorization of a linear-phase paraunitary filter bank is revisited and a class of lapped orthogonal transforms with extended overlap (GenLOT) is introduced, based on the discrete cosine transform.
Abstract: The general factorization of a linear-phase paraunitary filter bank (LPPUFB) is revisited and we introduce a class of lapped orthogonal transforms with extended overlap (GenLOT). In this formulation, the discrete cosine transform (DCT) is the order-1 GenLOT, the lapped orthogonal transform is the order-2 GenLOT, and so on, for any filter length which is an integer multiple of the block size. All GenLOTs are based on the DCT and have fast implementation algorithms. The degrees of freedom in the design of GenLOTs are described and design examples are presented along with some practical applications. >
21 citations