Algorithm for the creation of the P-Tau and P-X planes from T-X plane data
โ Scribed by A. Carswell; W. Moon
- Book ID
- 103046295
- Publisher
- Elsevier Science
- Year
- 1984
- Tongue
- English
- Weight
- 375 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0010-4655
No coin nor oath required. For personal study only.
โฆ Synopsis
ACCA many processors have started to perform their processing in data domains other than the time-offset domain. The TAUP Program obtainable from: CPC Program Library, Queen's Urn-program creates the two of the most popular of these domains; versity of Belfast, N. Ireland (see application form in this issue) P-Tau (wave slowness vs. intercept time) and P-X (wave slowness vs. offset). Computer: AMDAHL 470/V8; Installation: University of Manitoba
Method of solution
The P-Tau plane is created by using the slant stack transform.
Operating system: IMS/VS
The P-X plane is created using the cross stack algorithm.
Programming language used: Fortran IV (G)
Restrictions on the complexity of the problem
The input seismic data may consist of up to 100 traces of 1500 High speed storage required: 7.7 Kwords samples each. The output P-Tau planes may be up to 100 by 500 and restrictions are imposed only by the size of the array No. of bits in a word: 32 which may be increased easily.
No. of magnetic tapes used: I (optional)
Typical running time
Other peripherals used: card reader, line printer, plotter (op-For the test example, in which both the P-Tau and P-X planes tional) are created, the program takes about 4.7 s, the P-Tau plane created being 40 by 25 and the P-X plane being 40 by 35.
No. of lines in combined program and test deck: 5517 Unusual features of the program Cardpunching code: EBCDIC
The program processes one seismic trace at a time thus saving a large amount of space normally required to store them. If the
๐ SIMILAR VOLUMES