Cfft - complex fft
Complex fast fourier transform
Cfft < in.h > out.h
[1]: forward transform -1 : reverse transform (FDGP sign convention)
input cube dimensions (complex data). (n1 = 2*(ntime1/2+1) if in frequency domain)
Cfft < in.h sign=1 esize=8 > fft.h Compute complex forward fft of input dataset in.H
Cfft < fft.h sign=-1 esize=8 > out.h Compute complex inverse fft of input dataset fft.H
seis/filter