Given a Hermitian sequence of
complex data values
(i.e., a sequence such that
is real and
is the complex conjugate of
, for
),
c06fbf calculates their discrete Fourier transform defined by
(Note the scale factor of
in this definition.) The transformed values
are purely real (see also the
C06 Chapter Introduction).
To compute the inverse discrete Fourier transform defined by
this routine should be preceded by forming the complex conjugates of the
; that is,
, for
.
c06fbf uses the fast Fourier transform (FFT) algorithm (see
Brigham (1974)).
If on entry
or
, explanatory error messages are output on the current error message unit (as defined by
x04aaf).
Some indication of accuracy can be obtained by performing a subsequent inverse transform and comparing the results with the original sequence (in exact arithmetic they would be identical).
Please consult the
X06 Chapter Introduction for information on how to control and interrogate the OpenMP environment used within this routine. Please also consult the
Users' Note for your implementation for any additional implementation-specific information.
This example reads in a sequence of real data values which is assumed to be a Hermitian sequence of complex data values stored in Hermitian form. The input sequence is expanded into a full complex sequence and printed alongside the original sequence. The discrete Fourier transform (as computed by
c06fbf) is printed out. It then performs an inverse transform using
c06faf and conjugation, and prints the sequence so obtained alongside the original data values.