Simplification of a logic statement is an essential step of a digital design. An input statement is minimized to an equivalent expression by using various methodologies. So that, the function of the input statement can be achieved with fewer components. This means lower cost, less complexity and better reliability. Both input and final statements are boolean statements in the form of Sum Of Products or Product Of Sums by using three basic boolean operators; AND, OR and NOT.

T-Logic Minimizer is a handy utility which runs the Quine–McCluskey algorithm (named after Willard V. Quine and Edward J. McCluskey). This algorithm takes minterms into account for the determining the prime implicant process. In the Boolean algebra, a minterm is a statement that results in “1” for the output. Some statements must result in “0” while some may be “0” or “1” (doesn’t matter) that is called Don't Care. Using the Don’t Care terms helps to obtain the resulting statement with less terms.

The number of prime implicants exponentially increases with the number of variables. As the result of this, the execution time of the algorithm also exponentially increases. Therefore, the number of variables in T-Logic Minimizer is limited to 10 which takes reasonable time for execution on an average PC as well as memory limitations.

Requirements

●Microsoft Windows Vista or newer operating system

●200KB disk space for installation

●2GB RAM (higher RAM for better performance)

●Intel Celeron (or compatible AMD processor) or better CPU

This application requires Microsoft Visual C++ redistributable libraries which may already be installed since it comes as part of the Windows. If not installed or experienced any problem, visit Microsoft’s Download Center and download the latest version. Then install it on the PC and restart the machine

Legal Notice and Licensing: T-LogicMinimizer is subject to the terms of MIT License without selling the product.