DFT, FFT ALGORITHM FOR A COMPLEX CONJUGATE-SYMMETRIC SEQUENCE

Chen Jianping; Cao Qinglin; Shen Shide

Volume 23 Issue 2

Feb. 2001

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2001 > 23(2): 197-202

Chen Jianping, Cao Qinglin, Shen Shide. DFT, FFT ALGORITHM FOR A COMPLEX CONJUGATE-SYMMETRIC SEQUENCE[J]. Journal of Electronics & Information Technology, 2001, 23(2): 197-202.

Citation:

Chen Jianping, Cao Qinglin, Shen Shide. DFT, FFT ALGORITHM FOR A COMPLEX CONJUGATE-SYMMETRIC SEQUENCE[J]. Journal of Electronics & Information Technology, 2001, 23(2): 197-202.

Chen Jianping, Cao Qinglin, Shen Shide. DFT, FFT ALGORITHM FOR A COMPLEX CONJUGATE-SYMMETRIC SEQUENCE[J]. Journal of Electronics & Information Technology, 2001, 23(2): 197-202.

Citation:

Chen Jianping, Cao Qinglin, Shen Shide. DFT, FFT ALGORITHM FOR A COMPLEX CONJUGATE-SYMMETRIC SEQUENCE[J]. Journal of Electronics & Information Technology, 2001, 23(2): 197-202.

PDF( 993 KB)

DFT, FFT ALGORITHM FOR A COMPLEX CONJUGATE-SYMMETRIC SEQUENCE

Received Date: 1998-12-14
Rev Recd Date: 2000-01-14
Publish Date: 2001-02-19

Abstract

Abstract

The discrete Fourier transform (DFT) and fast Fourier transform (FFT) for com-plex conjugate-symmetric input data are studied in this paper. The DFT of a complex conjugate-symmetric sequence has the nature that its imaginary part is zero. An efflcient FFT algorithm is developed for such a sequence. It reduces the computation and storage requirements by half comparing to the traditional FFT algorithm.

FullText(HTML)

References(1)

References

H.V.Sorensen,et al.,Real-valued fast Fourier transform algorithms,IEEE Trans.on ASSP,1987,ASSP-35(6),849-863.[2]Chen Jianping,H.V.Sorensen,An efficient FFT algorithm for real-symmetric data,Proc.IEEE ICASSP,San Fronsisco,1992,vol.5,17-20.[3]Lu Chao,R.Tolimiteri,New algorithm for the FFT computation of symmetric and translational complex conjugate sequences, Proc.IEEE ICASSP,San Fronsisco,1992,Vol.5,13-16.[4]A.V.Oppenheim,R.W.Schafer,Discrete-Time Signal Processing,Englewood Cliffs,New Jersy,Prentice-Hall,1989,581-609.[5]陈建平,H.V.sorensen,复数、实数及实对称数据下Bruun FFT的实现,苏州大学学报(自然科学),1995,11(4),107-114.[6]陈建平,曹清林.沈世德,对称连杆曲线的FFT应用研究,数据采集与处理,1997,12(3),243-246.

Relative Articles

Supplements(0)

Cited By

Proportional views