After the circuit for perfect shuffle permutation matrices is finished,the unitary matrices for Harr functions are decomposed into a sequence of W-H and perfect shuffle permutation matrices,based on the generalized Kronecker product.

Application on algorithm of permutation matrix in rough set attribute reduction

In this paper, necessary and sufficient condition for logical relation equations in undetermined problem having solutions and the other for logical relation equations having unique solution were obtained,and solving logical relation equations werechanged to solving some logicalrelation equations whose each cofficient matrix is a permutation matrix,th with probable situation.

There is based on the inertias of some permutation matrix with zero diagonal entries,and utilizes the corresponding algebra fundamental principles and methods,combined with the thoughts of combinatorics.

We determine the Kronecker product of two square matrices is the permutation matrices of the necessary and sufficient condition through the characters of permutation matrices.

This paper designs a kind of circulant-shift permutation matrix called Q matrix,replacing identity matrix I as partitioned matrix,which fills in parity-check matrix H to form irregular QC-LDPC codes,based on the integration of 4G and WiMAX in technology.