21Fast Fourier Transform

Standard fast Fourier transform (FFT) algorithms support at best complex signals (functions of time) or waveforms (functions of space). In Chapter 23, it is of interest to use the FFT to calculate derivatives of an electromagnetic field in order to simulate wave propagation using the finite difference time domain (FDTD) method. For that application, the signal is a Clifford bivector in four dimensions (both space and time), making it necessary to construct a Fourier transform which operates at least on bivectors, and preferably on all other Clifford entities as well.

21.1 Theory

In general, the spectrum upper S left-parenthesis omega right-parenthesis is calculated from a signal s left-parenthesis t right-parenthesis by the Fourier transform as follows:

(21.1)upper S left-parenthesis omega right-parenthesis equals integral s left-parenthesis t right-parenthesis e Superscript minus i omega t Baseline d t

When the signal s left-parenthesis t right-parenthesis is bandlimited and periodic, the same spectral values are obtained1 if the original signal is replaced by a new function:

(21.2)s prime left-parenthesis t right-parenthesis equals StartFraction 1 Over upper N EndFraction sigma-summation Underscript n equals 0 Overscript upper N minus 1 Endscripts s Subscript n Baseline delta left-parenthesis t minus n normal upper Delta t right-parenthesis

consisting of upper N samples covering one ...

Get Numerical Calculations in Clifford Algebra now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.