Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Class Notes on K-Map Technique for Digital Circuit Design, Lecture notes of Digital Systems Design

These class notes by dr. Frank x. Li cover the k-map method for simplifying boolean expressions in ecen 3733 digital circuit design. The notes explain the concept of k-map, its visual representation, and the process of determining prime implicants and minimum expressions. The notes also mention the concept of essential prime implicants and don't care minterms.

Typology: Lecture notes

2016/2017

Uploaded on 10/19/2017

pkmaurer
pkmaurer 🇺🇸

7 documents

1 / 5

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
1
Class note #3
By Dr. Frank X. Li
ECEN 3733 Digital Circuit
Design
Minterm
pf3
pf4
pf5

Partial preview of the text

Download Class Notes on K-Map Technique for Digital Circuit Design and more Lecture notes Digital Systems Design in PDF only on Docsity!

Class note

By Dr. Frank X. Li

ECEN 3733 Digital Circuit

Design

Minterm

K-Map

  • K-Map is a systematic approach for simplify Boolean Expressions.
  • K-Map can be used up to 5 input variables. Maximum of 6 input variables are used in practice.
  • K-Map is a visual representation of a truth table.
  • Expressions in K-maps are most commonly expressed in sum of products form.
  • Adjacent 1’s can be “paired off” n  Reductions in the expressions, pairs may be adjacent horizontally or vertically 2 - variable K-Map

Prime Implicants Determination of Minimum Expressions

Essential Prime Implicants Don’t Care Minterms