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 orthogonal approximation for the 8-point discrete cosine transform (DCT) is introduced, and could outperform state-of-the-art algorithms in low and high image compression scenarios, exhibiting at the same time a comparable computational complexity.
Abstract: An orthogonal approximation for the 8-point discrete cosine transform (DCT) is introduced. The proposed transformation matrix contains only zeros and ones; multiplications and bit-shift operations are absent. Close spectral behavior relative to the DCT was adopted as design criterion. The proposed algorithm is superior to the signed discrete cosine transform. It could also outperform state-of-the-art algorithms in low and high image compression scenarios, exhibiting at the same time a comparable computational complexity.
152 citations
TL;DR: In this paper, the influence of time-domain noise on the results of a discrete Fourier transform (DFT) was studied and it was shown that the resulting frequency domain noise can be modeled using a Gaussian distribution with a covariance matrix which is nearly diagonal.
Abstract: An analysis is made to study the influence of time-domain noise on the results of a discrete Fourier transform (DFT). It is proven that the resulting frequency-domain noise can be modeled using a Gaussian distribution with a covariance matrix which is nearly diagonal, imposing very weak assumptions on the noise in the time domain.
150 citations
TL;DR: In this article, the Laplace transform of the solution for TEM soundings over an N-layer earth was derived and used to invert it numerically using the Gaver-Stehfest algorithm.
Abstract: Calculations for the transient electromagnetic (TEM) method are commonly performed by using a discrete Fourier transform method to invert the appropriate transform of the solution. We derive the Laplace transform of the solution for TEM soundings over an N-layer earth and show how to use the Gaver-Stehfest algorithm to invert it numerically. This is considerably more stable and computationally efficient than inversion using the discrete Fourier transform.
149 citations
TL;DR: In this paper, the authors present new discrete Fourier transform methods which are recursive, expressible in state variable form, and involve real number computations, which are especially useful for running Fourier transformation and for general and multirate sampling.
Abstract: This paper presents new discrete Fourier transform methods which are recursive, expressible in state variable form, and which involve real number computations. The algorithms are especially useful for running Fourier transformation and for general and multirate sampling. Numerical examples are given which illustrate the ability of these spectral observers to operate at sampling rates other than the Nyquist rate, to perform one-step-per-sample updating, and to converge to the spectrum in the presence of severe numerical truncation error.
146 citations
TL;DR: The advantages of using the Discrete Cosine Transform (DCT) as compared to the standard Discrete Fourier Transform (DFT) for the purpose of removing noise embedded in a speech signal is illustrated.
146 citations