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 published on a yearly basis
Papers
More filters
TL;DR: An efficient split algorithm for calculating the one-dimensional discrete Hartley transforms, by using a special partitioning in the frequency domain, is introduced.
Abstract: An efficient split algorithm for calculating the one-dimensional discrete Hartley transforms, by using a special partitioning in the frequency domain, is introduced. The partition determines a fast paired transform that splits the 2/sup r/-point unitary Hartley transform into a set of 2/sup r-n/-point odd-frequency Hartley transforms, n=1:r. A proposed method of calculation of the 2/sup r/-point Hartley transform requires 2/sup r-1/(r-3)+2 multiplications and 2/sup r-1/(r+9)-r/sup 2/-3r-6 additions.
14 citations
14 citations
Patent•
18 Oct 2012TL;DR: In this paper, an inverse discrete Fourier transform (DFT) based channel estimation method was proposed for time domain channel estimation from pilot signals, which consists of an inverse DFT module, a noise power estimator, and a noise filter.
Abstract: DFT-based channel estimation methods and systems are disclosed. One system includes an inverse discrete Fourier transform module, a noise power estimator, a noise filter and a discrete Fourier transform module. The inverse discrete Fourier transform module is configured to determine time domain estimates by applying an inverse discrete Fourier transform to initial channel estimates computed from pilot signals. Additionally, the noise power estimator is configured to estimate noise power by determining and utilizing time domain samples that are within a vicinity of sinc nulls of the time domain estimates. The noise filter is configured to filter noise from the time domain estimates based on the estimated noise power to obtain noise filtered time domain estimates. Further, the discrete Fourier transform module is configured to perform a discrete Fourier transform on the noise filtered time domain estimates to obtain frequency domain channel estimates for channels on which pilot signals are transmitted.
14 citations
TL;DR: A proposed method of calculating the 2r × 2r -point 2-D QDFT uses 18N2 less multiplications than the well-known column-row method and method of calculation based on the symplectic decomposition.
Abstract: In this paper, a general, efficient, split algorithm to compute the two-dimensional quaternion discrete Fourier transform (2-D QDFT), by using the special partitioning in the frequency domain, is introduced. The partition determines an effective transformation, or color image representation in the form of 1-D quaternion signals which allow for splitting the N × M-point 2-D QDFT into a set of 1-D QDFTs. Comparative estimates revealing the efficiency of the proposed algorithms with respect to the known ones are given. In particular, a proposed method of calculating the 2r × 2r -point 2-D QDFT uses 18N2 less multiplications than the well-known column-row method and method of calculation based on the symplectic decomposition. The proposed algorithm is simple to apply and design, which makes it very practical in color image processing in the frequency domain.
14 citations
TL;DR: A vector-radix algorithm for the fast computation of a 2-D discrete Hartley transform (DHT) and a radix-3 times 3 decimation in frequency algorithm for data sequences whose length is a power of three is developed.
Abstract: In this correspondence, we propose a vector-radix algorithm for the fast computation of a 2-D discrete Hartley transform (DHT). For data sequences whose length is a power of three, a radix-3 times 3 decimation in frequency algorithm is developed. It decomposes a length-N times N DHT into nine length-(N/3) times N (N/3) DHTs. Comparison of the computational complexity with known algorithms shows that the proposed algorithm, in some cases, reduces significantly the number of arithmetic operations.
14 citations