Building a logical gate function with NAND gates only

Click For Summary

Discussion Overview

The discussion revolves around constructing a logical gate function using only NAND gates. Participants explore the methodology of building circuits, the use of different input configurations for NAND gates, and the potential for simplifying expressions before implementation.

Discussion Character

  • Exploratory
  • Technical explanation
  • Debate/contested
  • Mathematical reasoning

Main Points Raised

  • Some participants emphasize that each NAND gate typically has two inputs, while others note that three-input NAND gates are permissible unless specified otherwise.
  • There is a discussion about the representation of NAND gates in diagrams, with some participants questioning the accuracy of the symbols used.
  • One participant expresses uncertainty about whether their intended output was correctly represented, leading to a broader inquiry about the approach to building the circuit—whether through experience or systematic methods like truth tables.
  • Some participants suggest working backward from the desired output to construct the necessary gates, while others highlight the importance of verifying results and simplifying expressions before implementation.
  • There are mentions of potential mistakes in the initial expressions and the need for clarity in the construction process.

Areas of Agreement / Disagreement

Participants generally agree on the use of NAND gates and the importance of methodical approaches, but there are competing views on the best methods for constructing the circuit and whether simplification is necessary before implementation. The discussion remains unresolved regarding the optimal approach.

Contextual Notes

Participants express uncertainty about the correctness of their expressions and the representation of NAND gates, indicating potential limitations in understanding or communicating the circuit design.

Physics news on Phys.org
No exaggeration. :smile:
Building a circuit from NAND gates does require a lot of gates.But shouldn't each NAND gate have exactly 2 inputs?
Like this:
120px-NAND_ANSI_Labelled.svg.png

And you appear to have drawn a thin rectangle before each NAND gate.
What does that represent?

Did you perhaps intend something like:
120px-NOT_from_NAND.svg.png

Since this is the way to construct a NOT gate from a NAND gate.
 
Last edited:
Let's zoom in on the second sets of inputs for a minute:

attachment.php?attachmentid=43808&stc=1&d=1329049299.jpg


The first NAND gate has the output ##\overline{AD}##.

And the second NAND gate has the output ##\overline{\overline{AD} C} = AD + \overline{C}##.Is that what you intended?
Or did you really want ##A\overline{C}D=AD\overline{C}##?
 

Attachments

  • nandgates1.jpg
    nandgates1.jpg
    9.2 KB · Views: 4,158
I like Serena said:
No exaggeration. :smile:

But shouldn't each NAND gate have exactly 2 inputs?
Like this:
120px-NAND_ANSI_Labelled.svg.png

3 input NAND Gates are allowed and often used. Unless the question specified using 2-input gates, but it doesn't appear so.
 
Yes, Quabache is right we're allowed to use 3 inputs, though 1 input probably not...

And you appear to have drawn a thin rectangle before each NAND gate.
What does that represent?

You're right-- I'm not sure where I've seen it, but I can see that you're right (as per usual), that's not the sign for a NAND gate.

Is that what you intended?
I intended to try and get the answer for the question but if there's a + C then I made a mistake it appears. What I really wanted is what you wrote at the end of that post. Is it all about just trying to build it via experience or is it about building a truth table and doing it methodically and schematically in a straightforward fashion?
 
Femme_physics said:
I intended to try and get the answer for the question but if there's a + C then I made a mistake it appears. What I really wanted is what you wrote at the end of that post. Is it all about just trying to build it via experience or is it about building a truth table and doing it methodically and schematically in a straightforward fashion?

Whatever works for you.
Systematic and methodical is good. :)On the wiki page for NAND logic, they give a couple of building blocks to create the various logic operations:
http://en.wikipedia.org/wiki/NAND_logic
With it you can build up your schematic.
Myself I like to work backward as follows.

You know you want to end up with ##AD\overline{C}##.
Last thing in a NAND gate is the NOT.
So before the NOT, you want to have ##\overline{AD\overline{C}}=\overline{AD} + C##.
But you can't make an OR directly from an NAND gate, so first you would use a NAND as a NOT gate.

Working backward you would have the 3 inputs ##A##, ##D##, and ##\overline{C}## for a first NAND gate, followed by the NOT construction.

You're left with only constructing ##\overline{C}## and I think you already know how. ;)
 
Last edited:
Whatever works for you.
Systematic and methodical is good. :)

But that's the question. Is there another method, or is this all about trial and error?

On the wiki page for NAND logic, they give a couple of building blocks to create the various logic operations:
http://en.wikipedia.org/wiki/NAND_logic
With it you can build up your schematic.

Yes, thanks, I've used a similar page trying to do this :) I'll give it another go
 
I have the impression you were following a proper method.
Verifying your result showed a little mistake however. ;)
I'm sure you'll get it.
 
Look at what happens if you factor the ##A\overline B C## out of the last two terms before you draw the circuit.
 
  • #10
There is a lot of redundancy here. The expression can be simplified before you start to implement it using gates. LCKurtz gave you a hint, which raises the question in my mind: are you certain that you have correctly reproduced the expression that you are realizing with gates?
 
  • #12
Method looks right.
 
  • #13
Femme_physics said:
I understand what you mean-- and I think I got it

Very good! You got it!
And very creative to put a double bar over it and break it up! :smile:
I also like how clearly you explained what you did and how you showed a nice simple solution.

This time around there appear to be no beetles scurrying away. ;)
 
Last edited:
  • #14
LOL

Thanks for the help ILS, everyon. Glad I got it right.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 2 ·
Replies
2
Views
6K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
10
Views
4K
  • · Replies 3 ·
Replies
3
Views
28K