1887
24th International Geophysical Conference and Exhibition – Geophysics and Geology Together for Discovery
  • ISSN: 2202-0586
  • E-ISSN:

Abstract

Prestack reverse time migration (RTM) requires extensive data storage since it computes wavefields in forward time and accesses wavefields in reverse order. We first review several successful schemes that have been proposed to reduce data storage, but require more computational redundancies. We propose two effective strategies to reduce data storage during RTM. The first strategy is based on the Nyquist sampling theorem, which involves no extra computational cost. The fact is that the time sampling intervals required by numerical algorithms or given by field records is generally several times smaller than that satisfied by the Nyquist sampling theorem. Therefore, we can correlate the source wavefields with the receiver wavefields at the Nyquist time step, which helps decrease storage of time history. The second strategy is based on a lossless compression algorithm, which is widely used in computer science and information theory. The compression approach reduces storage significantly at a little computational cost. Numerical examples show that the two proposed strategies are effective and efficient.

Loading

Article metrics loading...

/content/journals/10.1071/ASEG2015ab268
2015-12-01
2026-01-13
Loading full text...

Full text loading...

References

  1. Baysal, E., Kosloff, D.D., Sherwood, J.W.C., 1983. Reverse time migration: Geophysics 48, 1514-1524.
  2. Clapp, R. G., 2009. Reverse time migration with random boundaries: 79th Annual International Meeting SEG Expanded Abstracts, Houston, USA, pp.2809-2813.
  3. Fletcher, R. P., Robertsson, J. O. A., 2011. Time-varying boundary conditions in simulation of seismic wave propagation: Geophysics 76(1), A1-A6.
  4. Feldspar, A., 1997. An Explanation of the Deflate Algorithm, http://www.zlib.net/feldspar.html: [Accessed 26 August, 2014].
  5. Gailly, J., Adler, M., 1995. A massively spiffy yet delicately unobtrusive compression library: http://www.zlib.net/, [Accessed 26 August, 2014].
  6. Huffman, D. A., 1952. A Method for the Construction of Minimum Redundancy Codes: Proceedings of the Institute of Electrical and Radio Engineering 40(9), 1098-1101.
  7. Kristek, J., Moczo, P., Archuleta, R., 2002. Efficient methods to simulate planar free surface in the 3D 4th-order staggered-grid finite-difference schemes: Studia Geophysica Et Geodaetica 46, 355-81.
  8. Nikitin, V.V., Romanenko, A. A., Duchkov, A.A., Andersson, F., 2011. 3D wave-packet decomposition implemented on GPUs: 81st Annual International Meeting SEG Expanded Abstracts, San Antonio, USA, pp.3409-3413.
  9. Salomon, D., Motta, G., 2010. Handbook of data compression: Springer.
  10. Symes, W.W., 2007. Reverse time migration with optimal checkpointing: Geophysics 72(5), SM213-SM221.
  11. Whitmore, D., 1983. Iterative depth migration by backward time propagation: 53rd Annual International Meeting SEG Expanded Abstracts, Houston, USA, pp.382-385.
  12. Ziv, Jacob, Lempel, A., 1977. A universal algorithm sequential data compression: IEEE Transactions Information Theory 23(3), 337-343.
/content/journals/10.1071/ASEG2015ab268
Loading
This is a required field
Please enter a valid email address
Approval was a Success
Invalid data
An Error Occurred
Approval was partially successful, following selected items could not be processed due to error