Courseware-Softwarechapter_4.doc.docVIP

COMBINATIONAL LOGIC CIRCUITS In Chapter Three individual gates were investigated. This chapter will use those gates in combination to produce more complex logic functions. Techniques for simplifying these complex functions will also be covered. Simplification of logic circuits is a responsibility of the designer. Simpler circuits are generally more economic and more reliable. The economy is achieved by using fewer integrated circuits while reliability is achieved by having fewer solder connections in the finished product. 4.0 INTRODUCTION  Upon completion of this chapter you should be able to: Simplify logic expressions. Simplify logic circuits. Use the Karnaugh map to simplify logic circuits andexpressions. 4.1 OBJECTIVES 41 4.2 SUM-OF-PRODUCT FORM The sum-of-product form of a logic circuit output looks like the following examples:  f = AB + ABC + CD These examples show that the output of a logic circuit represented by x, z, or f are a logic one, or are true, when any of the logic products separated by the OR (+) designation are satisfied. The logic expressions completely define a logic circuits operation in terms of the state of the logic inputs. Logic equations may be formed directly from a truth table. These equations may also be simplified using Boolean algebra or more mechanical methods. Both types of simplification will be covered. The logic equations shown in the above examples are called minterm expressions. Minterm expressions are logical equations where the logical product terms are separated by the logical sum operator. Minterm expressions are formed directly from truth tables. Minterm expressions are also called sum-of-product expressions. 4.3 DESIGNING COMBINATION CIRCUITS Logic design begins with a problem statement. The problem statement is analyzed and translated into logic variable inputs. A truth table is then constructed to show when a logic one output is to be produced. Next a sum-of-product (minterm) logic equation is then produce