Algorithm to generate boolean function by using Karnaugh map

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.

Reply to
Eric K.
Loading thread data ...

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

formatting link

Reply to
Fred Bloggs

Quine-McCluskey is the Google word:

formatting link
,
formatting link

Reply to
Frithiof Andreas Jensen

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

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

Bert Cuzeau

Reply to
Bert Cuzeau

ElectronDepot website is not affiliated with any of the manufacturers or service providers discussed here. All logos and trade names are the property of their respective owners.