Tensor product offers a natural language for expressing digital
Stride Permutation · 1989
Closely associated with tensor products are a class of permu tations, the stride permutations. These permutations govern the addressing between the stages of the tensor product decompositions of DSP algorithms. AB we will see in the following chapters, these permutations distinguish the variants of the Cooley-Tukey FFT al gorithms and other DSP algorithms. Tensor product formulation of DSP algorithms also offers the convenience of modifying the algorithms to adapt to specific com puter architectures. Tensor product identities can be used in the process of automating the implementation of the algorithms on these architectures. The formalism of tensor product notation can be used to keep track of the complicated index calculation needed in imple menting Fourier transform (FT) algorithms. In [1], the implementa tion of tensor product actions on the CRAY XMP was carried out in detail.