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
Patent
22 Aug 2003
TL;DR: In this article, a Fourier transform apparatus whose pipeline width is independent of transform point number of individual pipeline FFT circuits in each stage is presented, composed of a preceding stage and a succeeding stage.
Abstract: A Fourier transform apparatus whose pipeline width is independent of transform point number of individual pipeline FFT circuits in each stage and composed of a preceding stage and a succeeding stage. Each of the stages includes M(power of 2)-point radix 2 pipeline FFT circuits each having two-parallel inputs/outputs in a number of a (divisor of M) which are equal in respect to the transform point number and data permutating means for data supply to the transform means of each stage so that the pipeline width of the Fourier transform apparatus is made independent of the transform point numbers of the individual pipeline FFT circuits in each stage.

21 citations

Patent
Ming Wu1, Lin Zhibin1, Ke Peng1, Deng Zheng1, Jing Lu1, Xiaojun Qiu1, Jiali Li1, Guoming Chen1, Hao Yuan1, Liu Kaiwen1 
25 Feb 2010
TL;DR: In this paper, a compensation method for audio frame loss in a Modified Discrete Cosine Transform (MDCT) domain is provided in the present invention The method include: step a, when the frame currently lost is the p-th frame, obtaining a set of frequency points to be predicted; for each frequency point of said set, using the phases and magnitudes of the multiple frames preceding the (p-1)-th frame in the MDCT-MDST domain.
Abstract: A compensation method for audio frame loss in a Modified Discrete Cosine Transform (MDCT) domain is provided in the present invention The method include: step a, when the frame currently lost is the p-th frame, obtaining a set of frequency points to be predicted; for each frequency point of said set, using the phases and magnitudes of the multiple frames preceding the (p-1)-th frame in the Modified Discrete Cosine Transform - Modified Discrete Sine Transform (MDCT-MDST) domain to predict the phase and magnitude of the p-th frame; using the predicted phase and magnitude to gain the MDCT coefficients corresponding to each frequency point of the p-th frame; step b, for the frequency points of a frame except for said set, using the coefficient values of the multiple frames preceding the p-th frame to calculate the MDCT coefficient values of the p-th frame at said frequency points; step c, performing an inverse MDCT on the MDCT coefficients of the p-th frame at all frequency points to gain the time domain signal of the p-th frame A compensator for the frame loss is also provided in the invention The invention has advantages of no delay, small calculation amount as well as storage amount and easy implementation

20 citations

Journal ArticleDOI
TL;DR: The 3PSF-IpDFT algorithm represents the best alternative when estimating the noise power of a sine wave embedded in white noise and requires a much lower computational effort than the 4PSF algorithm.
Abstract: This paper analyzes the performance provided by the three-parameter sine-fit (3PSF) and the four-parameter sine-fit (4PSF) algorithms when estimating the noise power of a sine wave corrupted by a white Gaussian noise. In the former case, the frequency parameter is extracted from the available data by using the interpolated discrete Fourier transform (IpDFT) method. The related procedure is called the 3PSF-IpDFT algorithm. Simple expressions for the expected sum-squared fitting and the expected sum-squared residual errors are derived for both the 3PSF and 4PSF algorithms, which agree with previously published results. These expressions show that the sum-squared fitting error of the 4PSF algorithm is smaller than the corresponding value associated with the 3PSF algorithm when the uncertainty of the sine-wave frequency employed by the latter algorithm is greater than the related Cramer-Rao lower bound. From this point of view, the 4PSF algorithm outperforms the 3PSF-IpDFT algorithm. However, since the frequency estimator provided by the IpDFT method is consistent, the sum-squared fitting error associated with both the 3PSF-IpDFT and 4PSF algorithms can be made negligible as compared with the sum-squared residual errors, when the number of analyzed samples is large enough. Moreover, several simulation results show that the 3PSF-IpDFT algorithm requires a much lower computational effort than the 4PSF algorithm. Therefore, it represents the best alternative when estimating the noise power of a sine wave embedded in white noise.

20 citations

Journal ArticleDOI
TL;DR: It is shown that the equalization of FFTs leads to results which are different from the widely used intuitive ones and the formulae of the method can be easily adapted for deriving algorithms for the cosine/sine DFT.
Abstract: A general method of deriving DFT (discrete Fourier transform) algorithms, generalised fast Fourier transform algorithms, is presented. It is shown that a special case of the method is equivalent to nesting of FFTs. The application of the method to the case where N has mutually prime factors results in a new interpretation of the permutations characteristic of this class of algorithms. It is shown that the equalization of FFTs leads to results which are different from the widely used intuitive ones. The high efficiency of split-radix FFTs is explained. It is shown that the formulae of the method can be easily adapted for deriving algorithms for the cosine/sine DFT. A set of FFTs that has smaller arithmetical and/or memory complexities than any algorithm known is presented. In particular, a method of deriving split-radix-2/sup s/ FFTs requiring N log/sub 2/ N-3N+4 real multiplications and 3N log/sub 2/ N-3N+4 additions for any s>1 is presented. >

20 citations

Journal ArticleDOI
TL;DR: The watermark embedding and detecting techniques are proposed and discussed based on the discrete linear canonical transform, and the results show that the watermark cannot be detected when the parameters of thelinear canonical transform used in the detection are not all the same as the parameters in the embedding progress.
Abstract: The linear canonical transform, which can be looked at the generalization of the fractional Fourier transform and the Fourier transform, has received much interest and proved to be one of the most powerful tools in fractional signal processing community. A novel watermarking method associated with the linear canonical transform is proposed in this paper. Firstly, the watermark embedding and detecting techniques are proposed and discussed based on the discrete linear canonical transform. Then the Lena image has been used to test this watermarking technique. The simulation results demonstrate that the proposed schemes are robust to several signal processing methods, including addition of Gaussian noise and resizing. Furthermore, the sensitivity of the single and double parameters of the linear canonical transform is also discussed, and the results show that the watermark cannot be detected when the parameters of the linear canonical transform used in the detection are not all the same as the parameters used in the embedding progress.

20 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