C06PUF (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

C06PUF computes the two-dimensional discrete Fourier transform of a bivariate sequence of complex data values (using complex data type).

2  Specification

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

3  Description

C06PUF computes the two-dimensional discrete Fourier transform of a bivariate sequence of complex data values z j1 j2 , for j1=0,1,,m-1 and j2=0,1,,n-1.
The discrete Fourier transform is here defined by
z^ k1 k2 = 1mn j1=0 m-1 j2=0 n-1 z j1 j2 × exp ±2πi j1 k1 m + j2 k2 n ,
where k1=0,1,,m-1  and k2=0,1,,n-1 .
(Note the scale factor of 1mn  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 C06PUF with DIRECT='F' followed by a call with DIRECT='B' will restore the original data.
This routine calls C06PRF to perform multiple one-dimensional discrete Fourier transforms by the fast Fourier transform (FFT) algorithm in Brigham (1974).

4  References

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:     M – INTEGERInput
On entry: m, the first dimension of the transform.
Constraint: M1.
3:     N – INTEGERInput
On entry: n, the second dimension of the transform.
Constraint: N1.
4:     X( M×N ) – COMPLEX (KIND=nag_wp) arrayInput/Output
On entry: the complex data values. If X is regarded as a two-dimensional array of dimension 0:M-1,0:N-1, then Xj1j2 must contain z j1 j2 .
On exit: the corresponding elements of the computed transform.
5:     WORK(*) – COMPLEX (KIND=nag_wp) arrayWorkspace
Note: the dimension of the array WORK must be at least M × N + N + M + 30.
The workspace requirements as documented for C06PUF may be an overestimate in some implementations.
On exit: the real part of WORK1 contains the minimum workspace required for the current values of M and N with this implementation.
6:     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,M<1.
On entry,N<1.
On entry,DIRECT'F' or 'B'.
On entry,N has more than 30 prime factors.
On entry,M 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 mn × logmn , but also depends on the factorization of the individual dimensions m and n. C06PUF is faster if the only prime factors are 2, 3 or 5; and fastest of all if they are powers of 2.

9  Example

This example reads in a bivariate sequence of complex data values and prints the two-dimensional Fourier transform. It then performs an inverse transform and prints the sequence so obtained, which may be compared to the original data values.

9.1  Program Text

Program Text (c06pufe.f90)

9.2  Program Data

Program Data (c06pufe.d)

9.3  Program Results

Program Results (c06pufe.r)

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

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