An algorithm for multiplication of Dirac numbers

• Autorzy: Cariow A. , Cariowa G.
• Języki publikacji: EN

Abstrakty

EN

In this work a rationalized algorithm for Dirac numbers multiplication is presented. This algorithm has a low computational complexity feature and is well suited to parallelization of computations. The computation of two Dirac numbers product using the naïve method takes 256 real multiplications and 240 real additions, while the proposed algorithm can compute the same result in only 128 real multiplications and 160 real additions. During synthesis of the discussed algorithm we use the fact that Dirac numbers product may be represented as vector-matrix product. The matrix participating in the product has unique structural properties that allow performing its advantageous decomposition. Namely this decomposition leads to significant reducing of the computational complexity.

Słowa kluczowe

EN

Dirac numbers; multiplication of hypercomplex numbers; fast algorithms

• Wydawca: Komisja Informatyki Polskiej Akademii Nauk, Oddział w Gdańsku
• Czasopismo: Journal of Theoretical and Applied Computer Science
• Rocznik: 2013
• Tom: Vol. 7, nr 4
• Strony: 26--34
• Opis fizyczny: Bibliogr. 17 poz., rys., tab.

Twórcy

autor

Cariow A.

• Faculty of Computer Science and Information Technology, West Pomeranian University of Technology, Szczecin, Poland

autor

Cariowa G.

• Faculty of Computer Science and Information Technology, West Pomeranian University of Technology, Szczecin, Poland

Bibliografia

• [1] Kantor I., Solodovnikov A.: Hypercomplex numbers, Springer-Verlag, New York. (1989)
• [2] Bülow T., Sommer G.: Hypercomplex signals – a novel extension of the analytic signal to the multidimensional case, IEEE Trans. Sign. Proc., Vol. SP-49, No. 11, 2844-2852. (2001)
• [3] Alfsmann D.: On families of 2N-dimensional hypercomplex algebras suitable for digital signal processing, in Proc. European Signal Processing Conf. (EUSIPCO 2006), Florence, Italy (2006)
• [4] Alfsmann D., Göckler H. G., Sangwine S. J., Ell T. A.: Hypercomplex Algebras in Digital Signal Processing: Benefits and Drawbacks (Tutorial). Proc. EURASIP 15th European Signal Processing Conference (EUSIPCO 2007), Poznań, Poland, 1322-1326. (2007)
• [5] Sangwine S. J., Bihan N. Le: Hypercomplex analytic signals: extension of the analytic signal concept to complex signals, Proc. EURASIP 15th European Signal Processing Conference (EUSIPCO 2007), Poznań, Poland, 621-624. (2007)
• [6] Moxey C. E., Sangwine S. J., Ell T. A.: Hypercomplex correlation techniques for vector images, IEEE Trans. Signal Processing, Vol. 51, No 7, 1941-1953. (2003).
• [7] Bayro-Corrochano E.: Multi-resolution image analysis using the quaternion wavelet transform, Numerical Algorithms, Vol. 39, No 1-3, 35-55. (2005)
• [8] Calderbank R., Das S., Al-Dhahir N., Diggavi S.: Construction and analysis of a new quaternionic Space-time code for 4 transmit antennas, Communications in information and systems, Vol. 5, No. 1, 1-26. (2005)
• [9] Belfiore J.-C., Rekaya G.: Quaternionic lattices for space-time coding,: Proceedings of the Information Theory Workshop.IEEE, Paris 31 March - 4 April 2003, 267 - 270. (2003)
• [10] Ertuğ Ö.: Communication over Hypercomplex Kahler Manifolds: Capacity of Dual-Polarized Multidimensional-MIMO Channels. Wireless Personal Communications, vol. 41, No 1, 155-168, (2007)
• [11] Silvestrov V. V.: Number Systems, Soros Educational Journal, No 8, 121-127. (1998)
• [12] Makarov O.: An algorithm for the multiplication of two quaternions, Zh. Vychisl. Mat. Mat. Fiz., Vol. 17, No 6 , 1574–1575. (1977)
• [13] Rososhek S., Litvin A., Cherniayeva N.: Fast algorithm of multiplying two hypercomplex numbers, Vestnik TGU. Ser. Matematika. Kibernetika. Informatika, No. 269, 66-68. (2000).
• [14] Cariow A., Cariowa G.: Algorithm for multiplying two octonions, Radioelectronics and Communications Systems. Allerton Press, Inc., Vol. 55, No 10, 464-473. (2012)
• [15] Cariow A., Cariow G.: An algorithm for fast multiplication of sedenions, Information Processing Letters 113, 324–331. (2013)
• [16] Ţariov A.: Strategie racjonalizacji obliczeń przy wyznaczaniu iloczynów macierzowowektorowych. Metody Informatyki Stosowanej, No 1, 147-158. (2008)
• [17] Ţariov А.: Algorytmiczne aspekty racjonalizacji obliczeń w cyfrowym przetwarzaniu sygnałów, Wydawnictwo Zachodniopomorskiego Uniwersytetu Technologicznego. (2011)