共轭对称数据的DFT及其FFT算法

Download: PDF (994 KB)
Export: BibTeX | EndNote (RIS)

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.

Key words： Discrete Fourier transform Fast Fourier transform Symmetric data

Received: 14 December 1998

PACS:

TN911.72

	Service

	E-mail this article
	Add to my bookshelf
	Add to citation manager
	E-mail Alert
	RSS
	Articles by authors



	Chen Jianping
	Cao Qinglin
	Shen Shide

Cite this article:

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

URL:

http://jeit.ie.ac.cn/EN/ OR http://jeit.ie.ac.cn/EN/Y2001/V23/I2/197

[1]	ZHOU Fang, SHUI Penglang, JIANG Junzheng. Design of Two-dimensional Modified DFT Modulated Filter Banks Based on Lagrange Multiplier Method[J]. JEIT, 2017, 39(5): 1261-1265.