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.

A fast hybrid Jacket-Hadamard matrix based diagonal block-wise transform

Abstract: In this paper, based on the block (element)-wise inverse Jacket matrix, a unified fast hybrid diagonal block-wise transform (FHDBT) algorithm is proposed. A new fast diagonal block matrix decomposition is made by the matrix product of successively lower order diagonal Jacket matrix and Hadamard matrix. Using a common lower order matrix in the form of [111-1], a fast recursive structure can be developed in the FHDBT, which is able to convert a newly developed discrete cosine transform (DCT)-II, discrete sine transform (DST)-II, discrete Fourier transform (DFT), and Haar-based wavelet transform (HWT). Since these DCT-II, DST-II, DFT, and HWT are widely used in different areas of applications, the proposed FHDBT can be applied to the heterogeneous system requiring several transforms simultaneously. Comparing with pre-existing DCT-II, DST-II, DFT, and HWT, it is shown that the proposed FHDBT exhibits less the complexity as its matrix size gets larger. The proposed algorithm is also well matched to circulant channel matrix. From the numerical experiments, it is shown that a better performance can be achieved by the use of DCT/DST-II compression scheme compared with the DCT-II only compression method.

Two-dimensional complex Fourier transform via the Radon transform.

Abstract: A hybrid system has been constructed to perform the complex Fourier transform of real 2-D data The system is based on the Radon transform; ie, operations are performed on 1-D projections of the data The projections are derived optically from transmissive or reflective objects, and the complex Fourier transform is performed with SAW filters via the chirp transform algorithm The real and imaginary parts of the 2-D transform are produced in two bipolar output channels

Discrete singular operators and equations in half-space (pp. 84-93)

Abstract: Discrete multidimensional singular integral equations with Calderon–Zygmund kernels are considered in a discrete half-space. The solvability of such equations is studied using the properties of discrete Fourier transform and corresponding properties of Calderon–Zygmund operators.

Method and apparatus for efficient computation of discrete fourier transform (dft) and inverse discrete fourier transform (idft)

Abstract: The present invention significantly reduces the number of complex computations that must be performed in computing the discrete Fourier transform (DFT) and inverse DFT (IDFT) operations. In particular, the DFT and IDFT operations are computed using the same computing device. The computation operations are substantially identical for both operations with the exception that for the IDFT operation, the data are complex conjugated before and after processing. Using the same computing device/operations, both DFT and IDFT computations are optimized for maximum efficiency. A common transform process is selectively connected to first and second data processing paths. A DFT operation is performed on an N-point sequence on the first data processing path, and an IDFT operation is performed on an N-point sequence on the second data processing path using the same N-point fast Fourier transform (FFT).