Electronics and logic gate question

Click For Summary
SUMMARY

This discussion focuses on converting truth tables into logic gate representations using only NAND gates. The user seeks guidance on deriving a Boolean expression from a truth table and then factorizing it to utilize solely NAND gates. The conversation highlights the flexibility of NAND and NOR gates in circuit design, emphasizing their capability to represent any Boolean function. Key resources provided include links to HyperPhysics for further understanding of NAND gate applications and De Morgan's Theorems.

PREREQUISITES
  • Understanding of Boolean algebra
  • Familiarity with truth tables
  • Knowledge of NAND gate functionality
  • Basic concepts of digital logic design
NEXT STEPS
  • Study how to derive Boolean expressions from truth tables
  • Learn about NAND gate circuit design techniques
  • Explore De Morgan's Theorems for logic simplification
  • Investigate the use of NOR gates as an alternative to NAND gates
USEFUL FOR

Electronics students, digital circuit designers, and anyone interested in logic gate implementation and Boolean algebra applications.

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
8K
  • · Replies 16 ·
Replies
16
Views
3K
  • · Replies 2 ·
Replies
2
Views
7K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 29 ·
Replies
29
Views
4K
  • · Replies 5 ·
Replies
5
Views
6K
  • · Replies 1 ·
Replies
1
Views
4K