On the minimization of SOPs for bi-decomposable functions
Loading...
Authors
Sasao, Tsutomu
Butler, Jon T.
Subjects
Advisors
Date of Issue
2001
Date
January 30 - Februaray 2, 2001
Publisher
Language
Abstract
A function f is AND bi-decomposable if it can be written as f (X1;X2) = h1(X1)h2(X2). In this case, a sum-ofproducts expression (SOP) for f is obtained from minimum SOPs (MSOP) for h1 and h2 by applying the law of distributivity. If the result is an MSOP, then the complexity of minimization is reduced. However, the application of the law of distributivity to MSOPs for h1 and h2 does not always produce an MSOP for f . We show an incompletely specified function of n(nô 1) variables that requires at most n products in an MSOP, while 2nô 1 products are required by minimizing the component functions separately. We introduce a new class of logic functions, called orthodox functions, where the application of the law of distributivity to MSOPs for component functions of f always produces an MSOP for f . We show that orthodox functions include all functions with three or fewer variables, all symmetric functions, all unate functions, many benchmark functions, and few random functions with many variables.
Type
Article
Description
Asia and South Pacific Design Automation Conference (ASP-DAC'2001), Jan. 30-Feb. 2, 2001, Yokohama, Japan, pp.219-224.
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. As such, it is in the public domain, and under the provisions of Title 17, United States Code, Section 105, may not be copyrighted.
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. As such, it is in the public domain, and under the provisions of Title 17, United States Code, Section 105, may not be copyrighted.
Series/Report No
Department
Department of Electrical and Computer Engineering
Organization
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
Asia and South Pacific Design Automation Conference (ASP-DAC'2001), Jan. 30-Feb. 2, 2001, Yokohama, Japan, pp.219-224.