Logic Circuits and Switching Theory

Course Outline:

BINARY SYSTEMS

  1. Binary Numbers
  2. Number Base Conversions
  3. Octal and Hexadecimal numbers
  4. Complements
  5. Signed Binary Numbers
  6. Binary Codes
  7. Binary Storage and Registers
  8. Binary Logic

BOOLEAN ALGEBRA and LOGIC GATES

  1. Axiomic Definition of Boolean Algebra
  2. Basic Theorems and Properties of Boolean Algebra
  3. Boolean Functions
  4. Canonical and Standard Forms
  5. Other Logic Operators
  6. Digital Logic Gates
  7. Integrated Circuits

SIMPLIFICATION OF BOOLEAN FUNCTIONS

  1. The Map Method
  2. Two-and Three-variable Maps
  3. Four-variable Map
  4. Five-Variable Map
  5. Product of Sums Simplification
  6. NAND and NOR Implementation
  7. Other Two-level Implementations
  8. Don't Care Conditions
  9. Tabulation Method
  10. Determination of Prime Implicants

COMBINATIONAL LOGIC

  1. Design Procdures
  2. Adders
  3. Subtractors
  4. Code Conversion
  5. Analysis Procedure
  6. Multilevel NAND Circuits
  7. Multilevel NOR Circuits
  8. Exclusive-OR Functions

MSI and PLD COMPONENTS

  1. Binary Adder and Subtractor
  2. Decimal Adder
  3. Magnitude Comparator
  4. Decoders and Encoders
  5. Multiplexers
  6. Read-Only Memory (ROM)
  7. Programmable Logic Array (PLA)
  8. Programmable Array Logic (PAL)

SYNCHRONOUS SEQUENTIAL LOGIC

  1. Flip-flops
  2. Trigerring of Flip-flops
  3. Analysis of Clocked Sequential Circuits
  4. State Reduction and Assignment
  5. Flip-flop Excitation Table
  6. Design Procedures
  7. Design of Counters

REGISTERS, COUNTERS and the MEMORY UNIT

  1. Registers
  2. Shift Registers
  3. Ripple Counters
  4. Synchronous Counters
  5. Timing Sequences
  6. Random-Access Memory (RAM)
  7. Memory Decoding
  8. Error-Correcting Codes

Textbook:

Digital Design by Morris-Mano
Last updated: July 5, 2007