A new reverse jacket transform and its fast algorithm
Moon Ho Lee · IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing · 2000
This paper presents the reverse jacket transform [RJT] and a simple decomposition of its matrix, which is used to develop a fast algorithm for the RJT. The matrix decomposition is of the form of the matrix products of Hadamard matrices and successively lower order coefficient matrices. This decomposition very clearly leads to a block circular sparse matrix factorization of the reverse jacket [RJ]/sub N/ matrix. The main property of [RJ]/sub N/ is that the inverse matrices of its elements can be obtained very easily and have a special structure. [RJ]/sub N/ is derived using the weighted Hadamard transform corresponding to the Hadamard matrix [H]/sub N/ and a basic symmetric matrix /spl Lambda/. Each element of [RJ]/sub N/ is a generalized for polygonal subsampling and canonical Smith form. In this paper we represent in particular the systematical block-wise sparse matrix of extending-method for [RJ]/sub N/.