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.

Low-complexity FFT structures for OFDM transceivers

Abstract: Orthogonal frequency-division multiplexing is a multiple-access technique with modulation and demodulation implemented by an inverse discrete Fourier transform (DFT) and a DFT, respectively. In a downlink (uplink) environment, an individual receiver (transmitter) may only use a small number of subchannels at any given time, in which case it does not make sense to require full DFT demodulation (inverse DFT modulation). Several existing low-complexity techniques for computing a partial DFT or inverse DFT with power-of-two size are examined. Low-complexity fast Fourier transform structures for full, few input, and few output nonpower-of-two transforms are derived.

High-Speed Image Registration Algorithm with Subpixel Accuracy

Abstract: A new, fast and computationally efficient lateral subpixel shift registration algorithm is presented. It is limited to register images that differ by small subpixel shifts otherwise its performance degrades. This algorithm significantly improves the performance of the single-step discrete Fourier transform approach proposed by Guizar-Sicairos and can be applied efficiently on large dimension images. It reduces the dimension of Fourier transform of the cross correlation matrix and reduces the discrete Fourier transform (DFT) matrix multiplications to speed up the registration process. Simulations show that our algorithm reduces computation time and memory requirements without sacricing the accuracy associated with the usual FFT approach accuracy.

Discrete fractional Hadamard transform

Abstract: Hadamard transform is an important tool in discrete signal processing. In this paper, we define the discrete fractional Hadamard transform which is a generalized one. The development of discrete fractional Hadamard is based upon the same spirit as that of the discrete fractional Fourier transform.

Systolic arrays for the discrete Hilbert transform

Abstract: A new fast parallel array algorithm to compute the discrete Hilbert transform for radix-2 length sequences is proposed. Unlike the existing fast methods which use transforms such as the fast Fourier transform, the proposed algorithm does not require the help of any fast transforms. This array algorithm offers a suitable expression for developing a VLSI systolic array for the discrete Hilbert transform. The authors propose one-dimensional and two-dimensional systolic architectures for the discrete Hilbert transform. The proposed architectures have the features of massive parallelism, high pipelining, regular data flow, modular nature and local interconnections. These arrays offer high speed computation of the discrete Hilbert transform for real-time signal processing applications.

Properties of the Multidimensional Generalized Discrete Fourier Transform

Abstract: In this work the generalized discrete Fourier transform (GFT), which includes the DFT as a particular case, is considered. Two pairs of fast algorithms for evaluating a multidimensional GFT are given (T-algorithm, F-algorithm, and T′-algorithm, F′-algorithm). It is shown that in the case of the DFT of a vector, the T-algorithm represents a form of the classical FFT algorithm based on a decimation in time, and the F-algorithm represents a form of the classical FFT algorithm based on decimation in frequency. Moreover, it is shown that the T′-algorithm and the T-algorithm involve exactly the same arithmetic operations on the same data. The same property holds for the F′-algorithm and the F-algorithm. The relevance of such algorithms is discussed, and it is shown that the T′-algorithm and the F′-algorithm are particularly advantageous for evaluating the DFT of large sets of data.