The discrete Fourier transform is sometimes defined using a positive sign in the exponential term
To compute this form, this routine should be preceded by forming the complex conjugates of the ; that is , for .
The routine uses a variant of the fast Fourier transform (FFT) algorithm (see Brigham (1974)) known as the Stockham self-sorting algorithm, which is described in Temperton (1983). Special coding is provided for the factors , , , and . This routine is designed to be particularly efficient on vector processors, and it becomes especially fast as , the number of transforms to be computed in parallel, increases.
Brigham E O (1974) The Fast Fourier Transform Prentice–Hall
Temperton C (1983) Fast mixed-radix real Fourier transforms J. Comput. Phys.52 340–350
1: – IntegerInput
On entry: , the number of sequences to be transformed.
2: – IntegerInput
On entry: , the number of data values in each sequence.
3: – Real (Kind=nag_wp) arrayInput/Output
On entry: the data must be stored in x as if in a two-dimensional array of dimension ; each of the sequences is stored in a row of the array in Hermitian form. If the data values are written as , then for , is contained in , and for , is contained in . (See also Section 2.1.2 in the C06 Chapter Introduction.)
On exit: the components of the discrete Fourier transforms, stored as if in a two-dimensional array of dimension . Each of the transforms is stored as a row of the array, overwriting the corresponding original sequence.
If the components of the discrete Fourier transform are denoted by , for , the elements of the array x contain the values
4: – Character(1)Input
On entry: indicates whether trigonometric coefficients are to be calculated.
Calculate the required trigonometric coefficients for the given value of , and store in the array trig.
The required trigonometric coefficients are assumed to have been calculated and stored in the array trig in a prior call to one of c06fpforc06fqf. The routine performs a simple check that the current value of is consistent with the values stored in trig.
, or .
5: – Real (Kind=nag_wp) arrayInput/Output
On entry: if or , trig must contain the required trigonometric coefficients that have been previously calculated. Otherwise trig need not be set.
On exit: contains the required coefficients (computed by the routine if ).
6: – Real (Kind=nag_wp) arrayWorkspace
7: – IntegerInput/Output
On entry: ifail must be set to , or to set behaviour on detection of an error; these values have no effect when no error is detected.
A value of causes the printing of an error message and program execution will be halted; otherwise program execution continues. A value of means that an error message is printed while a value of means that it is not.
If halting is not appropriate, the value or is recommended. If message printing is undesirable, then the value is recommended. Otherwise, the value is recommended. When the value or is used it is essential to test the value of ifail on exit.
On exit: unless the routine detects an error or a warning has been flagged (see Section 6).
6Error Indicators and Warnings
If on entry or , explanatory error messages are output on the current error message unit (as defined by x04aaf).
An unexpected error has been triggered by this routine. Please
See Section 7 in the Introduction to the NAG Library FL Interface for further information.
Your licence key may have expired or may not have been installed correctly.
See Section 8 in the Introduction to the NAG Library FL Interface for further information.
Dynamic memory allocation failed.
See Section 9 in the Introduction to the NAG Library FL Interface for further information.
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).
8Parallelism and Performance
c06fqf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.
c06fqf makes calls to BLAS and/or LAPACK routines, which may be threaded within the vendor library used by this implementation. Consult the documentation for the vendor library for further information.
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.
The time taken by c06fqf is approximately proportional to , but also depends on the factors of . c06fqf is fastest if the only prime factors of are , and , and is particularly slow if is a large prime, or has large prime factors.
This example reads in sequences of real data values which are assumed to be Hermitian sequences of complex data stored in Hermitian form. The sequences are expanded into full complex form and printed. The discrete Fourier transforms are then computed (using c06fqf) and printed out. Inverse transforms are then calculated by conjugating and calling c06fpf showing that the original sequences are restored.