# ways of simplifying a boolean function

Discussion in 'Homework Help' started by cirqs, Oct 10, 2009.

1. ### cirqs Thread Starter New Member

Oct 10, 2009
1
0
When simplifying a Boolean function using Kmaps, how do you attain ALL the possible simplified expressions? How do you be sure that you have gotten all the possible simplified expressions?

Thanks!

2. ### Ratch New Member

Mar 20, 2007
1,068
4
cirqs,

That is a question that you can answer yourself by reading about K-maps. You need to cover all the minterms on the K-map. You have to cover as many minterms as possible with one logic term. Some logic functions have more than one best possible solution. These alternate solutions can also be seen with a K-map. K-maps are a pattern recognition method. For a small number of logic variables, it is easy to see the most optimal reduction. Tabulation methods exist that methodically find the all the best reductions, but they are too complicated for me to show here. They are well suited to computers, however.

Ratch