Topic

# Discrete sine transform

About: Discrete sine transform is a(n) research topic. Over the lifetime, 3269 publication(s) have been published within this topic receiving 73181 citation(s).

##### Papers published on a yearly basis

##### Papers

More filters

••

TL;DR: In this article, a discrete cosine transform (DCT) is defined and an algorithm to compute it using the fast Fourier transform is developed, which can be used in the area of digital processing for the purposes of pattern recognition and Wiener filtering.

Abstract: A discrete cosine transform (DCT) is defined and an algorithm to compute it using the fast Fourier transform is developed. It is shown that the discrete cosine transform can be used in the area of digital processing for the purposes of pattern recognition and Wiener filtering. Its performance is compared with that of a class of orthogonal transforms and is found to compare closely to that of the Karhunen-Loeve transform, which is known to be optimal. The performances of the Karhunen-Loeve and discrete cosine transforms are also found to compare closely with respect to the rate-distortion criterion.

4,205 citations

••

Bell Labs

^{1}TL;DR: The Fourier transform data communication system is described and the effects of linear channel distortion are investigated and a differential phase modulation scheme is presented that obviates any equalization.

Abstract: The Fourier transform data communication system is a realization of frequency-division multiplexing (FDM) in which discrete Fourier transforms are computed as part of the modulation and demodulation processes. In addition to eliminating the bunks of subcarrier oscillators and coherent demodulators usually required in FDM systems, a completely digital implementation can be built around a special-purpose computer performing the fast Fourier transform. In this paper, the system is described and the effects of linear channel distortion are investigated. Signal design criteria and equalization algorithms are derived and explained. A differential phase modulation scheme is presented that obviates any equalization.

2,446 citations

•

15 Aug 1990TL;DR: This paper presents two Dimensional DCT Algorithms and their relations to the Karhunen-Loeve Transform, and some applications of the DCT, which demonstrate the ability of these algorithms to solve the discrete cosine transform problem.

Abstract: Discrete Cosine Transform. Definitions and General Properties. DCT and Its Relations to the Karhunen-Loeve Transform. Fast Algorithms for DCT-II. Two Dimensional DCT Algorithms. Performance of the DCT. Applications of the DCT. Appendices. References. Index.

1,998 citations

••

TL;DR: A Fast Discrete Cosine Transform algorithm has been developed which provides a factor of six improvement in computational complexity when compared to conventional DiscreteCosine Transform algorithms using the Fast Fourier Transform.

Abstract: A Fast Discrete Cosine Transform algorithm has been developed which provides a factor of six improvement in computational complexity when compared to conventional Discrete Cosine Transform algorithms using the Fast Fourier Transform. The algorithm is derived in the form of matrices and illustrated by a signal-flow graph, which may be readily translated to hardware or software implementations.

1,272 citations

••

23 Mar 1999TL;DR: This paper proposes to use Haar Wavelet Transform for time series indexing and shows that Haar transform can outperform DFT through experiments, and proposes a two-phase method for efficient n-nearest neighbor query in time series databases.

Abstract: Time series stored as feature vectors can be indexed by multidimensional index trees like R-Trees for fast retrieval. Due to the dimensionality curse problem, transformations are applied to time series to reduce the number of dimensions of the feature vectors. Different transformations like Discrete Fourier Transform (DFT) Discrete Wavelet Transform (DWT), Karhunen-Loeve (KL) transform or Singular Value Decomposition (SVD) can be applied. While the use of DFT and K-L transform or SVD have been studied on the literature, to our knowledge, there is no in-depth study on the application of DWT. In this paper we propose to use Haar Wavelet Transform for time series indexing. The major contributions are: (1) we show that Euclidean distance is preserved in the Haar transformed domain and no false dismissal will occur, (2) we show that Haar transform can outperform DFT through experiments, (3) a new similarity model is suggested to accommodate vertical shift of time series, and (4) a two-phase method is proposed for efficient n-nearest neighbor query in time series databases.

1,133 citations