By Topic

Integer pair representation of binary terms and equations

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

4 Author(s)
Diaz, A.J. ; Dept. of Electr. & Comput. Eng., Michigan State Univ., East Lansing, MI, USA ; Jimenez, M.A. ; Strangas, E. ; Shanblatt, M.

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

Published in:

Circuits and Systems, 1998. Proceedings. 1998 Midwest Symposium on

Date of Conference:

9-12 Aug 1998