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.

The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms

Abstract: In this paper we present results in the development of decimation-in-frequency algorithms for a family of discrete sine and cosine transforms. They are closely related to the decimation-in-time algorithms developed by Yip and Rao [1]. The complexity of the algorithms was examined through the number of multiplications and additions as well as the number of different constants required in the transforms. It was found that the decimation-in-frequency approach provides a viable alternative to other fast algorithms for the discrete sine and cosine transforms. In particular, the recursive and modular structure of the algorithms lends itself readily to possible hardware realization.

On the Equivalence Between One-Dimensional Discrete Walsh-Hadamard and Multidimensional Discrete Fourier Transforms

Abstract: It is shown that the discrete Walsh–Hadamard transform applied to 2none-dimensional data is equivalent to the discrete n-dimensional Fourier transform applied to the same 2ndata arranged on the binary n-cube. A similar relationship is valid for the generalized discrete Walsh transform suggested by Andrews and Caspari. This relationship explains the theorem concerning the shift invariance of the power spectrum for the Walsh–Hadamard transform and its generalizations.

Warped discrete cosine transform-based noisy speech enhancement

Abstract: In this paper, a warped discrete cosine transform (WDCT)-based approach to enhance the degraded speech under background noise environments is proposed. For developing an effective expression of the frequency characteristics of the input speech, the variable frequency warping filter is applied to the conventional discrete cosine transform (DCT). The frequency warping control parameter is adjusted according to the analysis of spectral distribution in each frame. For a more accurate analysis of spectral characteristics, the split-band approach in which the global soft decision for speech presence is performed in each band separately is employed. A number of subjective and objective tests show that the WDCT-based enhancement method yields better performance than the conventional DCT-based algorithm.

A derivation for the discrete cosine transform

Abstract: The purpose of this letter is to derive the discrete cosine transform (DCT) as a limiting case of the Karhunen-Loeve transform (KLT) of a first-order Markov process, as the correlation coefficient approaches 1

The digital computation of discrete spectra using the fast Fourier transform

Abstract: This paper is devoted to a discussion of discrete spectrum analysis which is important in applicational areas such as sonar and replica correlation. The discrete Fourier transform is shown to arise naturally as a consequence of finite impulsive sampling and the fast Fourier transform is introduced as the most efficient means of computing the discrete Fourier transform. These are described in terms of parameters pertinent to digital sonar signal processing, including resolution, dynamic range, and processing gain. Computational accuracy is investigated as a function of word lengths associated with the data, kernels, and intermediate transforms for both conditional and automatic array scaling. In real-time equipment, it is frequently necessary to employ some sort of automatic gain control and such a device is investigated here. Results are presented which enable specification of word length and automatic gain control requirements as a function of desired dynamic range, input signal-to-noise ratio, and mean-square error at the quantizer output.