Generalization of arithmetic-Haar transform for higher dimensions

In this article, we extended arithmetic-Haar transform from the first eight functions (n=3) to higher values of n. The new recursive relations are given in the form of layered Kronecker matrices and hence they have fast transforms and are computationally advantageous. As the new generalized arithmetic-Haar transform has a structure similar to that of the Haar and arithmetic transform matrices, computational advantage of these two transforms is held in the expanded transform as well.