﻿ 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.
RTL coding guidelines. ICG cell, \$assertkill Digital design Interview questions.
FPGA Interview. FPGA flow. Graduate studies in US. Pipeline vs. Parallel processing.
1. F(x,y,z) =     (0,1,6,7) - Minimization, discussed on this page.
2. F(x,y,z) =     (0,1,4,5,6,7) - Access minimization from here.
3. F(x,y,z) =     (3,4,6,7) - Access minimization from here.
4. F(x,y,z) =     (0,1,2,3,4,5,6,7) - Access minimization from here.
Following list of functions are minimized using 3 var K-map’s.
The K-map for 3 variables is plotted above. You will notice the column for 11 and 10 is inter-changed. This is done to allow only one variable to change across adjacent cells. This adjustment in columns allows in minimization of logic mapped into tables.
The two step minimization equation is shown below.
With reference to the table above the cells under the dotted box’s can be combined to come-up with following reduced  equation.
Interview Questions. Main, FPGA, Digital Fundamentals
LTE - Long Term Evolution topics
Cloud Computing ? Whenever a document or photo is uploaded on the web, a thread of cloud computing is active. Learn more from here.