dsp_
Joined: 02 Mar 2002
Posts: 66
Helped: 3
Location: right here ... right now ...
|
 17 Feb 2003 6:44 How to get simplest logic term(least gate count)? |
|
|
|
I learned how to simplify logic terms with one output variable by Karnaugh Veitch-Diagrams or simple boolean algebra in combinatory logic.
But how do I get the leaste gate count solution for for example two output variable which are using the same or part of the same input variables?
is it somehow possible to state a count of components(for example 6 xor's, 2 and's, 1 or) and ask if its possible to solve the problem with it?
exist there programs which are able to do that?
I can't give a concrete example now, but we had someday to do a binary/ 7-segment decoder and I found very much resuable parts.
TIA
dsp_
|
|
