Permutation and Complementary Algorithm to Generate Random Sequences for Binary Logic

摘要

Randomness number generation plays a key role in network, information security and IT applications. In this paper, a permutation and complementary algorithm is proposed to use vector complementary and permuta-tion operations to extend n-variable Logic function space from 22n functions to 22n * 2n! configurations for variant logic framework. Each configuration contains 2n functions can be shown in a 22n-1*22n-1 matrix. A set of visual results can be represented by their symmetric properties in W, F and C codes respec-tively to provide the essential support on the variant logic framework.