Real discrete Fourier transform
暂无分享,去创建一个
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.
[1] 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.
[2] Judea Pearl,et al. On coding and filtering stationary signals by discrete Fourier transforms (Corresp.) , 1973, IEEE Trans. Inf. Theory.
[3] Okan K. Ersoy. On relating discrete Fourier, sine, and symmetric cosine transforms , 1985, IEEE Trans. Acoust. Speech Signal Process..