NobleBlocks
Public

Boolean factorization using multiple-valued minimization

Published in International Conference on Computer Aided Design • Nov 7, 1993
NobleIDNI9P00W77R58S04
Authors:
Stan Liao
,
Srinivas Devadas
,
Abhijit Ghosh

Abstract

We show that the problem of factoring a sum-of-products representation of a logic function can be transformed into one of multiple-valued prime generation followed by branch-and-bound covering. We give a factorization method that generates potential Boolean factors by generating the primes of a mult...

Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!