Abstract
The main idea of the paper is that fast algorithms, like FFT, can be made more efficient in the context of an algebra, rather than in the more singular quaternion or complex algebras structure. However, the complex algebra structure can then be recovered as a projection from the larger algebra in which it is embedded. Namely, the 12-dimensional algebra (hurwitzion algebra) having the basis elements associated with the integer Hurwitz quaternions is introduced. The computational aspects of the hurwitzion arithmetic are considered. The overlapped fast algorithms of two-dimensional discrete Fourier transform of an RGB image are also developed.
This work was performed with financial support from the Russian Foundation for Basic Research (Grant 00-01-00600).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Elliot, D.F., Rao, T.R.: Fast Transforms. Academic, New York (1982)
Hurwitz, A.: Übcr die Zahlcntheorie der Quatciuionen. Nach. Gesellschaft Wiss. Göttingen, Math.-Phys. Klasse, 313-340 (1896)
Coxeter, H.S.: Twelve Geometric Essays. Southern Illinois Press, Carbondalc IL (1968)
Conway, H.J., Sloan, N.J.A.: Sphere Packing, Lattices and Groups. Springer, Heidelberg (1988)
Blahut, R.E.: Fast-Algorithms for Digital Signal Processing. Addison-Wesley, Reading (1985)
Chernov, V.M.: Parametrization of Some Classes of Fast Algorithms for Discrete Orthogonal Transforms (1). Pattern Recognition and Image Analysis 5(2), 238–245 (1995)
Chernov, V.M.: Arithmetic Methods in the Theory of Discrete Orthogonal Transforms. In: Proc. SPTE, vol. 2363, pp. 134–141 (1994)
Chernov, V.M.: Discrete Orthogonal Transforms with Data Representation in Composition Algebras. In: Proceedings of The 9th Scandinavian Conference on Image Analysis, Uppsala, Sweden, vol. 1, pp. 357–364 (1995)
Sangwine, S.J.: Fourier Transforms of Color Images Using Quaternion or Hypercomplex, Numbers. Electronics Letters 32(21), 1979–1980 (1996)
Nussbaumer, H.J.: Fast Fourier Transform, and Convolution Algorithms. Springer, Berlin (1982)
Buelow, T., Sommer, G.: Multi-Dimensional Signal Processing Using an Algebraically Extended Signal Representation. In: Sommer, G., Koenderink, J.J. (eds.) Algebraic Frames for Perception- Action Cycle. LNCS, vol. 1395, pp. 148–163. Springer, Heidelberg (1997)
Chernov, V.M., Buelow, T., Felsberg, M.: Synthesis of Fast Algorithms for Discrete Fourier-Clifford Transform. Pattern Recognition and Image Analysis 8(2), 274–275 (1998)
Chichyeva, M.A., Pershina, M.V.: On Various Schemes of 2D-DFT Decomposition with Data Representation in the Quaternion Algebra. Image Processing and Communications 2(1), 13–20 (1996)
Chernov, V.M.: Clifford Algebras as Projections of Group Algebras: How Can We Profit From It? In: Bayro-Corroclumo, E., Sobczyk, G. (eds.) Advanhces in Geometric Algebra with Applications in Science and Engineering, pp. 467–482. Birkhauser, Boston (2000)
Tits, J.: Quaternions over Q(\(\sqrt{5}\)). Leech’s Lattice and the Sporadic Group of Hall-Janko. Leech’s Lattice and the Sporadic Group of Hall-Janko, J. Algebra 63, 56–75 (1980)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chernov, V.M. (2000). Hurwitzion Algebra and its Application to the FFT Synthesis. In: Sommer, G., Zeevi, Y.Y. (eds) Algebraic Frames for the Perception-Action Cycle. AFPAC 2000. Lecture Notes in Computer Science, vol 1888. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10722492_10
Download citation
DOI: https://doi.org/10.1007/10722492_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41013-3
Online ISBN: 978-3-540-45260-7
eBook Packages: Springer Book Archive