{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T15:40:02Z","timestamp":1745941202974,"version":"3.40.4"},"reference-count":28,"publisher":"Walter de Gruyter GmbH","issue":"4","license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,1,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper we introduce efficient algorithm for the multiplication of sedenions. The direct multiplication of two sedenions requires 256 real multiplications and 240 real additions. We show how to compute a sedenions product with 120 real multiplications and 344 real additions.<\/jats:p>","DOI":"10.2478\/s13537-012-0031-7","type":"journal-article","created":{"date-parts":[[2012,12,27]],"date-time":"2012-12-27T14:20:27Z","timestamp":1356618027000},"source":"Crossref","is-referenced-by-count":0,"title":["Rationalized algorithm for computing the product of two sedenions"],"prefix":"10.2478","volume":"2","author":[{"given":"Aleksandr","family":"Cariow","sequence":"first","affiliation":[]},{"given":"Galina","family":"Cariowa","sequence":"additional","affiliation":[]}],"member":"374","reference":[{"key":"31_CR1","unstructured":"Alfsmann D., On families of 2N-dimensional hypercomplex algebras suitable for digital signal processing, In: Proceedings of European Signal Processing Conf. (EUSIPCO 2006), Florence, Italy, 2006"},{"key":"31_CR2","unstructured":"Alfsmann D., G\u00f6ckler H.G., Sangwine S.J., Ell T.A., Hypercomplex Algebras in Digital Signal Processing: Benefits and Drawbacks (Tutorial), In: Proceedings of EURASIP 15th European Signal Processing Conference (EUSIPCO 2007), Poznan, Poland, 1322\u20131326, 2007"},{"key":"31_CR3","doi-asserted-by":"crossref","first-page":"2844","DOI":"10.1109\/78.960432","volume":"11","author":"T. B\u00fclow","year":"2001","unstructured":"B\u00fclow T., Sommer G., Hypercomplex signals \u2014 a novel extension of the analytic signal to the multidimensional case, IEEE Trans. Sign. Proc., SP-49, 11, 2844\u20132852, 2001","journal-title":"IEEE Trans. Sign. Proc., SP-49"},{"key":"31_CR4","doi-asserted-by":"crossref","first-page":"97","DOI":"10.4310\/CIS.2005.v5.n1.a4","volume":"5","author":"R. Calderbank","year":"2005","unstructured":"Calderbank R., Das S., Al Dhahir N., Diggavi S., Construction And Analysis of A New Quaternionic Space-Time Code For 4 Transmit Antennas, Commun. Inf. Syst., 5, 97\u2013122, 2005","journal-title":"Commun. Inf. Syst."},{"key":"31_CR5","first-page":"996","volume":"3","author":"W. L. Chan","year":"2004","unstructured":"Chan W. L., Choi H., Baraniuk R. G., Directional hypercomplex wavelets for multidimensional signal analysis and processing, In: Proceedings of ICASSP\u2019 04: IEEE International Conference on Acoustics, Speech, and Signal Processing, 3, 996\u2013999, 2004","journal-title":"Proceedings of ICASSP\u2019 04: IEEE International Conference on Acoustics, Speech, and Signal Processing"},{"key":"31_CR6","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/s11277-006-9135-5","volume":"41","author":"O. Ertug","year":"2006","unstructured":"Ertug O., Communication over Hypercomplex Kahler Manifolds: Capacity of Dual-Polarized Multidimensional-MIMO Channels, Wirel. Pers. Commun., 41, 155\u2013168, 2006","journal-title":"Wirel. Pers. Commun."},{"key":"31_CR7","first-page":"167","volume":"59","author":"S.L. Hahn","year":"2011","unstructured":"Hahn S.L., Snopek K.M., The unified theory of n-dimensional complex and hypercomplex analytic signals, Bull. Pol. Acad. Sci. Tech. Sci., 59, 167\u2013181, 2011","journal-title":"Bull. Pol. Acad. Sci. Tech. Sci."},{"key":"31_CR8","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0096-3003(99)00140-X","volume":"115","author":"K. Imaeda","year":"2000","unstructured":"Imaeda K., Imaeda M., Sedenions: algebra and analysis, Appl. Math. Comput., 115, 77\u201388, 2000","journal-title":"Appl. Math. Comput."},{"key":"31_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-3650-4","volume-title":"Hypercomplex numbers","author":"I. Kantor","year":"1989","unstructured":"Kantor I., Solodovnikov A., Hypercomplex numbers (Springer-Verlag, New York, 1989)"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Liu L., An Introduction to Hyper-Complex on Meaningful Digital Watermarking, In: Proceedings of 6th International Conference on Wireless Communications Networking and Mobile Computing 23\u201325 Sept. 2010, 1\u20135, 2010","DOI":"10.1109\/WICOM.2010.5600649"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Lu Z., Xu Y., Yang X., Song L., Traversoni L., 2D quaternion Fourier transform: the spectral properties and its application in color image representation, In: Proceedings of IEEE International Conference on Multimedia and Expo., 1715\u20131718, 2007","DOI":"10.1109\/ICME.2007.4285000"},{"key":"31_CR12","first-page":"1574","volume":"17","author":"O.M. Makarov","year":"1977","unstructured":"Makarov O.M., An algorithm for the multiplication of two quaternions, Zh. Vychisl. Mat. Mat. Fiz., 17, 1574\u20131575, 1977","journal-title":"Zh. Vychisl. Mat. Mat. Fiz."},{"key":"31_CR13","first-page":"29","volume":"3","author":"E. Malekian","year":"2011","unstructured":"Malekian E., Zakerolhosseini A., Mashatan A., QTRU: Quaternionic Version of the NTRU Public-Key Cryptosystems, Int. J. Inf. Secur., 3, 29\u201342, 2011","journal-title":"Int. J. Inf. Secur."},{"key":"31_CR14","doi-asserted-by":"crossref","first-page":"1218","DOI":"10.1109\/TSP.2006.870630","volume":"54","author":"S. Miron","year":"2006","unstructured":"Miron S., Le Bihan N., Mars J., Quaternion-music for vector-sensor array processing, IEEE Trans. Signal Process., 54, 1218\u20131229, 2006","journal-title":"IEEE Trans. Signal Process."},{"key":"31_CR15","doi-asserted-by":"crossref","first-page":"1941","DOI":"10.1109\/TSP.2003.812734","volume":"51","author":"C.E. Moxey","year":"2003","unstructured":"Moxey C.E., Sangwine S. J., Ell T.A., Hypercomplex correlation techniques for vector images, IEEE Trans. Signal Process., 2003. 51, 1941\u20131953","journal-title":"IEEE Trans. Signal Process."},{"key":"31_CR16","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/AINA.2004.1283751","volume":"2","author":"T. Nagase","year":"2004","unstructured":"Nagase T., Komata M., Araki T., Secure Signals Transmission Based on Quaternion Encryption Scheme, In: Proceedings of IEEE Advanced Information Networking and Applications (AINA 2004), 2, 35\u201338, 2004","journal-title":"Proceedings of IEEE Advanced Information Networking and Applications (AINA 2004)"},{"key":"31_CR17","doi-asserted-by":"crossref","unstructured":"Pei S., Cheng C., A novel block truncation coding of color images by using quaternion-moment preserving principle. In: Proceedings of IEEE International Symposium on Circuits and systems. Volume 2., Atlanta, USA, 684\u2013687, 1996","DOI":"10.1109\/ISCAS.1996.541817"},{"key":"31_CR18","doi-asserted-by":"crossref","first-page":"1979","DOI":"10.1049\/el:19961331","volume":"32","author":"S.J. Sangwine","year":"1996","unstructured":"Sangwine S.J., Fourier transforms of color images using quaternion or hypercomplex, numbers, Electron. Lett, 32, 1979\u20131980, 1996","journal-title":"Electron. Lett"},{"key":"31_CR19","unstructured":"Sangwine S.J., Bihan N. Le, Hypercomplex analytic signals: extension of the analytic signal concept to complex signals, In: Proceedings of EURASIP 15th European Signal Processing Conference (EUSIPCO 2007), Poznan, Poland, 621\u2013624, 2007"},{"key":"31_CR20","doi-asserted-by":"crossref","unstructured":"Sangwine S.J., Ell T.A., Hypercomplex auto- and cross-correlation of color images, In: Proceedings of ICIP, 319\u2013323, 1999","DOI":"10.1109\/ICIP.1999.819603"},{"key":"31_CR21","doi-asserted-by":"crossref","unstructured":"Sch\u00fctte H.D., Wenzel J., Hypercomplex numbers in digital signal processing, In: Proceedings of ISCAS\u2019 90, New Orleans, 1557\u20131560, 1990","DOI":"10.1109\/ISCAS.1990.112431"},{"key":"31_CR22","doi-asserted-by":"crossref","unstructured":"Steeb W.H., Hardy Y., Matrix Calculus and Kronecker Product: A Practical Approach to Linear and Multilinear Algebra (World Scientific Publishing Company, 2011)","DOI":"10.1142\/8030"},{"key":"31_CR23","unstructured":"\u0162ariov A., Algorithmic aspects of computing rationalization in digital signal processing (West Pomeranian University of Technology Press, 2011) (In Polish)"},{"key":"31_CR24","first-page":"104","volume":"11","author":"A. \u0162ariov","year":"2010","unstructured":"\u0162ariov A., \u0162ariova G., Algorithmic aspects of Cayley numbers multiplier organization, Elektronika, 11, 104\u2013108, 2010 (in Polish)","journal-title":"Elektronika"},{"key":"31_CR25","first-page":"668","volume":"7","author":"G. \u0162ariova","year":"2010","unstructured":"\u0162ariova G., \u0162ariov A., Algoritmic aspects of multiplication blocks number reduction in a two quaternion hardware multiplier, Meas. Autom. Monit., 7, 668\u2013690, 2010 (in Polish)","journal-title":"Meas. Autom. Monit."},{"key":"31_CR26","first-page":"133","volume":"1","author":"G. \u0162ariova","year":"2011","unstructured":"\u0162ariova G., \u0162ariov A., Representation of sedenions multiplication via matrix-vector product, Metody Informatyki Stosowanej, 1, 133\u2013139, 2011","journal-title":"Metody Informatyki Stosowanej"},{"key":"31_CR27","first-page":"479","volume":"1","author":"K. Ueda","year":"1993","unstructured":"Ueda K., Takahashi. S.I., Digital filters with hypercomplex coefficients, In: Proceedings of IEEE Int. Symp. Circuits Syst., 1, 479\u2013482, 1993","journal-title":"Proceedings of IEEE Int. Symp. Circuits Syst."},{"key":"31_CR28","doi-asserted-by":"crossref","unstructured":"Villegas M., Paredes R., Face Recognition in Color Using Complex and Hypercomplex Representations. Pattern Recognition and Image Analysis, Lect. Notes Comput. Sci., 4477, 217\u2013224, 2007","DOI":"10.1007\/978-3-540-72847-4_29"}],"container-title":["Open Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.2478\/s13537-012-0031-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.2478\/s13537-012-0031-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.2478\/s13537-012-0031-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T15:15:20Z","timestamp":1745939720000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.2478\/s13537-012-0031-7\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,1]]},"references-count":28,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.2478\/s13537-012-0031-7","relation":{},"ISSN":["2299-1093"],"issn-type":[{"type":"electronic","value":"2299-1093"}],"subject":[],"published":{"date-parts":[[2012,1,1]]}}}