Watermark schemes content-based provide one way to solve the veracity and integrity of speech content. Some existed content-based schemes are vulnerable to feature-analysed substitution attack. Aiming to solve the problems, a secure speech content authentication algorithm is proposed, on the basic of the undeterminate angle of discrete fractional fourier transform. In the paper, the definition ...

The discrete harmonic wavelet transform was developed by Newland in 1993 1, 2 . Similar to the ordinary discrete wavelet transform, the classical harmonic wavelet transform can also perform multiresolution analysis of a function. In addition, it has a fast algorithm based on fast Fourier transform for numerical implementation. A distinct advantage of harmonic wavelets is that they are disjoint ...

In this paper, transform domain adaptive filters are studied and reviewed based on previous researches. In transform domain adaptive filters orthogonality properties of transformation such as discrete cosine transform (DCT), discrete sine transform (DST), wavelet transform and discrete fourier transform (DFT) are used to achieve an improved convergence rate as compared to the time domain analys...

All algorithms for impedance calculation use an analog-to-digital converter. The high accuracy of the impedance seen by a distance relay is an important factor in the correct isolation of the faulty part of power systems. To achieve this, a novel technique based on third order interpolation is used in this paper. According to this technique, the times and the values of the obtained samples are...

Fractional transforms are useful tools for processing of non-stationary signals. The methods of implementing sliding discrete fractional Fourier transform (SDFRFT), sliding discrete fractional cosine transform (SDFRCT) and sliding discrete fractional sine transform (SDFRST) for real time processing of signals are presented. The performances of these sliding transforms, with regard to computatio...

| Some applications of the Discrete Fourier Transform (DFT) in coding and in cryptography are described. The DFT over general commutative rings is introduced and the condition for its existence given. Blahut's Theorem, which relates the DFT to linear complexity, is shown to hold unchanged in general commutative rings. I. The (Usual) Discrete Fourier Transform Let be a primitive N th root of uni...

In this paper, the problem of estimating a small frequency offset in a signal with a large carrier frequency is addressed. The warped discrete-Fourier transform (WDFT) [A. Makur, S.K. Mitra, IEEE Trans. Circuits Systems—I: Fundam. Theory Appl. 6 (9) (September 2001) 1086–1093] is used and the accuracy of estimation and computational complexity of this technique is compared with the conventional...

The continuous fractional Fourier transform (FRFT) performs a spectrum rotation of signal in the time–frequency plane, and it becomes an important tool for time-varying signal analysis. A discrete fractional Fourier transform has been recently developed by Santhanam and McClellan, but its results do not match those of the corresponding continuous fractional Fourier transforms. In this paper, we...

In addition to their inestimable importance in mathematics and its applications, Fourier series also serve as the entry point into the wonderful world of Fourier analysis and its wide-ranging extensions and generalizations. An entire industry is devoted to developing the theory and enlarging the scope of applications of Fourier–inspired methods. New directions in Fourier analysis continue to be...