实信号快速傅立叶变换在地震信号处理中的应用
详细信息 本馆镜像全文    |  推荐本文 | | 获取馆网全文
摘要
地震信号的数据量非常大,如果简单利用复序列快速傅立叶变换算法对地震信号进行处理,将会成倍增加数据量,增加计算量,因此针对地震信号这一实数序列,讨论实信号的快速傅立叶变换。文章提出了3种实序列的快速傅立叶变换算法,对运算量的减少进行了定量的分析,并对实际地震数据进行了计算,从分析及计算结果可以看出,这3种方法可以明显减少运算量,同时节省了计算机的存储空间。
The quantity of seismic signal data is very large.If merely composite succession FFT algorithm is used to process the seismic signal,the data quantity will be doubled and redoubled,and hence the calculation will become cumbersome.Aimed at the problem of the real succession of the seismic signal,this paper deals with the fast Fourier transform of the real signal.Three fast Fourier transform algorithms for real successions are put forward,a quantitative analysis for reducing the calculation work was made,and the practical seismic data were computed.It can be seen from the analytical and computation results that these three methods can obviously reduce the quantity of calculation and save the storage space of the computer.
引文
[1]刘益成,孙祥娥.数字信号处理[M].北京:电子工业出版社,2004.
    [2]殷福亮,朱爱军.数字信号处理C语言程序集[M].沈阳:辽宁科学技术出版社,1997.
    [3]戴乐,黄仕家,孙桦.一种改进的实信号IFFT算法[J].系统工程与电子技术,2002,(8).
    [4]胡广书.数字信号处理———理论、算法与实现[M].北京:清华大学出版社,1997.

版权所有:© 2023 中国地质图书馆 中国地质调查局地学文献中心