The parallel circuit of fourier discrete and fast transformations on the basis of the base elements polynomial representation

Circuits of the parallel evaluation of the functions, approximated by the orthogonal trigonometrical polynoms, including summation of Fourier series, performance of Diskret Fourier Transformation (DFT), Fast Fourier Transformation (FFT) are stated. The any number of basis' elements of the given decomposition is in parallel calculated with the minimal time complexity at dynamic change of counting, thus circuits combine calculation of basis' elements with performance of orthogonal transformations.