logiccircuit.pptVIP

Introduction Combinational Logic Circuits The logic level at the output depends on the combination of logic levels present at the inputs No memory characteristic, so its output depends only on the current value of its inputs In this chapter we will study the simplification of logic circuits(Two method) Boolean Algebra theorems Mapping technique(Karnaugh Map) Logic Circuit Design to satisfy a given set of requirements Basic Characteristics of Digital ICs Troubleshooting Digital Systems Internal/External Digital IC Faults Troubleshooting Case Study PLD 4-1 Sum-of-Products Form Two or more AND terms that are ORed together Each AND term consists of one or more variables individually appearing in either complemented or uncomplemented form One inversion sign cannot cover more than one variable in a term e.g., we cannot have ABC or RST Product-of-Sums Two or more OR terms that are ANDed together Each OR term contains one or more variables in complemented or uncomplemented The methods of circuit simplification and design based on the sum-of-Products form(?? ??) 4-2 Simplifying Logic Circuits Fig. 4-1 : produce a more efficient implementation Two methods for simplifying logic circuits Boolean Algebra Theorems : greatly dependent on inspiration and experience Karnaugh mapping : systematic and step-by-step approach 4-3 Algebraic Simplification No easy way to tell whether the simplified expression is in its simplest form or whether it could have been simplified further Algebraic simplification often becomes a process of trial and error With experience, however, one can become adept at obtaining reasonably good results Two essential steps to simplify the expression Repeated application of DeMorgan’s theorems and multiplication of terms Product terms are checked for common factors. Hopefully, the factoring results in the elimination of one or more terms 4-4 Designing Combinational Logic Circuits Converting truth table to logic circuit Forming AND term for each row wi