ABSTRACT
In this chapter, the general algorithm of calculation of the n-dimensional (n > 2) transforms that are revealed by the certain irreducible coverings a of n-dimensional domain X is considered. The interconnection between the cardinality of each of such a covering a and the number of splitting one-dimensional discrete transforms is described. The construction of the irreducible covering a for different sizes of X is given. Applications of the algorithm, for calculating the class of the transforms (Dn;<r) that result in tensor representations, are considered. The effective proce dures of computation of two-dimensional Fourier, Hartley, and Hadamard trans forms are described in detail.
