Research Repository

Complex and hypercomplex discrete Fourier transforms based on matrix exponential form of Euler’s formula

Sangwine, Stephen J and Ell, Todd A (2012) 'Complex and hypercomplex discrete Fourier transforms based on matrix exponential form of Euler’s formula.' Applied Mathematics and Computation, 219 (2). pp. 644-655. ISSN 0096-3003

1001.4379v3.pdf - Accepted Version

Download (232kB) | Preview


We show that the discrete complex, and numerous hypercomplex, Fourier transforms defined and used so far by a number of researchers can be unified into a single framework based on a matrix exponential version of Euler's formula ejθ=cosθ+jsinθ, and a matrix root of -1 isomorphic to the imaginary root j. The transforms thus defined can be computed using standard matrix multiplications and additions with no hypercomplex code, the complex or hypercomplex algebra being represented by the form of the matrix root of -1, so that the matrix multiplications are equivalent to multiplications in the appropriate algebra. We present examples from the complex, quaternion and biquaternion algebras, and from Clifford algebras Cℓ1,1 and Cℓ2,0. The significance of this result is both in the theoretical unification, which permits comparisons between transforms in different hypercomplex algebras, and also in the scope it affords for insight into the structure of the various transforms, since the formulation is such a simple generalization of the classic complex case. It also shows that hypercomplex discrete Fourier transforms may be computed using standard matrix arithmetic packages without the need for a hypercomplex library, which is of importance in providing a reference implementation for verifying faster implementations based on hypercomplex code. © 2012 Elsevier Inc. All rights reserved.

Item Type: Article
Additional Information: The paper has been revised since the second version to make some of the reasons for the paper clearer, to include reviews of prior hypercomplex transforms, and to clarify some points in the conclusions
Uncontrolled Keywords: Discrete Fourier transform; Hypercomplex Fourier transform; Quaternion; Clifford algebra; Matrix exponential
Subjects: Q Science > QA Mathematics
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Faculty of Science and Health
Faculty of Science and Health > Computer Science and Electronic Engineering, School of
SWORD Depositor: Elements
Depositing User: Elements
Date Deposited: 15 Feb 2013 11:09
Last Modified: 15 Jan 2022 00:35

Actions (login required)

View Item View Item