Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Explain how \({\bf{K}}\)-maps can be used to simplify product-of-sums expansions in three variables. (Hint: Mark with a\(0\) all the max-terms in an expansion and combine blocks of maxterms.)

Short Answer

Expert verified

Place a \(0\) in the table for every given maxterm (sum) in the expansion in the corresponding cell.

Combine squares to produce larger blocks

Simplification isthe product of the maxterms corresponding to the largest blocks and such that each term of the initial expansion occurs in one of the maxterms.

Step by step solution

01

Step 1:Definition

A product sum expansion, or disjunctive normal form, of a Boolean function is the function written as a sum of minterms. The product of the expression sum results from the fact that two or more sums (OR) are added (AND). That is the outputs from two or more OR gates are connected to the input of an AND gate so that they are effectively AND'ed together to create the final (OR AND) output.

02

Using the sum-of-products and products-of-sum

Sum-of-products expansions:

A \({\bf{K}}\)-map for a function in three variables is a table with four columns \({\bf{yz, y\bar z,\bar y\bar z}}\) and \({\bf{\bar yz}}\); which contains all possible combinations of \({\bf{y}}\) and \({\bf{z}}\)and two rows \({\bf{x}}\) and \({\bf{\bar x}}\).

Product-of-sums expansions:

Use the same \({\bf{K}}\)-map as for the sum-of-products expansions, except that we replace the products in the column titles by sums thus \({\bf{yz}}\) is replaced by \({\bf{y + z,y\bar z}}\) is replaced by \({\bf{y + \bar z,\bar y\bar z}}\) is replaced by \({\bf{\bar y + \bar z,\bar yz}}\) is replaced by \({\bf{\bar y + z}}\)

03

Placing values in the table

Place a \({\bf{0}}\) in the table for every given maxterm (sum) in the expansion in the corresponding cell.

For example, if the expansion contains \({\bf{x + y + z}}\), then we place a \({\bf{0}}\) in the cell in the row \({\bf{x}}\) and column \({\bf{yz}}\).

Combine squares to produce larger blocks.

The product of the maxterms corresponding to the largest blocks and such that each term of the initial development is found in one of the maxterms.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

How many different Boolean functions \(F(x,y,z)\) are there such that \(F(\bar x,\bar y,\bar z){\bf{ = }}F(x,y,z)\) for all values of the Boolean variables \(x,y\) and \(z\)\(?\)

Find the sum-of-products expansion of the Boolean function\({\bf{F}}\left( {{\bf{w, x, y, z}}} \right)\) that has the value 1 if and only if an odd number of w, x, y, and z have the value 1.

Construct a multiplexer using AND gates, OR gates, andinverters that has as input the four bits\({{\bf{x}}_{\bf{o}}}{\bf{,}}{{\bf{x}}_{\bf{1}}}{\bf{,}}{{\bf{x}}_{\bf{2}}}{\bf{,}}{{\bf{x}}_{\bf{3}}}\)and the two control bits\({{\bf{c}}_{\bf{o}}}\)and\({{\bf{c}}_{\bf{1}}}\). Set up the circuit so that\({{\bf{x}}_{\bf{i}}}\)is the output, where iis the value of the two-bit integer\({{\bf{(}}{{\bf{c}}_{\bf{1}}}{{\bf{c}}_{\bf{o}}}{\bf{)}}_{\bf{2}}}\).The depthof a combinatorial circuit can be defined by specifyingthat the depth of the initial input is 0 and if a gate has ndifferent inputs at depths\({{\bf{d}}_{\bf{1}}}{\bf{,}}{{\bf{d}}_{\bf{2}}}{\bf{,}}.....{\bf{,}}{{\bf{d}}_{\bf{n}}}\),respectively, then its outputs have depth equal to max\({\bf{(}}{{\bf{d}}_{\bf{1}}}{\bf{,}}{{\bf{d}}_{\bf{2}}}{\bf{,}}.....{\bf{,}}{{\bf{d}}_{\bf{n}}}{\bf{) + 1}}\); this value is also defined to be the depth of the gate. The depth of a combinatorial circuit is the maximum depth of the gates in the circuit.

In Exercises 1โ€“5 find the output of the given circuit.

\({\bf{a)}}\)Explain how \({\bf{K}}\)-maps can be used to simplify sum-of products expansions in four Boolean variables.

\({\bf{b)}}\)Use a \({\bf{K}}\)-map to simplify the sum-of-products expansion \({\bf{wxyz + wxy\bar z + wx\bar yz + wx\bar y\bar z + w\bar xyz + w\bar x\bar yz + \bar wxyz + \bar w\bar xyz + \bar w\bar xy\bar z}}\)

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free