Decomposition on a Group and Parallel Convolution and Fast Fourier Transform Algorithms
by Olga V. Klimova
Abstract:
The group-theoretic approach to the decomposition of the basic operations of the digital signal processing (DSP) such as discrete Fourier transform (DFT) and convolution is proposed. The distinctive feature of the approach is its primordial orientation to parallel processing. The recurrent description of the decomposition process producing fast parallel algorithms are effective both for parallel and sequential processing. The main properties of these algorithms are formulated and the description of a vector DFT algorithm is adduced.
Keywords: applications
Source:
O.V. Klimova, Decomposition on a Group and Parallel Convolution and Fast Fourier Transform Algorithms. In V. Malyshkin (ed.),
Parallel Computing Technologies: Proceedings of the 4th International Conference,
Lect. Notes in Comp. Sci., Vol. 1277, Springer, 1997, pp. 358-363
