Fast block inverse jacket transform

One-dimensional and two-dimensional fast algorithms for realizing the block inverse jacket transform with size of N=2/sup k/ and 3/sup k/ are proposed. The fast algorithms are based on sparse matrix factorization of the block inverse jacket matrix and recursive form of the Kronecker products of identity matrices and successively lower-order block inverse jacket matrices.