Electric Circuits IV - Digital Circuitry

by Tony R. Kuphaldt

Read here Read at LibreTextsPDF

Every aspect of our lives is increasingly becoming integrated and connected by the Internet of Things (IoT), which consists of computers and embedded systems. These devices are controlled by software which at its core is Boolean logic in conjunction with digital information. The world around us is analogue, but with every passing day our interaction with the world is becoming more digital and more integrated.

Description from LibreTexts.

Publisher
Bellingham Technical College
Subjects
Workforce, Electronics Technology
Licence
GNU Free Documentation License, as LibreTexts states it
Who can read
Tweens profiles and older, judged from its title and subjects

Contents

LibreTexts writes equations in TeX, and here they show as TeX; the PDF has them typeset.

  1. Front Matter
  2. TitlePage
  3. InfoPage
  4. Table of Contents
  5. Licensing
  6. 1: Numeration Systems
  7. 1.1: Numbers and Symbols
  8. 1.2: Systems of Numeration
  9. 1.3: Decimal versus Binary Numeration
  10. 1.4: Octal and Hexadecimal Numeration
  11. 1.5: Octal and Hexadecimal to Decimal Conversion
  12. 1.6: Conversion From Decimal Numeration
  13. 2: Binary Arithmetic
  14. 2.1: Numbers versus Numeration
  15. 2.2: Binary Addition
  16. 2.3: Negative Binary Numbers
  17. 2.4: Binary Subtraction
  18. 2.5: Binary Overflow
  19. 2.6: Bit Grouping
  20. 3: Logic Gates
  21. 3.1: Digital Signals and Gates
  22. 3.2: The NOT Gate
  23. 3.3: The “Buffer” Gate
  24. 3.4: Multiple-input Gates
  25. 3.5: TTL NAND and AND gates
  26. 3.6: TTL NOR and OR gates
  27. 3.7: CMOS Gate Circuitry
  28. 3.8: Special-output Gates
  29. 3.9: Gate Universality
  30. 3.10: Logic Signal Voltage Levels
  31. 3.11: DIP Gate Packaging
  32. 4: Switches
  33. 4.1: Switch Types
  34. 4.2: Switch Contact Design
  35. 4.3: Contact “Normal” State and Make/Break Sequence
  36. 4.4: Contact “Bounce”
  37. 5: Electromechanical Relays
  38. 5.1: Relay Construction
  39. 5.2: Contactors
  40. 5.3: Time-delay Relays
  41. 5.4: Protective Relays
  42. 5.5: Solid-state Relays
  43. 6: Ladder Logic
  44. 6.1: “Ladder” Diagrams
  45. 6.2: Digital Logic Functions
  46. 6.3: Permissive and Interlock Circuits
  47. 6.4: Motor Control Circuits
  48. 6.5: Fail-safe Design
  49. 6.6: Programmable Logic Controllers (PLC)
  50. 7: Boolean Algebra
  51. 7.1: Introduction to Boolean Algebra
  52. 7.2: Boolean Arithmetic
  53. 7.3: Boolean Algebraic Identities
  54. 7.4: Boolean Algebraic Properties
  55. 7.5: Boolean Rules for Simplification
  56. 7.6: Circuit Simplification Examples
  57. 7.7: The Exclusive-OR Function - The XOR Gate
  58. 7.8: DeMorgan’s Theorems
  59. 7.9: Converting Truth Tables into Boolean Expressions
  60. 8: Karnaugh Mapping
  61. 8.1: Introduction to Karnaugh Mapping
  62. 8.2: Venn Diagrams and Sets
  63. 8.3: Boolean Relationships on Venn Diagrams
  64. 8.4: Making a Venn Diagram Look Like a Karnaugh Map
  65. 8.5: Karnaugh Maps, Truth Tables, and Boolean Expressions
  66. 8.6: Logic Simplification With Karnaugh Maps
  67. 8.7: Larger 4-variable Karnaugh Maps
  68. 8.8: Minterm vs. Maxterm Solution
  69. 8.9: Sum and Product Notation
  70. 8.10: Don’t Care Cells in the Karnaugh Map
  71. 8.11: Larger 5 and 6-variable Karnaugh Maps
  72. 9: Combinational Logic Functions
  73. 9.1: Introduction to Combinational Logic Functions
  74. 9.2: Half-Adder
  75. 9.3: Full-Adder
  76. 9.4: Decoder
  77. 9.5: Encoder
  78. 9.6: Demultiplexers
  79. 9.7: Multiplexers
  80. 9.8: Using Multiple Combinational Circuits
  81. 10: Multivibrators
  82. 10.1: Digital Logic With Feedback
  83. 10.2: The S-R Latch
  84. 10.3: The Gated S-R Latch
  85. 10.4: The D Latch
  86. 10.5: Edge-triggered Latches- Flip-Flops
  87. 10.6: The J-K Flip-Flop
  88. 10.7: Asynchronous Flip-Flop Inputs
  89. 10.8: Monostable Multivibrators
  90. 11: Sequential Circuits
  91. 11.1: Binary Count Sequence
  92. 11.2: Asynchronous Counters
  93. 11.3: Synchronous Counters
  94. 11.4: Counter Modulus
  95. 11.5: Finite State Machines
  96. 12: Shift Registers
  97. 12.1: Introduction to Shift Registers
  98. 12.2: Shift Registers- Serial-in, Serial-out
  99. 12.3: Shift Registers- Parallel-in, Serial-out (PISO) Conversion
  100. 12.4: Shift Registers- Serial-in, Parallel-out (SIPO) Conversion
  101. 12.5: Universal Shift Registers- Parallel-in, Parallel-out
  102. 12.6: Ring Counters
  103. 13: Digital-Analog Conversion
  104. 13.1: Introduction to Digital-Analog Conversion
  105. 13.2: The R/2nR DAC- Binary-Weighted-Input Digital-to-Analog Converter
  106. 13.3: The R/2R DAC (Digital-to-Analog Converter)
  107. 13.4: Flash ADC
  108. 13.5: Digital Ramp ADC
  109. 13.6: Successive Approximation ADC
  110. 13.7: Tracking ADC
  111. 13.8: Slope (integrating) ADC
  112. 13.9: Delta-Sigma ADC
  113. 13.10: Practical Considerations of ADC Circuits
  114. 14: Digital Communication
  115. 14.1: Introduction to Digital Communication
  116. 14.2: Networks and Busses
  117. 14.3: Data Flow
  118. 14.4: Electrical Signal Types
  119. 14.5: Optical Data Communication
  120. 14.6: Network Topology
  121. 14.7: Network Protocols
  122. 14.8: Practical considerations - Digital Communication
  123. 15: Digital Storage (Memory)
  124. 15.1: Why digital?
  125. 15.2: Digital Memory Terms and Concepts
  126. 15.3: Modern Nonmechanical Memory
  127. 15.4: Historical, Nonmechanical Memory Technologies
  128. 15.5: Read-Only Memory (ROM)
  129. 15.6: Memory with moving parts- “Drives”
  130. 16: Principles Of Digital Computing
  131. 16.1: A Binary Adder
  132. 16.2: Look-up Tables
  133. 16.3: Finite-state Machine
  134. 16.4: Microprocessors
  135. 16.5: Microprocessor Programming
  136. Back Matter
  137. Index
  138. Credits
  139. Index
  140. Glossary
  141. Detailed Licensing