The Structure of a Hyper Fast Calculation Method Linear Convolution of Discrete Signals
The method for fast evaluation of linear convolution of long arrays of numbers 2п by representing them in special hypercomplex number systems and having isomorphic to these systems, the implementation of hypercomplex operations that require less real operations, has been investigated. Fig.: 5. Refs:...
Saved in:
| Date: | 2013 |
|---|---|
| Main Author: | Калиновський, Я. О. |
| Format: | Article |
| Language: | Russian |
| Published: |
Інститут проблем реєстрації інформації НАН України
2013
|
| Subjects: | |
| Online Access: | http://drsp.ipri.kiev.ua/article/view/103363 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Data Recording, Storage & Processing |
Institution
Data Recording, Storage & ProcessingSimilar Items
-
Algorithms for Fast Computation of Cyclic Convolutions with the Notion of Discrete Signals Hypercomplex Numbers
by: Kalinovsky, Ya. O., et al.
Published: (2014) -
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) -
Recursive method for constructing linear convolution algorithms of various lengths using hypercomplex number systems.
by: Kalinovsky, Ya. A., et al.
Published: (2019) -
Structure of an algoritsm for quick two-dimensional convolution by means of isomorphing hypercomplex numerical systems
by: Kalinovsky, Ya. A., et al.
Published: (2018) -
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)