Algorithm to generate boolean function by using Karnaugh map

Apr 27, 2005 3 Replies

I am developing a program in Java to generate a boolean function by using k-map with 4 variables. So from the 4-variable map with 16 cells, user can input 1 or 0 in each cell. Then the program will generate the simplied boolean function according to the map.



Basically I don't know the algorithm on how to group the "1"s and then how to simplify it. Please advise. Or let me know if you have/know any such code that I can learn from.


Nah- it is better to go with algorithm karnaugh map simplification. Then you get something more basic like :

formatting link

Quine-McCluskey is the Google word:

formatting link
,
formatting link

Berkeley's espresso maybe ? (afaik, the name came well before Java :-)

Google on "espresso logic reduction" seems to bring interesting pointers.

Bert Cuzeau

Join the Discussion

Have something to add? Share your thoughts — no account required.

Didn't find your answer?

Ask the community — no account required