C06PCF (PDF version)
C06 Chapter Contents
C06 Chapter Introduction
NAG Library Manual

NAG Library Routine Document


Note:  before using this routine, please read the Users' Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent details.

+ Contents

    1  Purpose
    7  Accuracy

1  Purpose

C06PCF calculates the discrete Fourier transform of a sequence of n complex data values (using complex data type).

2  Specification

COMPLEX (KIND=nag_wp)  X(N), WORK(*)

3  Description

Given a sequence of n complex data values zj , for j=0,1,,n-1, C06PCF calculates their (forward or backward) discrete Fourier transform (DFT) defined by
z^k = 1n j=0 n-1 zj × exp ±i 2πjk n ,   k= 0, 1, , n-1 .
(Note the scale factor of 1n  in this definition.) The minus sign is taken in the argument of the exponential within the summation when the forward transform is required, and the plus sign is taken when the backward transform is required.
A call of C06PCF with DIRECT='F' followed by a call with DIRECT='B' will restore the original data.
C06PCF 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). If n is a large prime number or if n contains large prime factors, then the Fourier transform is performed using Bluestein's algorithm (see Bluestein (1968)), which expresses the DFT as a convolution that in turn can be efficiently computed using FFTs of highly composite sizes.

4  References

Bluestein L I (1968) A linear filtering approach to the computation of the discrete Fourier transform Northeast Electronics Research and Engineering Meeting Record 10 218–219
Brigham E O (1974) The Fast Fourier Transform Prentice–Hall
Temperton C (1983) Self-sorting mixed-radix fast Fourier transforms J. Comput. Phys. 52 1–23

5  Parameters

1:     DIRECT – CHARACTER(1)Input
On entry: if the forward transform as defined in Section 3 is to be computed, then DIRECT must be set equal to 'F'.
If the backward transform is to be computed then DIRECT must be set equal to 'B'.
Constraint: DIRECT='F' or 'B'.
2:     X(N) – COMPLEX (KIND=nag_wp) arrayInput/Output
On entry: if X is declared with bounds 0:N-1 in the subroutine from which C06PCF is called, then Xj must contain zj, for j=0,1,,n-1.
On exit: the components of the discrete Fourier transform. If X is declared with bounds 0:N-1 in the subroutine from which C06PCF is called, then for 0kn-1, z^k is contained in Xk.
3:     N – INTEGERInput
On entry: n, the number of data values. The total number of prime factors of N, counting repetitions, must not exceed 30.
Constraint: N1.
4:     WORK(*) – COMPLEX (KIND=nag_wp) arrayWorkspace
Note: the dimension of the array WORK must be at least 2 × N+15.
The workspace requirements as documented for C06PCF may be an overestimate in some implementations.
On exit: the real part of WORK1 contains the minimum workspace required for the current value of N with this implementation.
5:     IFAIL – INTEGERInput/Output
On entry: IFAIL must be set to 0, -1​ or ​1. If you are unfamiliar with this parameter you should refer to Section 3.3 in the Essential Introduction for details.
For environments where it might be inappropriate to halt program execution when an error is detected, the value -1​ or ​1 is recommended. If the output of error messages is undesirable, then the value 1 is recommended. Otherwise, if you are not familiar with this parameter, the recommended value is 0. When the value -1​ or ​1 is used it is essential to test the value of IFAIL on exit.
On exit: IFAIL=0 unless the routine detects an error or a warning has been flagged (see Section 6).

6  Error Indicators and Warnings

If on entry IFAIL=0 or -1, explanatory error messages are output on the current error message unit (as defined by X04AAF).
Errors or warnings detected by the routine:
On entry,N<1.
On entry,DIRECT'F' or 'B'.
On entry,N has more than 30 prime factors.
An unexpected error has occurred in an internal call. Check all subroutine calls and array dimensions. Seek expert help.

7  Accuracy

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).

8  Further Comments

The time taken is approximately proportional to n × logn, but also depends on the factorization of n. C06PCF is faster if the only prime factors of n are 2, 3 or 5; and fastest of all if n is a power of 2. When the Bluestein's FFT algorithm is in use, an addtional workspace of size approximately 8n is allocated internally.

9  Example

This example reads in a sequence of complex data values and prints their discrete Fourier transform (as computed by C06PCF with DIRECT='F'). It then performs an inverse transform using C06PCF with DIRECT='B', and prints the sequence so obtained alongside the original data values.

9.1  Program Text

Program Text (c06pcfe.f90)

9.2  Program Data

Program Data (c06pcfe.d)

9.3  Program Results

Program Results (c06pcfe.r)

C06PCF (PDF version)
C06 Chapter Contents
C06 Chapter Introduction
NAG Library Manual

© The Numerical Algorithms Group Ltd, Oxford, UK. 2012