activity
20152020
most citedDerivation of a low multiplicative complexity algorithm for multiplying hyperbolic octonions

11 citations · 17 across the 8 of their papers we have counts for

collaborators
Showing cs.DSShow all

5 papers · 1 filter

cs.DS20171 cited

Hardware-Efficient Schemes of Quaternion Multiplying Units for 2D Discrete Quaternion Fourier Transform Processors

Aleksandr Cariow, Galina Cariowa, Marina Chicheva

In this paper, we offer and discuss three efficient structural solutions for the hardware-oriented implementation of discrete quaternion Fourier transform basic operations with red…

cs.DS2015

An algorithm for fast computation of the multiresolution discrete Fourier transform

Bartosz Andreatto, Aleksandr Cariow

The article presents a computationally effective algorithm for calculating the multiresolution discrete Fourier transform (MrDFT). The algorithm is based on the idea of reducing th…

cs.DS20151 cited

An algorithm for multipication of Kaluza numbers

Aleksandr Cariow, Galina Cariowa, Rafał Łentek

This paper presents the derivation of a new algorithm for multiplying of two Kaluza numbers. Performing this operation directly requires 1024 real multiplications and 992 real addi…

cs.DS20151 cited

An algorithm for multiplication of split-octonions

Aleksandr Cariow, Galina Cariowa, Bartosz Kubsik

In this paper we introduce efficient algorithm for the multiplication of split-octonions. The direct multiplication of two split-octonions requires 64 real multiplications and 56 r…

cs.DS201511 cited

Derivation of a low multiplicative complexity algorithm for multiplying hyperbolic octonions

Aleksandr Cariow, Galina Cariowa, Jaroslaw Knapinski

We present an efficient algorithm to multiply two hyperbolic octonions. The direct multiplication of two hyperbolic octonions requires 64 real multiplications and 56 real additions…