Synthesizing Functions using K-maps

  • Context: MHB 
  • Thread starter Thread starter shamieh
  • Start date Start date
  • Tags Tags
    Functions
Click For Summary

Discussion Overview

The discussion revolves around synthesizing a function using Karnaugh maps (K-maps) for a timing diagram, specifically focusing on minimizing the function \( f(x_1, x_2, x_3) \) into its simplest sum of products form. Participants engage in exploring the truth table provided and the subsequent steps for K-map grouping and simplification.

Discussion Character

  • Exploratory
  • Technical explanation
  • Homework-related

Main Points Raised

  • The original poster presents a truth table and derives the function \( f(x_1, x_2, x_3) = \sum m(0, 3, 5, 6) \) and its initial sum of products form.
  • The poster seeks guidance on how to group the 1s in the K-map and whether their interpretation of the function is correct.
  • One participant asserts that diagonal clumping is not allowed in K-maps and claims that no further simplification is possible, suggesting that the function is already in its simplest form.
  • Another participant expresses gratitude for the help received from the forum, highlighting the value of community support in understanding complex topics.

Areas of Agreement / Disagreement

There is disagreement regarding the possibility of further simplification of the function. One participant believes that the function cannot be simplified further, while the original poster is uncertain about the grouping process in the K-map.

Contextual Notes

The discussion does not resolve the uncertainty regarding the grouping of terms in the K-map or the simplification of the function, leaving these aspects open for further exploration.

Who May Find This Useful

Students and individuals learning about digital logic design, specifically those interested in K-map techniques for function synthesis and minimization.

shamieh
Messages
538
Reaction score
0
For a timing diagram - synthesize the function $f$(x1,x2,x3) in the simplest sum of products form.

So I have a picture of this timing diagram, which I can't really show on here unless i physically took a picture and uploaded it, but it's really irrelevant because I know I have the correct truth table, so hopefully we can work with that.

So my Truth Table reads:

  1. x1 x2 x3 | f
  2. 0 0 0 | 1
  3. 0 0 1 | 0
  4. 0 1 0 | 0
  5. 0 1 1 | 1
  6. 1 0 0 | 0
  7. 1 0 1 | 1
  8. 1 1 0 | 1
  9. 1 1 1 | 0

So now I know I have $f$(x1,x2,x3) = $$\sum$$m(0,3,5,6)

Which means I have:

x!x2!x3! + x1!x2x3 + x1x2!x3 + x1x2x3!

So I need to put this function in the simplest sum of products form.. So I'm assuming i need to minimize the function that I just got above? If I am on the right track- then I now need to use a K-Map to find the minimization.

So here it goes.. (This is my K-Map)

... x2 x3
.. 00 01 11 10
x1 0[1) 0 1 0]
.. 1[0 1 0 (1]

So my question Is what now? How should I group all these 1s? Just group each of them by themselves? And if so, How do I read off what is going on here?
Would I read it like this ? x1!x2!x3! + x1x2!x3 + x1!x2x3 + x1x2x3! ?
Thanks for your time.

If this is something you can't explain or think I should just read more up on, please let me know, because I can take constructive criticism. I just want to make sure I know how to do these.
 
Last edited:
Technology news on Phys.org
Yeah, diagonal clumping isn't allowed on K-maps. There's no simplification possible for that function, and you already have the simplest SoP. That's what I say.
 
Your help is greatly appreciated. If only you guys knew how much you really help me. I seriously live on this forum - thanks to teachers who machine gun through chapters and T.A.s who can barely speak English. You all are very helpful. Appreciate everything you have supplied and helped me with.

Sham
 
shamieh said:
Your help is greatly appreciated. If only you guys knew how much you really help me. I seriously live on this forum - thanks to teachers who machine gun through chapters and T.A.s who can barely speak English. You all are very helpful. Appreciate everything you have supplied and helped me with.

Sham

Thanks very much for those kind words! I can assure you, it works both ways. When we get courteous users who ask interesting questions, that makes it all worth-while!
 

Similar threads

  • · Replies 26 ·
Replies
26
Views
3K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 5 ·
Replies
5
Views
4K
  • · Replies 2 ·
Replies
2
Views
948
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 6 ·
Replies
6
Views
5K