Skip to Main Content
Jacket matrices motivated by the center weight Hadamard matrices have played important roles in signal processing, communication, image compression, cryptography, etc. In this paper we propose a notation called block Jacket matrix which substitutes elements of the matrix into common matrices or even block matrices. Employing the well-known Pauli matrices which are very important in many subjects, block Jacket matrices with any size are investigated in detail, and some recursive relations for fast construction of the block Jacket matrices are obtained. Based on the general recursive relations, several special block Jacket matrices are constructed. To decompose high order block Jacket matrices, a fast decomposition algorithm for the factorable block Jacket matrices is suggested. After that some properties of the block Jacket matrices are investigated. Finally, several remarks are presented. These remarks are associated with comparisons between the Clifford algebra and the block Jacket matrices, generations of orthogonal and quasi-orthogonal sequences, and relations of the block Jacket matrices to the orthogonal transforms for signal processing. Since the Pauli matrices are actually infinitesimal generators of SU(2) group, the proposed construction and decomposition algorithms for the block Jacket matrices are available in the signal processing, communication, quantum signal processing and information theory.