Fast transform algorithms representation by Kronecker product

Abstract

The Kronecker products decomposition of discrete unitary transforms and a class of fast nonlinear transforms is presented. A useful formalism for fast transform representation that can be generated by using a single recursion formula based on Kronecker notation is described.<>