Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Progress in Geophysics》 2016-01
Add to Favorite Get Latest Update

Computation of discrete frequency when using FFT algorithm with random sampling points

CHEN Long-wei;DAI Shi-kun;WU Mei-ping;School of Geosciences and Info-Physics,Central South University;College of Mechatronics Engineering and Automation,National University of Defense Technology;  
Fast Fourier Transform( FFT) algorithm plays an important role in efficient numerical simulation and data processing of geophysical fields, such as gravity, magnetic field and electromagnetic field. FFT is intrinsically a numerical computational method for discrete Fourier transform. Now there are many kinds of FFT algorithms that can carry out discrete Fourier transform with random sampling points. Computation of discrete frequency is a key part in correctly using FFT algorithms to resolve numerical simulation and data processing of geophysical fields. In this study,treating discrete Fourier transform as a numerical approximation of Fourier transform, we give the formula for computing discrete frequency by analyzing the process of deriving discrete Fourier transform expression. We use spectral method to resolve the problem of continuation of gravity field by theoretical model data.Experimental results further verify the correctness of the presented formula for computing discrete frequency.
【Fund】: 国家自然科学基金(41404106;61174206)项目资助
【CateGory Index】: P631
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