3
Minimisation of Switching Functions
LEARNING OBJECTIVES
After studying this chapter, you will know about:
- Algebraic minimisation using the theorems and rules of the algebra.
- Veitch–Karnaugh map method.
- Quine–McCluskey Tabular method.
- Covering tables and simplification rules.
3.1 INTRODUCTION
Minimising of switching functions is required in order to reduce the cost of circuitry (using contact or gate networks discussed later) according to some pre-specified cost criteria. This takes the form of minimising the number of terms in the Sum of Products (SOP) or Product of Sums (POS) form, minimising the number of literals in the expression or minimising the number of contacts or gates or gate inputs in the final logical circuit realisation. ...
Get Switching Theory and Logic Design now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
