Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Aleksandr Cariow"'
Publikováno v:
Signals, Vol 5, Iss 3, Pp 417-437 (2024)
Toeplitz matrix–vector products are used in many digital signal processing applications. Direct methods for calculating such products require N2 multiplications and N(N−1) additions, where N denotes the order of the Toeplitz matrix. In the case o
Externí odkaz:
https://doaj.org/article/29f6a1612bf74fae9d3794a76f0dc947
Publikováno v:
Applied Sciences, Vol 14, Iss 18, p 8123 (2024)
The paper presents the original structure of a processing unit for multiplying quaternions. The idea of organizing the device is based on the use of fast Hadamard transform blocks. The operation principles of such a device are described. Compared to
Externí odkaz:
https://doaj.org/article/b0f84f5b387b41ae8e4bc7d5a8bf8de6
Publikováno v:
Applied Sciences, Vol 13, Iss 15, p 9004 (2023)
The paper introduces a range of efficient algorithmic solutions for implementing the fundamental filtering operation in convolutional layers of convolutional neural networks on fully parallel hardware. Specifically, these operations involve computing
Externí odkaz:
https://doaj.org/article/bb63e44472af4dce9128f68395764dd2
Autor:
Aleksandr Cariow, Oleg Finko
Publikováno v:
Applied Sciences, Vol 13, Iss 11, p 6563 (2023)
The evolution of human society is inevitably associated with the widespread development of computer technologies and methods, and the constant evolution of the theory and practice of data processing, as well as the need to solve increasingly complex
Externí odkaz:
https://doaj.org/article/58385dad050343f68f00f5080178a651
Publikováno v:
Applied Sciences, Vol 12, Iss 9, p 4700 (2022)
This paper proposes fast algorithms for computing the discrete Fourier transform for real-valued sequences of lengths from 3 to 9. Since calculating the real-valued DFT using the complex-valued FFT is redundant regarding the number of needed operatio
Externí odkaz:
https://doaj.org/article/cdedafae2ff844f8a80ec3b2b979230b
Autor:
Aleksandr Cariow, Janusz P. Paplinski
Publikováno v:
Algorithms, Vol 14, Iss 11, p 309 (2021)
The article presents a parallel hardware-oriented algorithm designed to speed up the division of two octonions. The advantage of the proposed algorithm is that the number of real multiplications is halved as compared to the naive method for implement
Externí odkaz:
https://doaj.org/article/9eacef866ff6441c989a4f9d84f90002
Publikováno v:
Applied Sciences, Vol 11, Iss 17, p 8203 (2021)
This paper presents a new algorithm for multiplying two Kaluza numbers. Performing this operation directly requires 1024 real multiplications and 992 real additions. We presented in a previous paper an effective algorithm that can compute the same re
Externí odkaz:
https://doaj.org/article/32c7f8097e5247689d28845026ea141b
Autor:
Janusz P. Paplinski, Aleksandr Cariow
Publikováno v:
Applied Sciences, Vol 11, Iss 15, p 7007 (2021)
This article presents an efficient algorithm for computing a 10-point DFT. The proposed algorithm reduces the number of multiplications at the cost of a slight increase in the number of additions in comparison with the known algorithms. Using a 10-po
Externí odkaz:
https://doaj.org/article/69218619fe95470abdc677aec05a2d73
Publikováno v:
IEEE Signal Processing Letters. 27:1195-1199
In this paper a new discrete fractional transform for data vectors whose size $N$ is a power of two is proposed. The basic operation of the introduced transform is a discrete fractional Hadamard transform. Since the described transform is not a class
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e58079324498c5dd53ac88fa66cf06f0
https://doi.org/10.1109/lsp.2020.3005535
https://doi.org/10.1109/lsp.2020.3005535
Publikováno v:
Applied Sciences
Volume 11
Issue 17
Applied Sciences, Vol 11, Iss 8203, p 8203 (2021)
Volume 11
Issue 17
Applied Sciences, Vol 11, Iss 8203, p 8203 (2021)
This paper presents a new algorithm for multiplying two Kaluza numbers. Performing this operation directly requires 1024 real multiplications and 992 real additions. We presented in a previous paper an effective algorithm that can compute the same re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::62c996491f0df550542a3c94a2101c56