# Digital Electronics Boolean Reduction ! Help Please

1. Dec 12, 2004

### DethRose

Digital Electronics Boolean Reduction!!!!!!!!!!! Help Please

Ok i need to figure out how to reduce this ive been working on it for 2 days straight and cant figure it out...please help...its due tommorow :uhh:

$$(ab)$$$$($$$$\overline c + \overline d$$$$)$$$$+$$$$(a+b)$$$$($$$$\overline c \overline d)$$

2. Dec 12, 2004

### mcfetridges

well good question. I expanded that equation and then threw it in a k-map. I got the exact expanded equation back. I would say that that equation is the simplest form. Hopefully someone can back me up. my kmap was sum of m(4,8,12,13,14).

3. Dec 12, 2004

### DethRose

it cant be the same equation because i was given it for homework like that and have to do a whole project on simplifying it. I need to make the circuit using the least amount of logic gates.

Heres the question i was given in class:

Design a traffic light circuit using the following criteria

1. The light will be green when both lanes A and B are occupied but C and D are not both occupied.
2. The light will be green when either A or B is occupied while C and D are both vacant.

So the formula i have at the beginning of the post is what i created after reading the criteria.

Last edited: Dec 12, 2004
4. Dec 16, 2004

### NeutronStar

I actually wrote a Visual Basic program to simulate your logic in your opening post and it does work as you say. However, I couldn't figure out how to reduce it either.

So now I'm curious what the reduction logic is, and how was it arrived at?

I tried using DeMogan's laws, and various other logic rules but I couldn't reduce it either. Somehow though I have a gut feeling that it can be reduced. So now you have me curious.

5. Dec 16, 2004

### dduardo

Staff Emeritus
I get the same equation back

6. Dec 16, 2004

### NeutronStar

If you created this formula what make you so sure that it can be reduced?

I went over your criteria and came up with the exact same formula. Unusually if there's a way to reduce it I'll notice it at that stage of development. I really can't see any obvious way to reduce it.

I even went to a logic circuit simulator on the web and typed in the logic circuit (see attached figure).

I thought that maybe I could see a way to reduce it by just looking at the circuit but I can't see anything there either.

The NOT gates in my circuit were used simply because the simulator would only provide NAND and NOR gates. So they aren't really a part of the main logic. Also the dual outputs represent the central OR in your formula. I just didn't feel like bothering to put in the additional NOR gate with yet another inverter so I left the two outputs hanging. The circuit works as you describe, but again I can't see any obvious way to reduce it.

#### Attached Files:

• ###### Logic.GIF
File size:
2.1 KB
Views:
235
7. Dec 16, 2004

### dduardo

Staff Emeritus
If you use a 8to1 MUX with ABC as the select lines and D as the input then you only need one inverter.

8. Dec 16, 2004

### NeutronStar

Reducing gates or chips?

Actually I wasn't even thinking in terms of using anything like a multiplexer. I was thinking just in terms of reducing primitive gates. Heck, you can always reduce anything to a single chip if you're willing to use an FPGA or CPLD.

So I wasn't thinking in terms of reducing chips. I was thinking in terms of reducing gates. This is particularly important if you're actually going to be programming FPGAs or CPLDs.

9. Dec 28, 2004