Conversion to NAND and NOR circuits

  • Context: Engineering 
  • Thread starter Thread starter Mo
  • Start date Start date
  • Tags Tags
    Circuits
Click For Summary
SUMMARY

The discussion focuses on converting circuits to NAND and NOR forms using de Morgan's Laws. Participants explore techniques for implementing logic gates, specifically NOT, AND, and OR gates, to achieve the desired circuit configurations. The initial solution provided was CD + Not(A+B+C+D), and further clarification was sought on using 2-input NAND and NOR gates effectively. The conversation emphasizes the importance of understanding canonical logic forms and the application of de Morgan's Laws in circuit design.

PREREQUISITES
  • Understanding of Boolean algebra and logic gates
  • Familiarity with de Morgan's Laws
  • Knowledge of circuit design principles
  • Experience with NAND and NOR gate configurations
NEXT STEPS
  • Study the implementation of 2-input NAND and NOR gates in circuit design
  • Learn about canonical forms in Boolean algebra, including minterms and maxterms
  • Explore Karnaugh maps for simplifying Boolean expressions
  • Research techniques for converting complex circuits using de Morgan's Laws
USEFUL FOR

Students and professionals in electrical engineering, circuit design, and computer science who are looking to deepen their understanding of logic gate implementations and Boolean algebra.

Mo
Messages
81
Reaction score
0

Homework Statement


Please see the attatched picture.


Homework Equations





The Attempt at a Solution



I can complete the first part of the question, but i am not sure how i should do the second part.

I would be grateful for a quick explanation or tutorial in how to do this part. I am aware of de Morgan's laws but can't seem to fully apply them to convert a whole circuit.

Im not looking for an explicit answer, I am looking for a technique in how to solve the problem.

Thanks.
 

Attachments

  • question.JPG
    question.JPG
    22 KB · Views: 854
Physics news on Phys.org
Tell us what deMorgan's Laws are, and include an example or two.

Then please show us the solution that you got for the first part, and describe how you would implement it as written with NOT, AND and OR gates.

Then we can talk about how to use deMorgan's Laws to convert to the other form of the circuit...
 
de Morgan's laws tell us how an AND can be converted to an OR.

Not (A.B.C) = NotA + NotB + NotC
Not (A+B+C) = NotA. NotB. NotC
e.g : Not A+B = NotA . NotB

For the first part i got:
CD + Not(A+B+C+D)

To get this i combined some of the expressions, then finally used demorgan's law as stated above.

and describe how you would implement it as written with NOT, AND and OR gates.
:confused:

A + B = Not (Not A . Not B)
A . B = Not (Not A + Not B)

Umm not quite sure if this is correct, or if its what you want!

Thanks for your help so far.
 
I guess I was looking for the implementation in gates, for the final part of the problem.
 
We would have 4 input A B C D.

We have a connection from both C and D to an AND gate (which is the CD part)

We also have a connection from all A B C D to a NOR gate. (which is the NOT A+B+C+D part)

Output from these two gates are then connected to an OR gate.
 
Remember, it said 2-input NAND and NOR gates, so you can't use a 4-input NOR for (A+B+C+D)
 
In that case i think it would be possible to, applying de Morgan's laws, split up this 4 input NOR gate into two, 2 input NOR gates AND 'ed together.

NOT (A + B) . NOT (C + D)

The output of this would be equal to the 4 input NOR gate.

Regards.
 
That's pretty cool. I was thinking of the brute force way of using the 2-input NAND as an inverter (hook both inputs together), but your way is more creative and fewer gate delays.
 
First of all, thanks for your help so far, secondly ... how would I go about tackling those next two parts of the question! It's mainly a case of getting the boolean expression into the correct form. (which I am lost in!)

Regards,
Mo
 
  • #10
Sorry, I have to bail from work now. I may be back online later tonight at home, but I'm not sure.

To try to help you more, I googled +minterm +maxterm +nand +nor, and got lots of good hits. Here's one that talks a lot about how to handle the two canonical logic forms (NAND and NOR), along with examples from K-maps to logic gate diagrams. Hope it helps:

http://www.vias.org/feee/karnaugh_09.html

Cheers.
 
  • #11
Thanks for the link and all your help. :approve: Good night.
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 14 ·
Replies
14
Views
4K
  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 7 ·
Replies
7
Views
8K