Digital Electronics Boolean Reduction

Click For Summary

Discussion Overview

The discussion revolves around the reduction of a Boolean expression related to a traffic light circuit design in digital electronics. Participants explore methods for simplifying the expression and share their attempts at using Karnaugh maps and logic rules.

Discussion Character

  • Homework-related
  • Debate/contested
  • Exploratory

Main Points Raised

  • One participant claims to have expanded the original equation and found it to be in its simplest form using a Karnaugh map, suggesting that no further reduction is possible.
  • Another participant expresses doubt about the simplification, stating they need to create a circuit with the least number of logic gates and are unsure how to reduce the expression further.
  • A participant mentions writing a Visual Basic program to simulate the logic but also could not find a reduction, expressing curiosity about the reduction logic.
  • Some participants question the certainty of the original formula's reducibility, noting they arrived at the same expression and see no obvious way to simplify it.
  • One suggestion involves using an 8-to-1 multiplexer to potentially reduce the number of gates needed, although this shifts the focus from primitive gates to chip-level reduction.
  • A later reply raises the possibility of additional 'Don't care' conditions that could affect the simplification, indicating that assumptions may need to be rechecked.

Areas of Agreement / Disagreement

Participants do not reach a consensus on whether the Boolean expression can be reduced further. Multiple competing views remain regarding the simplification methods and the certainty of the current form.

Contextual Notes

Participants express uncertainty about the completeness of the original problem and whether any additional conditions might influence the reduction process. There is also mention of limitations in the tools used for simplification, such as the specific types of gates available in simulators.

DethRose
Messages
101
Reaction score
0
Digital Electronics Boolean Reduction! Help Please

Ok i need to figure out how to reduce this I've been working on it for 2 days straight and can't figure it out...please help...its due tommorow :rolleyes: :cry:




[tex](ab)[/tex][tex]([/tex][tex]\overline c + \overline d[/tex][tex])[/tex][tex]+[/tex][tex](a+b)[/tex][tex]([/tex][tex]\overline c \overline d)[/tex]
 
Engineering news on Phys.org
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).
 
it can't 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:
So what was the answer?

DethRose said:
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.

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. :confused:
 
I get the same equation back
 
DethRose said:
So the formula i have at the beginning of the post is what i created after reading the criteria.

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.
 

Attachments

  • Logic.GIF
    Logic.GIF
    2.1 KB · Views: 658
If you use a 8to1 MUX with ABC as the select lines and D as the input then you only need one inverter.
 
Reducing gates or chips?

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

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. :biggrin:

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.
 
Recheck your assumptions.

This is intriguing. Like with the others, a K-Map shows that this is in minimal form as it has been stated to us. The question, however is, "is there anything else? Has anything else been left out? In particular, are there any additional 'Don't care' conditions? These can be important if there are any."

[ BTW: I'm sorry that I've been away from the forum for so long, however I ran into problems switching from a dial-up access to DSL. It was just one problem after another; including even an apparent mother board failure. ]

KM
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
3K
Replies
7
Views
5K
Replies
17
Views
8K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
1
Views
2K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 140 ·
5
Replies
140
Views
7K
  • · Replies 15 ·
Replies
15
Views
4K