Karnaugh Minimizer

Karnaugh Minimizer is an application for those who are interested in Boolean algebra, like developers of small digital devices, radio amateurs or electrical engineering students.
Karnaugh Minimizer allows to minimize Boolean function by a graphic method of Karnaugh maps. A must-have tool for the freshmen electrical engineering student.
The given program is called to facilitate minimization of Boolean function by a method of Karnaugh maps. The program has the simple and convenient interface, evident image of received results of minimization. The program draws the so-called largest circle and displays the prime implicant solution.
Here are some key features of "Karnaugh Minimizer":
ï¿­ Minimize boolean function
ï¿­ from 4 up to 23 variables
ï¿­ by a graphic method of Karnaugh maps.
ï¿­ Convert boolean function to VHDL/Verilog code.(unique feature)
ï¿­ Generate NAND schematic from results.
ï¿­ Draws 2 - 8 variable Karnaugh Maps
ï¿­ Quine Mc Cluskey minimization tool allow you
ï¿­ to handle 9-23 variables.
ï¿­ Convert boolean formula to VHDL or Verilog code.
ï¿­ Expression-to-map tracking - Allows you to click on a term in a given expression and see it highlighted on the map.
ï¿­ Simplifies boolean expressions that you enter.
ï¿­ Multi lingual user interface.ï¿­
Limitations:
ï¿­ Karnaugh Minimizer is shareware, that means you can evaluate trial version of Karnaugh Minimizer with functional limitations for 30 days at no charges.