Two-level NAND circuits plus ROM?

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

The discussion focuses on implementing three Boolean functions, X, Y, and Z, using two-level NAND circuits and ROM. The functions are defined for four variables, A, B, C, and D, with specific minterms provided for each function. The optimal implementation of X using two-level NAND gates can be achieved with 10 gates through sharing, while the functions can also be implemented using a ROM. The equations for X, Y, and Z are provided in Sum of Products (SOP) form, facilitating further implementation using NAND gates.

PREREQUISITES
  • Understanding of Boolean algebra and logic functions
  • Familiarity with two-level NAND gate circuit design
  • Knowledge of ROM implementation for logic functions
  • Experience with Sum of Products (SOP) expressions
NEXT STEPS
  • Learn how to implement Boolean functions using two-level NAND circuits
  • Study the design and application of ROM in digital circuits
  • Explore the conversion of SOP expressions to NAND gate configurations
  • Investigate the use of decoders in logic circuit design
USEFUL FOR

Digital circuit designers, electrical engineering students, and anyone interested in optimizing logic circuit implementations using NAND gates and ROM.

asdf12312
Messages
198
Reaction score
1
two-level NAND circuits plus ROM??

Homework Statement


Code:
We have three functions, X, Y, Z of the four variables, A, B, C, D. Note: Each part can be solved without the other:

X(A, B, C, D)= m(0,2,6,7,10,13,14,15)
Y(A, B, C, D) = m(2, 6, 7, 8, 10, 12, 13, 15)
Z(A, B, C, D) = m(0, 6, 8, 10, 13, 14, 15)

a. Implement with a two-level NAND gate circuit. This can be done using only prime implicants of the individual functions with 13 gates. With sharing, it can be done with 10 gates. Assume that all variables are available both complemented and uncomplemented.

b. Implement these functions using a ROM.

c. Implement this with 2 three-input (plus active low enable) decoders as shown here, plus a minimum number of AND, OR, and NOT gates.
T.T

solved the equations. (SOP)
X = A' B' D' + C D' + A B D + B C
Y = A C' D' + A B D + A' B C + B' C D' or
Z = B' C' D' + A B D + B C D' + A B' D'

what to do with this.
 
Last edited:
Physics news on Phys.org
asdf12312 said:
solved the equations. (SOP)
X = A' B' D' + C D' + A B D + B C
Y = A C' D' + A B D + A' B C + B' C D' or
Z = B' C' D' + A B D + B C D' + A B' D'

what to do with this.
Assuming these are correct, I guess you now implement X using 2-input NAND gates and signals A,B,C and D. (I think it means you also have A', B', etc. available and don't need to waste a gate to generate these yourself.) You'll first replace the ORs with NANDs.

I can't help with b or c.
 

Similar threads

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