Minimization Technique
The primary objective of all simplification
procedures is to obtain an expression that has the minimum number of terms.
Obtaining an expression with the minimum number of literals is usually the secondary
objective. If there is more than one possible solution with the same number of
terms, the one having the minimum number of literals is the choice.
There are several methods for simplification of
Boolean logic expressions. The process is usually called logic minimization‖ and the goal is to form a result which is efficient. Two methods we
will discuss are algebraic minimization and Karnaugh maps. For very complicated
problems the former method can be done using special software analysis
programs. Karnaugh maps are also limited to problems with up to 4 binary
inputs. The Quine–McCluskey tabular method is used for more than 4
binary inputs.
Related Topics
Privacy Policy, Terms and Conditions, DMCA Policy and Compliant
Copyright © 2018-2023 BrainKart.com; All Rights Reserved. Developed by Therithal info, Chennai.