• Wrong document? Swap it for free
  • Written by students who passed
  • Immediately available after payment
  • Read online or as PDF
Sell
Where do you study
Your language
Document preview thumbnail
Preview 4 out of 36 pages
Presentation

Fundamentals of Karnaugh Maps and Boolean Function Simplification

Document preview thumbnail
Preview 4 out of 36 pages

This document provides a foundational guide to Chapter 4 of the ELE1300 course, establishing the core principles of using Karnaugh maps (K-maps) for logic circuit optimization. The chapter covers Gray Code & Map Formatting, including Gray Code properties, where consecutive values differ by only a single bit, and how Gray Code defines the rows and columns of 2-variable, 3-variable, and 4-variable K-maps. It covers Mapping & Simplification Techniques, including converting truth tables and canonical Boolean expressions, Sum of Products (SdP) and Product of Sums (PdS), into K-maps. It also covers grouping adjacent 1s or 0s into rectangular power-of-two sub-cubes, such as 1, 2, 4, 8, and 16, to eliminate redundant variables. It covers Formal Minimization Definitions, including the identification of Implicants, Prime Implicants, and Essential Prime Implicants for both SdP and PdS implementations. It covers Circuit Synthesis, including the direct translation of minimized Boolean expressions into optimal logic gate schematics using standard AND/OR, NAND-only, and NOR-only logic topologies.

Content preview

ELE1300
Circuits
logiques
4. Tables de
Karnaugh simples

,Sommaire du cours

• Connaître et comprendre
• Le format d’une table de Karnaugh
• La correspondance entre la simplification algébrique d’une expression
booléenne et l’utilisation d’une table de Karnaugh
• Être capable de
• Passer d’une table de vérité à une table de Karnaugh et réciproquement.
• Utiliser la table de Karnaugh pour trouver l’implémentation optimale en SdP
ou PdS.




ELE1300 - Circuits logiques 2

,Code de Gray
0 0 0 0 0 • Un « code » différent pour représenter les
1 0 0 0 1 nombres en format binaire.
2 0 0 1 1
3 0 0 1 0
• Propriété: l’incrémentation ou la
4 0 1 1 0
décrémentation du nombre requiert
5 0 1 1 1
toujours la modification d’un seul bit.
6 0 1 0 1
7 0 1 0 0
8 1 1 0 0
9 1 1 0 1
10 1 1 1 1
11 1 1 1 0
12 1 0 1 0
13 1 0 1 1
14 1 0 0 1
15 1 0 0 0

ELE1300 - Circuits logiques 3

, Code de Gray


v2(t) 0 0 0 0 1 1 1 1
t
v1(t) 0 0 1 1 1 1 0 0
t
v0(t) 0 1 1 0 0 1 1 0
t
Nombre observé : 000 001 011 010 110 111 101 100




ELE1300 - Circuits logiques 4

Document information

Study
Uploaded on
October 8, 2026
Number of pages
36
Written in
2026/2027
Type
Presentation
Person
Unknown
$5.50

Wrong document? Swap it for free Within 14 days of purchase and before downloading, you can choose a different document. You can simply spend the amount again.
Written by students who passed
Immediately available after payment
Read online or as PDF

Sold
0
Followers
0
Items
6
Last sold
-



Why students choose Stuvia

Created by fellow students, verified by reviews

Quality you can trust: written by students who passed their tests and reviewed by others who've used these notes.

Didn't get what you expected? Choose another document

No worries! You can instantly pick a different document that better fits what you're looking for.

Pay as you like, start learning right away

No subscription, no commitments. Pay the way you're used to via credit card and download your PDF document instantly.

Student with book image

“Bought, downloaded, and aced it. It really can be that simple.”

Alisha Student

Working on your references?

Create accurate citations in APA, MLA and Harvard with our free citation generator.

Working on your references?

Frequently asked questions