previous up next print clean
Next: IMPLEMENTATION Up: Bevc & Claerbout: Fast Previous: Bevc & Claerbout: Fast

Introduction

We describe an optimized Kirchhoff migration and modeling routine which handles the problem of operator aliasing. Slight modifications of this algorithm could be useful for velocity analysis, pre-stack migration and DMO.

Several Kirchhoff routines are presented in SEP73. The simplest routines Claerbout (1992b) are tutorial and do not address the problem of operator aliasing. A more elaborate routine which overcomes the aliasing problem Claerbout (1992a) proves to be slow.

We incorporate the best features of the fast program kirchfast() Claerbout (1992b) and the anti-aliasing program trimo() Claerbout (1992a) to make a fast anti-aliased Kirchhoff migration and modeling routine. Timing tests on the SPARCstation IPC show the new routine to be twelve times faster than trimo() and only three times slower than kirchfast().


previous up next print clean
Next: IMPLEMENTATION Up: Bevc & Claerbout: Fast Previous: Bevc & Claerbout: Fast
Stanford Exploration Project
11/17/1997