Fast Algorithm of a Multidimensional Hypercomplex Discrete Fourier Transform with Radix-3 Decomposition

摘要

The "overlapped" algorithm of the multidimensional hypercomplex discrete Fourier transform of a real signal with data represented in generalized Hamilton–Eisenstein codes is presented. The complexity of arithmetic operations in commutative-associative hypercomplex algebra and in its representation in generalized codes is derived. The computational complexity of the synthesized algorithm is estimated.