Electronics and logic gate question

Click For Summary

Discussion Overview

The discussion revolves around the conversion of truth tables into logic gate representations, specifically focusing on the use of NAND gates. Participants explore methods for expressing Boolean algebra in a circuit format limited to NAND gates, while also considering the flexibility of using NOR gates as an alternative.

Discussion Character

  • Exploratory, Technical explanation, Homework-related

Main Points Raised

  • One participant seeks guidance on how to represent a truth table using only NAND gates, suggesting that a Boolean expression must first be derived and then factored into a suitable form.
  • Another participant mentions that NOR gates can also be used for similar purposes, indicating their flexibility in circuit design.
  • A later reply questions whether the inquiry pertains to a specific application or is merely a classroom problem.

Areas of Agreement / Disagreement

Participants express a shared interest in the topic, but there is no consensus on the specific methods or applications being discussed. Multiple approaches are suggested without resolution on the best path forward.

Contextual Notes

There are limitations regarding the assumptions made about the truth tables and the specific requirements for the circuit design. The discussion does not clarify the mathematical steps involved in the conversion process.

Who May Find This Useful

This discussion may be of interest to students or individuals exploring Boolean algebra, logic gate design, and circuit representation in electronics.

Learnphysics
Messages
92
Reaction score
0
I know this is probably in the wrong board, but.


I'v just been looking into some Boolean algebra to convert truth tables into a set of logic gates representing a circuit.

If i were attempting to represent a certain truth table, but i was limited to ONLY using NAND gates. (their the only one's i can find). How would i go about doing this.

IM assuming i get a boolean expression for the truth table, and then attempt to factorize it into a certain form which uses only NAND gates. BUt I am not exactly sure how to proceed.
 
Engineering news on Phys.org
You can also do this with NOR gates, they are both very flexible.
 
Learnphysics said:
I know this is probably in the wrong board, but.


I'v just been looking into some Boolean algebra to convert truth tables into a set of logic gates representing a circuit.

If i were attempting to represent a certain truth table, but i was limited to ONLY using NAND gates. (their the only one's i can find). How would i go about doing this.

IM assuming i get a boolean expression for the truth table, and then attempt to factorize it into a certain form which uses only NAND gates. BUt I am not exactly sure how to proceed.


Is this for a particular application, or is it a classroom problem?

KM
 

Similar threads

  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 16 ·
Replies
16
Views
5K
  • · Replies 8 ·
Replies
8
Views
9K
  • · Replies 16 ·
Replies
16
Views
3K
  • · Replies 2 ·
Replies
2
Views
7K
  • · Replies 13 ·
Replies
13
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 29 ·
Replies
29
Views
4K
  • · Replies 5 ·
Replies
5
Views
7K
  • · Replies 1 ·
Replies
1
Views
4K