Fast algorithms for a multidimensional hypercomplex discrete Fourier transform with radix-3 decomposition

摘要

Combined algorithms for the multidimensional hypercomplex discrete Fourier transform (HDFT) of a real signal with data representation in the Hamilton-Eisenstein generalized codes are synthesized. The complexity of arithmetic operations in a commutative-associative hypercomplex algebra and its representation in generalized codes are obtained. It is shown that there exist only two essentially different commutative-associative hypercomplex algebras: the direct sums of real or complex algebras. The computational complexity of the algorithm synthesized is estimated.