Orthogonal matrix based on Greedy algorithm and secure communication
Zhang Qian-ru · Electronic Design Engineering · 2011
This paper proposed the method of using the Greedy algorithm to generate the orthogonal matrix or Similar orthogonal matrix.First,it built the model,and simulated it.By counting the number of orthogonal matrix or Similar orthogonal matrix when r is constant,it analyzed the characteristics of these matrixes,such as uniqueness,balance,orthogonality and the number of matrix when r changed.Next,based on this,this paper analyzed application of the method in secure communication to illustrate the feasibility and practicality of the matrix.Compared with walsh matrix,the size and quantity of this matrix have many advantages.So,it provides more key sequences for secure communication.