head 1.1;
branch 1.1.1;
access ;
symbols start:1.1.1.1 fftvtag:1.1.1;
locks ; strict;
comment @# @;
1.1
date 2001.07.29.12.30.35; author jdalton; state Exp;
branches 1.1.1.1;
next ;
1.1.1.1
date 2001.07.29.12.30.35; author jdalton; state Exp;
branches ;
next ;
desc
@@
1.1
log
@Initial revision
@
text
@
Derivation of the DeSpain Algorithm
Derivation of the DeSpain Algorithm
Definition of the Discrete Fourier Transform.
DFT:
Inverse DFT:
Where 'n' and 'k' are related to time and frequency respectively by:
Derivation of the DeSpain Algorithm
Start with the Discrete Fourier Transform.
|
...(1) |
Choose two integers 'P' and 'Q', such that
That is, 'P' and 'Q' are factors of 'N'.
Now let
|
...(3) |
where
;
, and
|
...(4) |
where
;
.
Substitute equations (2), (3) and (4) into equation (1) to give:
|
...(5) |
Now expand the exponent.
|
...(6) |
Note that the left most exponent is always a multiple of
, and cancel common fectors in the other exponents.
|
...(7) |
Now extract common factors from the sum, and break it into two separate sums,
over orthogonal dimensions.
|
...(8) |
The structure of this expression can be more plainly seen by
inroducing intermediate variables 'x' and 'y'.
|
...(9a) |
|
...(9b) |
|
...(9c) |
@
1.1.1.1
log
@First Release
@
text
@@