Switching Theory

Division One Fundamental Concepts.- 1 Outline and Basics.- 2 Switching Devices.- 3 Functions.- 4 Logic Functions and Gates.- 5 Synthesis and Duality.- 6 Karnaugh Maps.- 7 Utilising Karnaugh Maps.- Division Two Logic.- 8 Tautologies.- 9 Propositional Logic.- 10 Summary of Theorems.- 11 Algebraic Proofs.- 12 On Predicate Logic.- 13 Predicate Logic.- Division Three Combinational Circuits.- 14 Canonical Normal Forms.- 15 Shegalkin Normal Form.- 16 Synthesis Examples.- 17 Concepts Old and New.- 18 Minimisation Preliminaries.- 19 Minimisation-an Excerp.- 20 Reduced Karnaugh Maps.- 21 NOT-AND and NOT-OR.- 22 Composition of Circuits.- 23 Hazards.- Division Four Latches.- 24 Memorising by Feedback.- 25 Basic Theory of Latches.- 26 Optimised Latches.- 27 Elementary Latches.- 28 Composition of Latches.- Division Five Sequential Circuits with Continuously Read Inputs.- 29 Automata and Programs.- 30 Word-Recognition Tables.- 31 Catenation Model.- 32 Toggle Circuits.- 33 Triggering and Synchronising.- 34 Verifying a Logic Design.- 35 Discussing Huffman's Theory.- 36 State Encoding Techniques.