Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Electronics and Information Technology》 2001-02
Add to Favorite Get Latest Update

DFT, FFT ALGORITHM FOR A COMPLEX CONJUGATE-SYMMETRIC SEQUENCE

Chen Jianping Cao Qinglin Shen Shide (Nantong Institute of Technology, Nantong 226007, China)  
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.
【Fund】: 江苏省教委留学回国人员科研启动经费;; 江苏省教委自然科学基金
【CateGory Index】: O174.22
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved