布尔置换与Costas阵列

Boolean Permutations and Costas Arrays

研究了通信系统中重要的Castas阵列。给出一种简洁的证明一般布尔代数上的布尔置换的充要条件的方法,并依此给出了一类Costas阵列。

Using Costas arrays can most precisely ascertain the objective distance and the deviation speed which are introduced by J. costas in 1966. In this paper, we give the sufficient and necessary conditions of Boolean Permutation over a Boolean algebra, and therefore we give a classes of Costas arrays.