chap1(4_in_1)

# chap1(4_in_1) - ELEC151 Digital Circuits and Systems...

This preview shows pages 1–3. Sign up to view the full content.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
ELEC151 Digital Circuits and Systems Ho-Chi Huang, Lecture Notes, No. 1-5 Design Representations – Boolean Equations A 0 0 0 0 1 1 1 1 B 0 0 1 1 0 0 1 1 Cin 0 1 0 1 0 1 0 1 Sum 0 1 1 0 1 0 0 1 Cout 0 0 0 1 0 1 1 1 Sum = A’ B’ Cin + A’ B Cin’ + AB’ Cin’ + A B Cin Cout = A’ B Cin + A B’ Cin + A B Cin’ + A B Cin Two Boolean equations can also represent a full adder. We will learn more about Boolean Algebra in Chapter 2 Two Boolean equations can also represent a full adder. We will learn more about Boolean Algebra in Chapter 2 • Boolean Algebra: another example for full adder ELEC151 Digital Circuits and Systems Ho-Chi Huang, Lecture Notes, No. 1-6 • Laws of Boolean Algebra – Reducing the complexity of Boolean equations • Why Logic Minimization?
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 9

chap1(4_in_1) - ELEC151 Digital Circuits and Systems...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online