2019/05/29 by Łukasz Błaszczyk, Błaszczyk, Łukasz
Computer Science · Mathematics · Physics and Astronomy · #Classical Analysis and ODEs (math.CA) #FOS: Mathematics #FOS: Physical sciences #Mathematical Physics (math-ph) #Nonlinear Dynamics and Pattern Formation #math-ph #math.CA #math.MP
paper · pdf · doi:10.48550/arxiv.1905.12631
openalex publication_date 2019/05/29 · arxiv created 2019/12/20 · arxiv updated 2019/12/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The paper is devoted to the development of the octonion Fourier transform (OFT) theory initiated in 2011 in articles by Hahn and Snopek. It is also a continuation and generalization of earlier work by Blaszczyk and Snopek, where they proved few essential properties of the OFT of real-valued functions, e.g. symmetry properties. The results of this article focus on proving that the OFT is well-defined for octonion-valued functions and almost all well-known properties of classical (complex) Fourier transform (e.g. argument scaling, modulation and shift theorems) have their direct equivalents in octonion setup. Those theorems, illustrated with some examples, lead to the generalization of another result presented in earlier work, i.e. Parseval and Plancherel Theorems, important from the signal and system processing point of view. Moreover, results presented in this paper associate the OFT with 3-D LTI systems of linear PDEs with constant coefficients. Properties of the OFT in context of signal-domain operations such as derivation and convolution of ℝ-valued functions will be stated. There are known results for QFT, but they use the notion of other hypercomplex algebra, i.e. double-complex numbers. Considerations presented here require defining other higher-order hypercomplex structure, i.e. quadruple-complex numbers. This hypercomplex generalization of the Fourier transformation provides an excellent tool for the analysis of 3-D LTI systems.