Question about finding min. sum of product using K-maps?

In summary, the minimum sum of products for the function g(r s t) is equal to r't' + rs' +rs. This can be simplified using Boolean theorems, but can also be solved using K-maps. By filling out the K-map, we can determine that the minimum sum of products is equal to R ∨ T'.
  • #1
Aristotle
169
1

Homework Statement


Figure out the minimum sum of products for g(r s t) = r't' + rs' +rs
2. The attempt at a solution
I understand you can simplify it with the Boolean theorems (e.g r't' + r = t' + r) , however how would you solve it using K-maps? I drew out a truth table, but it seems as if this SOP expression is simplified to the point where there is a missing variable for each term in the function to be able to plot the minterm within the k-map..

How would I go about in approaching this problem using k-maps?
 
Physics news on Phys.org
  • #2
Aristotle said:
How would I go about in approaching this problem using k-maps?
g(r s t) = r't' + rs' +rs

Fill out the K-map:

upload_2015-9-26_15-31-19.png
The lower four 1's will give R. The leftmost/rightmost four 1's will give T'. Thus G = R ∨ T'.
 

Attachments

  • scan0020.pdf
    29 KB · Views: 206

FAQ: Question about finding min. sum of product using K-maps?

How do you use K-maps to find the minimum sum of products?

To find the minimum sum of products using K-maps, you need to first create a K-map table with all possible combinations of inputs for the given function. Then, group together adjacent cells that contain a '1' in the K-map to form a group of 2, 4, 8, or 16 cells. These groups will correspond to a product term in the minimized expression. Finally, write out the minimized expression by combining the product terms with an OR operator.

What is the purpose of finding the minimum sum of products using K-maps?

The purpose of finding the minimum sum of products using K-maps is to simplify a Boolean expression and reduce the number of logic gates required to implement the function. This leads to a more efficient and cost-effective circuit design.

Can K-maps be used for functions with more than 4 variables?

No, K-maps are typically used for functions with 4 or fewer variables. For functions with more than 4 variables, other methods such as the Quine-McCluskey algorithm or algebraic manipulation may be used to find the minimum sum of products.

How do you handle don't care conditions in K-maps?

Don't care conditions in K-maps can be treated as either '0' or '1', depending on which value helps to minimize the expression. If both values result in the same minimized expression, the don't care condition can be ignored.

Are there any limitations to using K-maps to find the minimum sum of products?

Yes, K-maps can only be used for functions that can be represented in a truth table. They also become increasingly complex and difficult to use for functions with more variables. In these cases, other methods may be more suitable for finding the minimum sum of products.

Similar threads

Understanding State Machines: Converting Logic Problems into K Maps
Replies
5
Views
1K
Boolean function - minterms - literals
Replies
2
Views
4K
Engineering Doubt about BCD Sum circuit using full adders
Replies
1
Views
3K
Simplify & K-Map Homework Statement
Replies
5
Views
5K
Solve Digital Logic Homework: Simplify w/ K-map, Sum of Prods & NAND Gates
Replies
2
Views
3K
Boolean Algebra, Minimum Sum of Products Problem
Replies
5
Views
2K
A Solvability Of The Couniversal Mapping Problem On Products
Replies
13
Views
2K
Boolean Algebra Truth Table, Product and Sum Expressions
Replies
2
Views
2K
Need help with a mod-6 counter using JK flip flops w/ control bit
Replies
1
Views
3K
Engineering Solving CMOS Sum of Products: 30 vs 28 Transistors
Replies
8
Views
5K

Hot Threads

Recent Insights

Back
Top