Digital Electronics: Principles, Devices and Applications

Contentsxi6.3.8 Theorem 8 1966.3.9 Theorem 9 1976.3.10 Theorem 10 (Absorption Law or Redundancy Law) 1976.3.11 Theorem 11 1976.3.12 Theorem 12 (Consensus Theorem) 1986.3.13 Theorem 13 (DeMorgan’s Theorem) 1996.3.14 Theorem 14 (Transposition Theorem) 2006.3.15 Theorem 15 2016.3.16 Theorem 16 2016.3.17 Theorem 17 (Involution Law) 2026.4 Simplification Techniques 2046.4.1 Sum-of-Products Boolean Expressions 2046.4.2 Product-of-Sums Expressions 2056.4.3 Expanded Forms of Boolean Expressions 2066.4.4 Canonical Form of Boolean Expressions 2066.4.5 and Nomenclature 2076.5 Quine–McCluskey Tabular Method 2086.5.1 Tabular Method for Multi-Output Functions 2126.6 Karnaugh Map Method 2166.6.1 Construction of a Karnaugh Map 2166.6.2 Karnaugh Map for Boolean Expressions with a Larger Number ofVariables 2226.6.3 Karnaugh Maps for Multi-Output Functions 225Review Questions 230Problems 230Further Reading 2317 Arithmetic Circuits 2337.1 Combinational Circuits 2337.2 Implementing Combinational Logic 2357.3 Arithmetic Circuits – Basic Building Blocks 2367.3.1 Half-Adder 2367.3.2 Full Adder 2377.3.3 Half-Subtractor 2407.3.4 Full Subtractor 2427.3.5 Controlled Inverter 2447.4 Adder–Subtractor 2457.5 BCD Adder 2467.6 Carry Propagation–Look-Ahead Carry Generator 2547.7 Arithmetic Logic Unit (ALU) 2607.8 Multipliers 2607.9 Magnitude Comparator 2617.9.1 Cascading Magnitude Comparators 2637.10 Application-Relevant Information 266Review Questions 266Problems 267Further Reading 268