Fast algorithms between arithmetic and Hadamard-Haar transforms

The mutual relationships between Hadamard-Haar and arithmetic transforms and their corresponding spectra in the form of matrix decomposition as layered vertical and horizontal Kronecker matrices are discussed here together with their fast algorithms. The new relations apply to an arbitrary dimension of the transform matrices and allow performing direct conversions between Arithmetic and Hadamard-Haar functions and their corresponding spectra. In addition, analysis of butterfly diagrams for these new relations is also introduced and it is shown that they are more efficient than the matrix decomposition method.