Karnaugh Maps &amp; SOP

# Karnaugh Maps &amp; SOP - Karnaugh Maps SOP Password...

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

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

View Full Document
Two of the problems with using the truth table for function minimization: Address adjacent entries are not necessarily physically adjacent. A B F 0 0 1 0 1 1 1 0 1 1 1 0 Physically adjacent entries are not necessarily address adjacent. Karnaugh Maps & SOP
Q? Easy way to identify adjacent entries? A: Any Boolean cube forms an adjacency grouping. 1-D Cube A F 0 0 1 1 1 Var Fct. Assign vertices addresses & Map 1’s onto Cube A=0 A=1 F=A G 1 1 1-D Cube A=0 A=1 G=1 Identify Boolean cubes with 1’s on every vertex Karnaugh Maps & SOP

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

View Full Document
Q? How do you get a 2-D Cube? A: Connect 2x1-D Boolean Cubes. 2-D Cube A B F 0 0 1 0 1 1 1 0 0 1 1 1 Assign addresses on the cube so that all physically adjacent vertices are address adjacent. (A,B)=(0,0) (0,1) (1,0) (1,1) Map the 1’s of F onto the 2-D Boolean Cube. F=B +A Karnaugh Maps & SOP
Q? How do you get a 3-D Cube? A: Connect 2x2-D Boolean Cubes. Assign addresses on the cube so that all physically adjacent vertices are address adjacent.

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 17

Karnaugh Maps &amp; SOP - Karnaugh Maps SOP Password...

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

View Full Document
Ask a homework question - tutors are online