Heuristic minimization of Boolean relations using testing techniques

4 December 2002

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

p. 277-281
https://doi.org/10.1109/iccd.1990.130226

Abstract

Minimization of Boolean relations is important from the point of view of synthesis, especially in synthesis for testability. A very fast heuristic procedure for finding an optimal sum-of-products representation for a Boolean relation is described. Starting with a function compatible with the relation, a process of iterative logic improvement based on test generation techniques is used to derive a minimal function compatible with the Boolean relation.

Keywords

This publication has 6 references indexed in Scilit:

An exact minimizer for Boolean relations
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
Irredundant sequential machines via optimal logic synthesis
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1990
SOCRATES: a highly efficient automatic test pattern generation system
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1988
Logic Minimization Algorithms for VLSI Synthesis
Published by Springer Nature ,1984
On the Acceleration of Test Generation Algorithms
IEEE Transactions on Computers, 1983
An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits
IEEE Transactions on Computers, 1981