Fast orthogonal multivariate transforms

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.