布尔表达式的化简与并行排序网络验证

为设计出能够验证并行排序网络正确性的有效工具,根据0,1]原理和布尔函数的特点和性质,提出一种布尔表达式的化简算法,并根据此算法设计出验证工具.对0,1]原理和布尔函数的特点和性质进行了讨论,指出有利于化简操作的性质.设计出的工具能够根据并行排序网络的参数显示网络图形、自动生成布尔表达式并实现化简验证,工具的输出有利于对排序网络的分析,也可以用于辅助排序网络的设计和优化.实验结果表明了该工具的有效性.

Boolean expression simplification and parallel sort network validation

To design an effective tool that can be used to verify the correctness of a parallel sorting network, a Boolean expression sim-plification algorithm based on the 0,1] theory and Boolean function of the characteristics and the nature is put forward, based on this algorithm a validation tool is designed. The characteristics and the nature of 0,1] theory and Boolean function are discussed and the natures that are helpful to simplify of the operation are pointed out. The tool can be used for the design of parallel sorting networks based on the parameters of the network graphics, and it can automatically generate the Boolean expressions and simplify it. The tool's output will be helpful to analyze the network, and it can also be used to design and optimize the sort network. Finally, the validity of the tool is demonstrated by the application.