DocumentCode
337388
Title
Integer pair representation of binary terms and equations
Author
Díaz, Andrés J. ; Jiménez, Manuel A. ; Strangas, Elias ; Shanblatt, Michael
Author_Institution
Dept. of Electr. & Comput. Eng., Michigan State Univ., East Lansing, MI, USA
fYear
1998
fDate
9-12 Aug 1998
Firstpage
172
Lastpage
175
Abstract
A new format to represent binary terms in a Boolean function, called the Integer Pair Representation (IPR) is proposed. This format uses an ordered pair of integers to compactly represent each cube of a Boolean function written as a sum-of-products in either canonical or non-canonical form. Properties of the representation are discussed and its advantages illustrated in the development of algorithms for minimizing single-output, binary valued Boolean functions
Keywords
Boolean functions; circuit analysis computing; circuit optimisation; digital circuits; Boolean function; binary terms; canonical form; integer pair representation; noncanonical form; single-output binary valued functions; sum-of-products; Boolean functions; Central Processing Unit; Digital circuits; Equations; Input variables; Intellectual property; Logic; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1998. Proceedings. 1998 Midwest Symposium on
Conference_Location
Notre Dame, IN
Print_ISBN
0-8186-8914-5
Type
conf
DOI
10.1109/MWSCAS.1998.759462
Filename
759462
Link To Document