﻿ Examples for 3 variable K-map.
Custom Search
Chip Designing for ASIC/ FPGA Design engineers and Students
FULLCHIPDESIGN
Digital-logic Design...  Dream for many students… start learning front-end…
@TYH :- 4G LTE Long Term Evolution Tutorial, CloudComputing
Get Noticed:- Submit your own content to be published on fullchipdesign.com

Send it to fullchip@gmail.com

Binary Numbers 1s_complement 2s_complement Binary Subtraction Binary Sub. Ex's Sign_magnitude SignM EX Gray Coding BCD coding Digital gates NAND NOR & XNOR Theorems Boolean Functions BFunc Examples Minterm Maxterm Sum of Minterms Prdt of Maxterms 2 var K-map 3 var K-map 4 var K-map 5 var K-map Prime Implicant PI example K-map Ex's KMap minimization 2 var EX

3 variable K-map - Examples

Minimize following function.

F(x,y,z) =     (0,1,6,7)

Above is a common format of representing the K-map problems. The numbers 0,1,6,7 are the location of cells in the 3-var k-map table discussed below.  3 variable K– map with 1 and 0 values assigned to cells is shown in table below.

00

01

4

5

11

10

7

6

x’y’z’ = 1

x’y’z = 1

x’yz = 0

x’yz’ = 0

xy’z’ = 0

xy’z = 0

Xyz = 1

xyz’ = 1

0

1

x

yz

Any adjacent 2, 4 or 8 cells can be grouped to find a minimized logic value. Following plot will show grouping of adjacent cells.

00

01

4

5

11

10

7

6

x’y’z’ = 1

x’y’z = 1

x’yz = 0

x’yz’ = 0

xy’z’ = 0

xy’z = 0

Xyz = 1

xyz’ = 1

0

1

x

yz

F = x’y’(z+z’) + xy(z+z’)
F= x’y’ + xy .. Final Answer.
Resources
Clock Domain Crossing
rtl & testbench example.
Rate change (asynchronous) FIFO design and fifo depth calculation.