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 new fast algorithm for computing the two-dimensional discrete Hartley transform that requires the lowest number of multiplications compared with other related algorithms is presented.
Abstract: A new fast algorithm for computing the two-dimensional discrete Hartley transform is presented. This algorithm requires the lowest number of multiplications compared with other related algorithms.
18 citations
TL;DR: If the original signal is defined to be symmetrical, the discrete Fourier transform used in cepstral analysis can be replaced by a discrete cosine transform (DCT) and it is found that the use of the DCT does not degrade the information contained in the cepstrum while substantially reducing the computational complexity.
Abstract: If the original signal is defined to be symmetrical, the discrete Fourier transform (DFT) used in cepstral analysis can be replaced by a discrete cosine transform (DCT). This principle is applied to the evaluation of the real and complex pseudocepstrum of speech signals. In both the real and complex cepstrum cases, it is found that the use of the DCT does not degrade the information contained in the cepstrum while substantially reducing the computational complexity.
18 citations
TL;DR: New results are given about the structure of the product of two Toeplitz matrices, which allow the CGN method to achieve a superlinear rate of convergence.
18 citations
01 Dec 2008
TL;DR: Simulation result shows that the proposed DCT based ECG signal compression method ensures higher compression ratio than the conventional methods published in the literature.
Abstract: In this paper a discrete cosine transform (DCT) based ECG signal compression method is proposed. DCT is applied on the residual beats of ECG signal obtained after subtracting the period normalized and dc removed beats from a reference beat. The quantization and the threshold vectors are optimized to minimize the entropy of the quantized coefficients for a target distortion. The quantized coefficients are lossless encoded for further compression. Simulation result shows that the proposed method ensures higher compression ratio than the conventional methods published in the literature.
18 citations
TL;DR: The basis for the definition of such transforms, which are respectively referred by the acronyms GFrCT and GFrST, is the recently proposed fractional Fourier transform over finite fields (GFrFT).
18 citations