Integer pair representation of binary terms and equations

Integer pair representation of binary terms and equations

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. Properti...

Full description

Saved in:
Bibliographic Details
Published in:1998 Midwest Symposium on Circuits and Systems (Cat. No. 98CB36268) pp. 172 - 175
Main Authors: Diaz, A.J., Jimenez, M.A., Strangas, E., Shanblatt, M.
Format: Conference Proceeding
Language:English
Published: IEEE 1998
Subjects:
Boolean functions
Central Processing Unit
Digital circuits
Equations
Input variables
Intellectual property
Logic
Testing
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISBN:9780818689147
0818689145
DOI:10.1109/MWSCAS.1998.759462