Please use this identifier to cite or link to this item:
https://sci.ldubgd.edu.ua/jspui/handle/123456789/772Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Prots’ko, Ihor | - |
| dc.contributor.author | Rykmas, Roman | - |
| dc.date.accessioned | 2015-12-20T18:39:40Z | - |
| dc.date.available | 2015-12-20T18:39:40Z | - |
| dc.date.issued | 2015 | - |
| dc.identifier.uri | http://hdl.handle.net/123456789/772 | - |
| dc.description.abstract | The enumeration approaches of efficient computation discrete transform of Fourier class using cyclic convolutions is considered. The formulation of the basis matrix of transforms into the block cyclic structures is described of each approach. The analysis of the advantages and imperfections of the algorithms are discussed. | uk |
| dc.publisher | American Journal of Circuits, Systems and Signal Processing | uk |
| dc.subject | Discrete Transform of Fourier Class, Cyclic Convolution, Efficient Algorithms | uk |
| dc.title | Becoming of discrete harmonic transform using cyclic convolutions | uk |
| Appears in Collections: | 2015 | |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.