DocumentCode :
1106374
Title :
Real discrete Fourier transform
Author :
Ersoy, Okan
Author_Institution :
Purdue University, West Lafayette, IN, USA
Volume :
33
Issue :
4
fYear :
1985
fDate :
8/1/1985 12:00:00 AM
Firstpage :
880
Lastpage :
882
Abstract :
The real discrete Fourier transform (RDFT) corresponds to the Fourier series for sampled periodic signals with sampled periodic frequency responses just as discrete Fourier transform (DFT) corresponds to the complex Fourier series for the same type of signals. RDFT has better performance than DFT in data compression and filtering for all signals in the sense that Pearl´s measure for RDFT is less than Pearl´s measure for DFT by an amount ΔW. RDFT also has better performance than DFT in the computation of real convolution because of the reduced number of operations, and the fact that forward and inverse transforms can be implemented with the same signal flowgraph, thereby facilitating hardware and software design.
Keywords :
Convolution; Data compression; Data flow computing; Discrete Fourier transforms; Discrete transforms; Filtering; Fourier series; Fourier transforms; Frequency; Software measurement;
fLanguage :
English
Journal_Title :
Acoustics, Speech and Signal Processing, IEEE Transactions on
Publisher :
ieee
ISSN :
0096-3518
Type :
jour
DOI :
10.1109/TASSP.1985.1164632
Filename :
1164632
Link To Document :
بازگشت