Exercrcise - Chapter 4: Combinational Logic Circuits - Nguyễn Quang Huy

4.1
• Simplify the following expressions using Boolean algebr 
Simplify the circuit using Boolean algebra
•Change each gate to a NOR gate simplif  the circuit using Boolean algebra 
Design the logic circuit
corresponding to the
truth table
• Implement the circuit
using all NAND gates
pdf 13 trang thamphan 30/12/2022 1040
Bạn đang xem tài liệu "Exercrcise - Chapter 4: Combinational Logic Circuits - Nguyễn Quang Huy", để tải tài liệu gốc về máy hãy click vào nút Download ở trên.

File đính kèm:

  • pdfexercrcise_chapter_4_combinational_logic_circuits_nguyen_qua.pdf

Nội dung text: Exercrcise - Chapter 4: Combinational Logic Circuits - Nguyễn Quang Huy

  1. dce 2011 Exercise – Chapter 4 Combinational Logic Circuits BK TP.HCM Nguyễn Quang Huy huynguyen@cse.hcmut.edu.vn
  2. dce 2011 4.2 • Simplify the circuit using Boolean algebra • Change each gate to a NOR gate, and simplify the circuit using Boolean algebra
  3. dce 2011 4.8 • The headlights are on while the ignition is off • The door is open while the ignition is on
  4. dce 2011 4.11 F(A,B,C) = Σ(0,1,4,6) + Σd(5)
  5. dce 2011 4.12 + 4.13 + 4.14 • Simplify the expression using -mapK x A B C= A BC + + ABC + A + B C A B C y AB= C D() + A BD + B C D z C D= A +() C D + A +B C + A B + CD AC D
  6. dce 2011 4.19 • Determine the input conditions needed to produce x = 1 (HIGH)
  7. dce 2011 4.21 • M = 1: two input numbers are equal • N=1:x2x1x0 is greater than y2y1y0 • P=1:y2y1y0 is greater than x2x1x0