摘要
为了避免因使用复FFT作实序列高散傅里叶交换(DFT)而增加不必要的运算和存储量,本文介绍了一种改进的频域相关算法。该算法仅采用了实FFT运算,并且通过修改常规频域相关算法中计算两个实数序列DFT的共轭乘积的步骤,采用两次正向实FFT运算来代替通常所需的一次正向和一次逆FFT运算。因此,不需设计专门的逆FFT运算单元,从而可减少相关系统的复杂性和对存储量的要求,并可提高运算速度。文章给出了该算法的数学推导,并就运算量和存储量的大小与使用复FFT同时进行两道实序列相关的算法进行了比较。
An improved algorithm for real-valued sequences in a frequence domain is presented in this paper. In order to avoid using complex FFT (fast Fourier transform) in discrete Fourier transform (DFT) of real data, that will increase redundant computation and storage. This algorithm uses only real FFT operation. By modifying steps to calculate DFT's complex conjugate products of two real valued sequences in conventional frequence algorithm, forward real FFT is used two times instead of one forward FFT and inverse FFT in usual algorithms each once,hence it's unnecessary to design special inverse FFT. that would result in simplying correlation system,reduce the storage capacity requiredand speed up computation.Also, the algorithm complexity and storge capacity are compared with those of the method to use complex FFT in processing two channel real-valued sequences simultaneously.
出处
《江汉石油学院学报》
CSCD
北大核心
1990年第4期27-31,共5页
Journal of Jianghan Petroleum Institute
关键词
地震记录
实序列
频域
相关算法
correlation
FFT
storage capacity
real sequence
discrete signal
seismic record
seismic wave
