NAME

Cfft - complex fft

DESCRIPTION

Complex fast fourier transform

Cfft < in.h > out.h

      1: forward transform
      -1 : reverse transform
      ( FDGP sign convention )

       input cube dimensions ( complex data ).
       (n1 < 2048)
       (n1 = 2*(ntime1/2+1) if in frequency domain)