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.

Discrete Fourier transforms when the number of data samples is prime

Abstract: The discrete Fourier transform of a sequence of N points, where N is a prime number, is shown to be essentially a circular correlation. This can be recognized by rearranging the members of the sequence and the transform according to a rule involving a primitive root of N. This observation permits the discrete Fourier transform to be computed by means of a fast Fourier transform algorithm, with the associated increase in speed, even though N is prime.

Lapped transforms for efficient transform/subband coding

Abstract: Two lapped transforms for subband/transform coding of signals are introduced: a version of the lapped orthogonal transform (LOT), which can be efficiently computed for any transform length; and the modulated lapped transform (MLT), which is based on a modulated quadrature mirror (QMF) bank. The MLT can also be efficiently computed by means of a type-IV discrete sine transform (DST-IV). The LOT and the MLT are both asymptotically optimal lapped transforms for coding an AR(1) signal with a high intersample correlation coefficient. The coding gains of the LOT and MLT of length M are higher than that of the discrete cosine transform (DCT) of the same length; they are actually close to the coding gains obtained with a DCT of length 2M. An MLT-based adaptive transform coder (ACT) for speech signals is simulated; the code is essentially free from frame rate noise and has a better spectral resolution that DCT-based ATC systems. >

A fast recursive algorithm for computing the discrete cosine transform

Abstract: The discrete cosine transform (DCT) is widely applied in various fields, including image data compression, because it operates like the Karhunen-Loeve transform for stationary random data. This paper presents a recursive algorithm for DCT with a structure that allows the generation of the next higher order DCT from two identical lower order DCT's. As a result, the method for implementing this recursive DCT requires fewer multipliers and adders than other DCT algorithms.

Determination of Two-Dimensional Correlation Spectra Using the Hilbert Transform

Abstract: A computationally efficient numerical procedure to generate twodimensional (2D) correlation spectra from a set of spectral data collected at certain discrete intervals of an external physical variable, such as time, temperature, pressure, etc., is proposed. The method is based on the use of a discrete Hilbert transform algorithm which carries out the time-domain orthogonal transformation of dynamic spectra. The direct computation of a discrete Hilbert transform provides a definite computational advantage over the more traditional fast Fourier transform route, as long as the total number of discrete spectral data traces does not significantly exceed 40. Furthermore, the mathematical equivalence between the Hilbert transform approach and the original formal definition based on the Fourier transform offers an additional useful insight into the true nature of the asynchronous 2D spectrum, which may be regarded as a time-domain cross-correlation function between orthogonally transformed dynamic spectral intensity variations.

What is the fast Fourier transform

Abstract: The fast Fourier transform is a computational tool which facilitates signal analysis such as power spectrum analysis and filter simulation by means of digital computers. It is a method for efficiently computing the discrete Fourier transform of a series of data samples (referred to as a time series). In this paper, the discrete Fourier transform of a time series is defined, some of its properties are discussed, the associated fast method (fast Fourier transform) for computing this transform is derived, and some of the computational aspects of the method are presented. Examples are included to demonstrate the concepts involved.