Vectorization of fast fourier transform for elastic wave propogation for use in seismic underwater exploration of geographical areas of interest
US9348044B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Apr 18, 2013 |
| Grant date | May 24, 2016 |
| Priority date | — |
| Expiry date | Sep 14, 2034 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG01V2210/675
- WIPO fieldMeasurement
- WIPO sectorInstruments
Abstract
Numerical simulations of elastic wave propagation algorithms are critical components for seismic imaging and inversion. Finite-difference schemes yield good efficiency but cannot ensure the accuracy of the high frequency component. Pseudo-spectral algorithms are accurate up to the Nyquist frequency, but its efficiency depends on the optimization of the fast Fourier transform (FFT) algorithm. The conventional FFT algorithms are optimized for signal processing, in which problems are generally one dimensional time series. For 3D wave propagation, FFT algorithms have the potential to be further optimized. Under current computer hardware architecture, a vectorization scheme for high dimensional FFTs is presented. Compared to conventional numerical scheme implementations, the systems and methods disclose herein has the best performance on the slowest or higher dimensions of data. For elastic wave propagation, vectorization improves the efficiency by more than a factor of two when compared to standard FFT algorithms.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.