Показати скорочену інформацію

dc.contributor.authorKozhemjako, Vladimiren
dc.contributor.authorMaidanuk, Vladimiren
dc.contributor.authorZhukov, Konstantinen
dc.contributor.authorКожемяко, В. П.uk
dc.contributor.authorМайданюк, В. П.uk
dc.contributor.authorЖуков, К. М.uk
dc.date.accessioned2020-01-02T20:27:06Z
dc.date.available2020-01-02T20:27:06Z
dc.date.issued1999
dc.identifier.citationKozhemjako V. Fast orthogonal multivariate transforms [Text] / Vladimir Kozhemjako, Vladimir Maidanuk, Konstantin Zhukov // Processing of Fifth International Conference on Pattern Recognition and Information, Minsk, Belarus, May 18-20, 1999. – Vol. 2. – P. 215-219.en
dc.identifier.urihttp://ir.lib.vntu.edu.ua//handle/123456789/28207
dc.description.abstractModifications of Nussbaumer-Quandalle Fourier Transform fast algorithm for code lendths 2n 2n are considered. The possibility of calculating of all coefficients for two steps offered. At first step the even first index coefficients has calculated in analogy Nussbaumer-Quandalle algorithm; and at the second step the odd first index coefficients has calculated. The presented calculating order assured a parallel processing and structure algorithm improvement without essential or with conversed computional complexity changes.en
dc.language.isoenen
dc.publisherBelarusian State University of Informatics and Radioelectronicsen
dc.relation.ispartofProcessing of Fifth International Conference on Pattern Recognition and Information, Minsk, Belarus, May 18-20, 1999. Vol. 2 : 215-219.en
dc.subjectfourier transformen
dc.subjectconcurencyen
dc.subjectparallel processingen
dc.titleFast orthogonal multivariate transformsen
dc.typeArticle
dc.identifier.udc621.305


Файли в цьому документі

Thumbnail

Даний документ включений в наступну(і) колекцію(ї)

Показати скорочену інформацію