Welcome to EDAboard.com

Welcome to our site! EDAboard.com is an international Electronic Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.

Register Log in

How to get simplest logic term(least gate count)?

Status
Not open for further replies.

dsp_

Member level 3
Joined
Mar 2, 2002
Messages
58
Helped
3
Reputation
6
Reaction score
0
Trophy points
1,286
Location
right here ... right now ...
Activity points
525
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_
 

Status
Not open for further replies.
Toggle Sidebar

Part and Inventory Search

Welcome to EDABoard.com

Sponsor

Top