Cover13; -- Copyright13; -- Dedication13; -- Preface -- Acknowledgment13; -- Contents -- Chapter 0 Introduction to Digital Electronics -- Chapter 1 Numbering Systems -- 1.0 Introduction13; -- 1.1 Numbering Systems13; -- 1.1.1 A Review of the Decimal System -- 1.1.2 Binary Numbering System13; -- 1.1.3 Binary Formats13; -- 1.2 Data Organization13; -- 1.2.1 Bits13; -- 1.2.2 Nibbles13; -- 1.2.3 Bytes13; -- 1.2.4 Words13; -- 1.2.5 Double Words13; -- 1.3 Octal Numbering System13; -- 1.3.1 Octal to Decimal, Decimal to Octal Conversion13; -- 1.3.2 Octal to Binary, Binary to Octal Conversion13; -- 1.4 Hexadecimal Numbering System13; -- 1.4.1 Hex to Decimal and Decimal to Hex Conversion13; -- 1.4.2 Hex to Binary and Binary to Hex Conversion13; -- 1.4.3 Hex to Octal and Octal to Hex Conversion13; -- 1.5 Range of Number Representation13; -- 1.6 Binary Arithmetic13; -- 1.7 Negative Numbers and Their Arithmetic13; -- 1.7.1 1s and 2s Complement13; -- 1.7.2 Subtraction Using 1s and 2s Complement13; -- 1.7.3 Signed Binary Representation13; -- 1.7.4 Arithmetic Overflow13; -- 1.7.5 9s and 10s Complement13; -- 1.7.6 rs Complement and (r 8211; 1)s Complement13; -- 1.7.7 Rules for Subtraction Using rs and (r8211;1)s Complement13; -- 1.8 Binary Coded Decimal (BCD) and Its Arithmetic13; -- 1.9 Codes13; -- 1.9.1 Weighted Binary Codes13; -- 1.9.2 Non Weighted Codes13; -- 1.9.3 Error Detecting Codes13; -- 1.9.4 Error Correcting Codes13; -- 1.9.5 Hamming Code13; -- 1.9.6 Cyclic Codes13; -- 1.10 Solved Examples13; -- 1.11 Exercises13; -- Chapter 2 Digital Design Fundamentals-Boolean Algebra and Logic Gates -- 2.0 Introductory Concepts of Digital Design13; -- 2.1 Truth Table13; -- 2.2 Axiomatic Systems and Boolean Algebra13; -- 2.2.1 Huntingtons Postulates13; -- 2.2.2 Basic Theorems and Properties of Boolean Algebra13; -- 2.3 Boolean Functions13; -- 2.3.1 Transformation of Boolean Function into Logic Diagram13; -- 2.3.2 Complement of a Function13; -- 2.4 Representation of Boolean Functions13; -- 2.4.1 Minterm and Maxterm Realization13; -- 2.4.2 Standard Forms13; -- 2.4.3 Conversion between Standard Forms13; -- 2.5 Digital Logic Gates 13; -- 2.5.1 Positive and Negative Logic Designation13; -- 2.5.2 Gate Definition13; -- 2.5.3 The AND Gate13; -- 2.5.4 The OR Gate13; -- 2.5.5 The Inverter and Buffer13; -- 2.5.6 Other Gates and Their Functions13; -- 2.5.7 Universal Gates13; -- 2.5.8 The Exclusive OR Gate 13; -- 2.5.9 The Exclusive NOR gate -- 2.5.10 Extension to Multiple Inputs in Logic Gates13; -- 2.6 NAND and NOR Implementation -- 2.6.1 Implementation of a Multistage (or Multilevel) Digital Circuit using NAND Gates Only -- 2.6.2 Implementation of a Multilevel digital circuit using NOR gates only13; -- 2.7 Exercises13; -- Chapter 3 Boolean Function Minimization Techniques -- 3.0 Introduction13; -- 3.1 Minimization Using Postulates and Theorem of Boolean Algebra13; -- 3.2 Minimization Using Karnaugh Map (K-Map) Method13; -- 3.2.1 Two and Three Variable K Map13; -- 3.2.2 Boolean Expression Minimization Using K-Map13; -- 3.2.3 Minimization in Products of Sums Form13; -- 3.2.4 Four.