DocumentCode :
3013784
Title :
A unified approach to the fast computation of all discrete trigonometric transforms
Author :
Ersoy, O.K. ; Hu, N.C.
Author_Institution :
Purdue University, West Lafayette, IN
Volume :
12
fYear :
1987
fDate :
31868
Firstpage :
1843
Lastpage :
1846
Abstract :
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.
Keywords :
Discrete Fourier transforms; Discrete cosine transforms; Discrete transforms; Fourier transforms; Minimization methods; Pipeline processing; Very large scale integration;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '87.
Type :
conf
DOI :
10.1109/ICASSP.1987.1169502
Filename :
1169502
Link To Document :
بازگشت