论文信息 - A unified approach to the fast computation of all discrete trigonometric transforms

A unified approach to the fast computation of all discrete trigonometric transforms

A new approach is developed for the fast computation and VLSI implementation of all discrete trigonometric transforms in the least number of operations and pipelining stages. This is achieved in terms of the fast algorithm (FRFT) for the real discrete Fourier transform. FRFT is based upon Givens' plane rotation as the basic unit of computation in contrast to FFT's which are based upon the complex butterfly.

O. K. Ersoy | N. Hu | O. Ersoy | N. Hu

[1] Hideo Kitajima. A Symmetric Cosine Transform , 1980, IEEE Transactions on Computers.

[2] Zhong-De Wang. A fast algorithm for the discrete sine transform implemented by the fast cosine transform , 1982 .

[3] O . Ersoy. A Real Formalism Of Discrete Fourier Transform In Terms Of Skew-Circular Correlations And Its Computation By Fast Correlation Techniques , 1983, Optics & Photonics.

[4] B. Lee. A new algorithm to compute the discrete cosine Transform , 1984 .

[5] Okan K. Ersoy,et al. Real discrete Fourier transform , 1985, IEEE Trans. Acoust. Speech Signal Process..

[6] Pierre Duhamel,et al. Implementation of "Split-radix" FFT algorithms for complex, real, and real-symmetric data , 1986, IEEE Trans. Acoust. Speech Signal Process..