Structure of an algoritsm for quick two-dimensional convolution by means of isomorphing hypercomplex numerical systems
In the mathematical modeling of linear systems, it is necessary to repeatedly perform a linear convolution of discrete signals. The complexity of calculating the linear convolution rapidly increases with the length of the convoluted arrays and their dimension, thus the methods of «fast» convolution...
Saved in:
| Date: | 2018 |
|---|---|
| Main Authors: | Kalinovsky, Ya. A., Boyarinova, Yu. E., Khitsko, Ya. V., Sukalo, A. S. |
| Format: | Article |
| Language: | Russian |
| Published: |
Інститут проблем реєстрації інформації НАН України
2018
|
| Subjects: | |
| Online Access: | http://drsp.ipri.kiev.ua/article/view/142899 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Data Recording, Storage & Processing |
Institution
Data Recording, Storage & ProcessingSimilar Items
-
Recursive method for constructing linear convolution algorithms of various lengths using hypercomplex number systems.
by: Kalinovsky, Ya. A., et al.
Published: (2019) -
Study of Symmetries Operator of Isomorphism Hypercomplex Number Systems and Their Application for the Synthesis of Algorithms of Fast Calculations of Cyclic Convolution
by: Kalinovsky, Ya. O.
Published: (2014) -
Algorithms for Fast Computation of Cyclic Convolutions with the Notion of Discrete Signals Hypercomplex Numbers
by: Kalinovsky, Ya. O., et al.
Published: (2014) -
The General Case of an Isomorphism of Commutative Hypercomplex Number Systems and Presentation of Exponential Functions in Them
by: Kalinovsky, Ja. A., et al.
Published: (2012) -
Construction of High-Dimensional Isomorphic Hypercomplex Number Systems
by: Боярінова, Ю. Є., et al.
Published: (2012)