Permutation and Complementary Algorithm to Generate Random Sequences for Binary Logic
Permutation and Complementary Algorithm to Generate Random Sequences for Binary Logic作者机构:School of Software Yunnan University Kunming China
出 版 物:《International Journal of Communications, Network and System Sciences》 (通讯、网络与系统学国际期刊(英文))
年 卷 期:2011年第4卷第5期
页 面:345-350页
学科分类:07[理学] 0701[理学-数学] 070101[理学-基础数学]
主 题:Logic Function Permutation and Complementary Variant Logic Symmetric Distribution Random Sequence
摘 要: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.