An Expanding Products Algorithm of Logic Functions Optimization

This paper presents an expanding products algorithm of logic optimization that is based on multi-input multi-output logic functions. According to input products, we work out complement sets matrix of non-shared products, blocking matrix, covering matrix. For blocking matrix and covering matrix, we get mini column cover sets and upgrade sets based on choice algorithm of mini column cover. Then we form product express after input product that be expanded. For multi-input multi-output logic functions of two-level SOP, we design a program. Max-input variables is 128, max-output variables is 256, sum of max-input-output variables is 300, max-input products is 20000. It overpasses testing of benchmark.