Karnaugh Minimizer 2.0
Boolean Algebra - assistant program which facilitates minimization of Boolean function by a method of Karnaugh maps
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.￭
￭ Karnaugh Minimizer is shareware, that means you can evaluate trial version of Karnaugh Minimizer with functional limitations for 30 days at no charges.
In a hurry? Add it to your Download Basket!
What's New in This Release:
- Karnaugh Map control improved
- Complete user interface redesign for WinXP
- Report template became XSL powered
- Ability to print Karnaugh Map