By Topic

An Expanding Products Algorithm of Logic Functions Optimization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)
Qiu Jian-lin ; Sch. of Comput. Sci. & Technol., Nantong Univ., Nantong, China ; Gu Xiang ; Chen Jian-ping ; He Peng
more authors

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.

Published in:

Computer Science and Information Engineering, 2009 WRI World Congress on  (Volume:2 )

Date of Conference:

March 31 2009-April 2 2009