×

Complex and hypercomplex discrete Fourier transforms based on matrix exponential form of Euler’s formula. (English) Zbl 1286.42005

Summary: We show that the discrete complex and the 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 \(e^{j\theta}=\cos(\theta)+j\sin(\theta)\), 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\ell_{1,1}\) and \(C\ell_{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.

MSC:

42A38 Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type
42B10 Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type
15A66 Clifford algebras, spinors

Software:

Quaternion; CLICAL
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

References:

[1] Bracewell, R. N., The Fourier Transform and its Applications (2000), McGraw-Hill: McGraw-Hill Boston · Zbl 0068.16503
[2] Ward, J. P., Quaternions and Cayley Numbers: Algebra and Applications, Mathematics and Its Applications, vol. 403 (1999), Kluwer: Kluwer Dordrecht · Zbl 0877.15031
[3] Ickes, B. P., A new method for performing digital control system attitude computations using quaternions, AIAA Journal, 8, 1, 13-17 (1970)
[4] Sommen, F., Hypercomplex Fourier and Laplace transforms I, Illinois Journal of Mathematics, 26, 2, 332-352 (1982) · Zbl 0472.46032
[5] Sommen, F., Hypercomplex Fourier and Laplace transforms II, Complex Variables, 1, 2-3, 209-238 (1983) · Zbl 0529.46030
[6] R. Bujack, G. Scheuermann, E. Hitzer, A general geometric Fourier transform, in: Gürlebeck [33], 19 pp.; R. Bujack, G. Scheuermann, E. Hitzer, A general geometric Fourier transform, in: Gürlebeck [33], 19 pp. · Zbl 1273.15020
[7] Ernst, R. R.; Bodenhausen, G.; Wokaun, A., Principles of Nuclear Magnetic Resonance in One and Two Dimensions (1987), Oxford University Press: Oxford University Press Oxford
[8] Delsuc, M. A., Spectral representation of 2D NMR spectra by hypercomplex numbers, Journal of Magnetic Resonance, 77, 1, 119-124 (1988)
[9] T.A. Ell, Hypercomplex spectral transformations, Ph.D. thesis, University of Minnesota, 1992.; T.A. Ell, Hypercomplex spectral transformations, Ph.D. thesis, University of Minnesota, 1992.
[10] T.A. Ell, Quaternion-Fourier transforms for analysis of 2-dimensional linear time-invariant partial-differential systems, in: Proceedings of the 32nd IEEE Conference on Decision and Control, San Antonio, Texas, USA, 15-17 December 1993, vol. 1-4, IEEE, Control Systems Society, 1993, pp. 1830-1841.; T.A. Ell, Quaternion-Fourier transforms for analysis of 2-dimensional linear time-invariant partial-differential systems, in: Proceedings of the 32nd IEEE Conference on Decision and Control, San Antonio, Texas, USA, 15-17 December 1993, vol. 1-4, IEEE, Control Systems Society, 1993, pp. 1830-1841.
[11] Chernov, V. M., Discrete orthogonal transforms with data representation in composition algebras, (Proceedings Scandinavian Conference on Image Analysis (1995), Uppsala: Uppsala Sweden), 357-364
[12] T. Bülow, Hypercomplex spectral signal representations for the processing and analysis of images, Ph.D. thesis, University of Kiel, Germany, 1999.; T. Bülow, Hypercomplex spectral signal representations for the processing and analysis of images, Ph.D. thesis, University of Kiel, Germany, 1999.
[13] Bülow, T.; Sommer, G., Hypercomplex signals – a novel extension of the analytic signal to the multidimensional case, IEEE Transactions on Signal Processing, 49, 11, 2844-2852 (2001) · Zbl 1369.94099
[14] S.J. Sangwine, T.A. Ell, The discrete Fourier transform of a colour image, in: J.M. Blackledge, M.J. Turner (Eds.), Image Processing II Mathematical Methods, Algorithms and Applications, Horwood Publishing for Institute of Mathematics and its Applications, Chichester, 2000, pp. 430-441, Proceedings Second IMA Conference on Image Processing, De Montfort University, Leicester, UK, September 1998.; S.J. Sangwine, T.A. Ell, The discrete Fourier transform of a colour image, in: J.M. Blackledge, M.J. Turner (Eds.), Image Processing II Mathematical Methods, Algorithms and Applications, Horwood Publishing for Institute of Mathematics and its Applications, Chichester, 2000, pp. 430-441, Proceedings Second IMA Conference on Image Processing, De Montfort University, Leicester, UK, September 1998.
[15] Pei, S.-C.; Ding, J.-J.; Chang, J.-H., Efficient implementation of quaternion Fourier transform, convolution, and correlation by 2-D complex FFT, IEEE Transactions on Signal Processing, 49, 11, 2783-2797 (2001) · Zbl 1369.65190
[16] Pei, S.-C.; Chang, J.-H.; Ding, J.-J., Commutative reduced biquaternions and their Fourier transform for signal and image processing applications, IEEE Transactions Signal Processing, 52, 7, 2012-2031 (2004) · Zbl 1369.94257
[17] Ebling, J.; Scheuermann, G., Clifford Fourier transform on vector fields, IEEE Transactions on Visualization and Computer Graphics, 11, 4, 469-479 (2005), http://dx.doi.org/10.1109/TVCG.2005.54
[18] Ell, T. A.; Sangwine, S. J., Decomposition of 2D hypercomplex Fourier transforms into pairs of complex Fourier transforms, (Gabbouj, M.; Kuosmanen, P., Finland. Finland, Proceedings of EUSIPCO 2000, Tenth European Signal Processing Conference, vol. II (2000), European Association for Signal Processing, Tampere: European Association for Signal Processing, Tampere Finland), 1061-1064
[19] Ell, T. A.; Sangwine, S. J., Hypercomplex Fourier transforms of color images, IEEE Transactions on Image Processing, 16, 1, 22-35 (2007) · Zbl 1279.94014
[20] Sangwine, S. J., Biquaternion (complexified quaternion) roots of \(- 1\), Advances in Applied Clifford Algebras, 16, 1, 63-68 (2006) · Zbl 1107.30038
[21] Said, S.; Le Bihan, N.; Sangwine, S. J., Fast complexified quaternion Fourier transform, IEEE Transactions on Signal Processing, 56, 4, 1522-1531 (2008) · Zbl 1390.94389
[22] Hitzer, E.; Abłamowicz, R., Geometric roots of \(- 1\) in Clifford algebras \(C \ell_{p, q}\) with \(p + q \leqslant 4\), Advances in Applied Clifford Algebras, 21, 1, 121-144 (2010) · Zbl 1216.15019
[23] E. Hitzer, J. Helmstetter, R. Abłamowicz, Square roots of \(- 1\)[33]; E. Hitzer, J. Helmstetter, R. Abłamowicz, Square roots of \(- 1\)[33] · Zbl 1273.15025
[24] D. Alfsmann, H. Göckler, S.J. Sangwine, T.A. Ell, Hypercomplex algebras in digital signal processing: Benefits and drawbacks, in: Proceedings of EUSIPCO 2007, 15th European Signal Processing Conference, European Association for Signal Processing, Poznan, Poland, 2007, pp. 1322-6.; D. Alfsmann, H. Göckler, S.J. Sangwine, T.A. Ell, Hypercomplex algebras in digital signal processing: Benefits and drawbacks, in: Proceedings of EUSIPCO 2007, 15th European Signal Processing Conference, European Association for Signal Processing, Poznan, Poland, 2007, pp. 1322-6.
[25] Nahin, P. J., Dr Euler’s Fabulous Formula: Cures Many Mathematical Ills (2006), Princeton University Press · Zbl 1115.00004
[26] Golub, G. H.; van Loan, C. F., Matrix Computations, Johns Hopkins studies in the Mathematical Sciences (1996), The Johns Hopkins University Press Baltimore: The Johns Hopkins University Press Baltimore London
[27] S.J. Sangwine, N. Le Bihan, Quaternion Toolbox for Matlab®, http://qtfm.sourceforge.net/; S.J. Sangwine, N. Le Bihan, Quaternion Toolbox for Matlab®, http://qtfm.sourceforge.net/
[28] W.R. Hamilton, Researches respecting quaternions. First series (1843), in: H. Halberstam, R.E. Ingram (Eds.), The Mathematical Papers of Sir William Rowan Hamilton, Vol. III Algebra, Cambridge University Press, Cambridge, 1967, Ch. 7, pp. 159-226, first published as [32]; W.R. Hamilton, Researches respecting quaternions. First series (1843), in: H. Halberstam, R.E. Ingram (Eds.), The Mathematical Papers of Sir William Rowan Hamilton, Vol. III Algebra, Cambridge University Press, Cambridge, 1967, Ch. 7, pp. 159-226, first published as [32]
[29] P. Lounesto, R. Mikkola, V. Vierros, CLICAL user manual, Research Report A248, Helsinki University of Technology, Institute of Mathematics, Espoo, Finland (Aug. 1987).; P. Lounesto, R. Mikkola, V. Vierros, CLICAL user manual, Research Report A248, Helsinki University of Technology, Institute of Mathematics, Espoo, Finland (Aug. 1987).
[30] Sangwine, S. J., Fourier transforms of colour images using quaternion, or hypercomplex, numbers, Electronics Letters, 32, 21, 1979-1980 (1996)
[31] (Borowski, E. J.; Borwein, J. M., Collins Dictionary of Mathematics (2002), HarperCollins Glasgow)
[32] Hamilton, W. R., Researches respecting quaternions, Transactions of the Royal Irish Academy, 21, 199-296 (1848)
[33] (Gürlebeck, K., 9th International Conference on Clifford Algebras and their Applications (2011), Weimar: Weimar Germany)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.