The efficient computation of Fourier transforms on the symmetric group

Discrete transforms are introduced and are defined in a ring of polynomials. These polynomial transforms are shown to have the convolution property and can be computed in ordinary arithmetic, without multiplications. Polynomial transforms are ...

Algorithms of parallel computation of multidimensional discrete orthogonal transforms that rely on a previously developed approach to paralleling discrete Fourier transforms and methods of reducing different discrete orthogonal transforms (discrete ...