dc.contributor.author | Kozhemjako, Vladimir | en |
dc.contributor.author | Maidanuk, Vladimir | en |
dc.contributor.author | Zhukov, Konstantin | en |
dc.contributor.author | Кожемяко, В. П. | uk |
dc.contributor.author | Майданюк, В. П. | uk |
dc.contributor.author | Жуков, К. М. | uk |
dc.date.accessioned | 2020-01-02T20:27:06Z | |
dc.date.available | 2020-01-02T20:27:06Z | |
dc.date.issued | 1999 | |
dc.identifier.citation | Kozhemjako 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.uri | http://ir.lib.vntu.edu.ua//handle/123456789/28207 | |
dc.description.abstract | Modifications 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.iso | en | en |
dc.publisher | Belarusian State University of Informatics and Radioelectronics | en |
dc.relation.ispartof | Processing of Fifth International Conference on Pattern Recognition and Information, Minsk, Belarus, May 18-20, 1999. Vol. 2 : 215-219. | en |
dc.subject | fourier transform | en |
dc.subject | concurency | en |
dc.subject | parallel processing | en |
dc.title | Fast orthogonal multivariate transforms | en |
dc.type | Article | |
dc.identifier.udc | 621.305 | |