scispace - formally typeset
Search or ask a question
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
More filters
Journal ArticleDOI
TL;DR: A review of the discrete Fourier transform, emphasizing the use of DFT in direct and indirect methods of time domain signal processing and a number of applications to communications.
Abstract: A review of the discrete Fourier transform, emphasizing the use of DFT in direct and indirect methods of time domain signal processing. T HE discrete Fourier transform (DFT), implemented as a computationally efficient algorithm called the fast Fourier transform (FFT), has found application to all aspects of signal processing. These applications include time domain processing as well as frequency domain processing. The proper noun \"Fourier\" may elicit images of frequency domain data and, by these images, restrict the vista of applications of this important tool.. W e will review the DFT with emphasis on perspectives which facilitate time domain processing. In particular, we will review a number of applications to communications.

22 citations

Proceedings ArticleDOI
O.K. Ersoy1, N. Hu
01 Apr 1987
TL;DR: A new approach is developed for the fast computation and VLSI implementation of all discrete trigonometric transforms in the least number of operations and pipelining stages in terms of the fast algorithm (FRFT) for the real discrete Fourier transform.
Abstract: A new approach is developed for the fast computation and VLSI implementation of all discrete trigonometric transforms in the least number of operations and pipelining stages. This is achieved in terms of the fast algorithm (FRFT) for the real discrete Fourier transform. FRFT is based upon Givens' plane rotation as the basic unit of computation in contrast to FFT's which are based upon the complex butterfly.

22 citations

Journal ArticleDOI
TL;DR: The unfolding technique is used to overcome the problem of difficult to realize pipeline that occur in iterative CORDIC algorithms and has a superior performance in terms of hardware complexity, control complexity, throughput, scalability, modularity, and pipelinability.
Abstract: In this paper, CORDIC (coordinate rotation digital computer)-based Cooley-Tukey fast Fourier transform (FFT)-like algorithms for power-of-two point discrete cosine transform/discrete sine transform/inverse discrete cosine transform/inverse discrete sine transform are proposed and their corresponding unified architectures are developed by fully reusing the unique two basic processing elements. The proposed algorithms have some distinguished advantages, such as FFT-like regular data flow, unique post-scaling factor, and arithmetic-sequence rotation angles. The developed unified architectures can compute four different transforms by simple routing the data flow according to the specific transform without feeding different transform coefficients or different transform kernels. The unfolding technique is used to overcome the problem of difficult to realize pipeline that occur in iterative CORDIC algorithms. Compared to existing unified architectures, the proposed architectures have a superior performance in terms of hardware complexity, control complexity, throughput, scalability, modularity, and pipelinability.

22 citations

Proceedings ArticleDOI
10 Sep 2000
TL;DR: The generalized lapped biorthogonal transform embedded inverse discrete cosine transform (ge-IDCT) with nonlinear weighting in the embedded transform domain can reconstruct the signal with alleviated blockishness.
Abstract: This paper presents the generalized lapped biorthogonal transform embedded inverse discrete cosine transform (ge-IDCT) as an alternative to the IDCT. The ge-IDCT with nonlinear weighting in the embedded transform domain can reconstruct the signal with alleviated blockishness. Additional complexity, imposed by the replacement, is trivial thanks to an efficient lattice structure. The proposed ge-IDCT is applied in the JPEG still image compression standard to demonstrate its validity.

22 citations

Journal ArticleDOI
TL;DR: By eliminating all unnecessary steps and storage locations, and by rearranging the intermediate results and the operation sequence, it is possible to reduce the computation time and the required core storage by a factor of 2 as compared to the case of arbitrary real input.
Abstract: A new algorithm is presented for calculating the real discrete Fourier transform of a real-valued input series with even symmetry. The algorithm is based on the fast Fourier transform algorithm for arbitrary real-valued input series (FTRVI) [1], [2]. By eliminating all unnecessary steps and storage locations, and by rearranging the intermediate results and the operation sequence, it is possible to reduce the computation time and the required core storage by a factor of 2 as compared to the case of arbitrary real input or by a factor of 4 as compared to the general fast Fourier transform for complex inputs.

22 citations


Network Information
Related Topics (5)
Feature extraction
111.8K papers, 2.1M citations
84% related
Image processing
229.9K papers, 3.5M citations
82% related
Image segmentation
79.6K papers, 1.8M citations
82% related
Optimization problem
96.4K papers, 2.1M citations
81% related
Network packet
159.7K papers, 2.2M citations
80% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20234
202234
202124
202021
201925
201833