1 / 6

Computer Organization

Learn about Karnaugh Maps (K-Maps) and circuit minimization techniques using Sum-of-Products (SOP) and Product-of-Sums (POS) representations. Practice converting between minterms and maxterms. Simplify Boolean expressions using K-Maps. Homework exercises included.

tbarhorst
Download Presentation

Computer Organization

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Computer Organization CSC 405 K-Maps and Circuit Minimization

  2. Note: For those of you who are unfamiliar with the conversions between SOP, POS, minterms and maxterms please work the following exercises as practice. If you have any questions please feel free to ask in class or contact me directly. Sum-of-Products Product-of-Sums minterms Maxterms ABC+AB’C+A’B’C’ (P+Q’+R)(P’+Q+R’) f(x,y,z)=m(0,1,3,4,6) g(a,b,c,d)=M(0,11,15) For each row, use the representation of the Boolean expression given to derive the other representations. Some representations will be too large to fit conveniently in the table.

  3. Karnaugh Maps (K-Maps) We will use a K-map to simplify the follwing expression. F(x,y,z) = xy’z’ + x’y’z + xz’ + y’z + x’ First we note that there are three variables in the expression F( ), therefore our K-map will have 23=8 cells. Next we decide where each variable will be represented. yz x

  4. yz 00 01 11 10 x 0 1 yz 00 01 11 10 x 1 1 1 1 0 1 1 1 1 Now we arrange the literal values for x,y and z so that binary vectors that are next to each other differ by only one bit. In other words we make sure that logically adjacent vectors are also physically adjacent. Now we place ones (true values) into the K-map to show which binary vectors satisfiy the expression F( ). F(x,y,z) = xy’z’ + x’y’z + xz’ + y’z + x’ 100 001 1-0 100 110 -01 001 101 0-- 000 001 010 011

  5. yz yz yz 00 01 11 10 00 01 11 10 00 01 11 10 x x x 1 1 1 1 1 1 1 1 1 1 1 1 0 1 0 1 0 1 1 1 1 1 1 1 1 1 1 Now we find the smallest number of the largest rectangular patterns of 1’s whose sizes are integer powers of two. (Weird) That is the length of a selected rectangle of ones must be of length 1,2,4,. . .,2n. Of course in this case 4 is the limit. We must choose a set of these rectangles such that every 1 is in at least one of the rectangles. Here are a few candidates. In each case we have contained all the 1’s in three rectangles of the required dimensions. The middle case is better because it uses larger patterns. Finally we convert these pattern back into terms in the simplified expression for F( ). F(x,y,z) = x’ + y’ + z’

  6. Homework: Test your understanding of K-Map circuit simplification by reducing the following expressions to their minimal forms (minimum number of gates). 1. F(x,y,z) = m(1,3,5,7) 2. G(x,y,z) = m(0,1,2,3) 3. H(p,q,r,s) = m(0,2,5,7,8,10,13,15) 4. J(w,x,y,z) = M(5,7,13,15)

More Related