P. 1
Digital Electronics

# Digital Electronics

|Views: 72|Likes:
Digital Electronics pdf
Digital Electronics pdf

See more
See less

07/25/2013

pdf

text

original

## Sections

• Digital Electronics Part I –Combinational and Sequential Logic
• Introduction
• Aims
• Course Structure
• Objectives
• Books
• Other Points
• Combinational Logic
• Introduction to Logic Gates
• Uses of Simple Logic
• Logic Gates
• Representing Logic Functions
• NOT Gate
• AND Gate
• OR Gate
• EXCLUSIVE OR (XOR) Gate
• NOT AND (NAND) Gate
• NOT OR (NOR) Gate
• Boiler Example
• Boolean Algebra -Examples
• Boolean Algebra -Example
• Logic Minimisation
• Truth Tables
• Disjunctive Normal Form
• Maxterms
• Conjunctive Normal Form
• Logic Simplification
• Karnaugh Maps
• Expression in POS form
• Don’t Care Conditions
• Don’t Care Conditions -Example
• Some Definitions
• Binary Numbers
• Unsigned Binary Numbers
• Octal: Base 8
• Hex: Base 16
• Negative numbers
• 2’s Complement
• Binary Coded Decimal (BCD)
• Combinational Logic Design
• Building Larger Gates
• Common Expression Elimination
• Hazards
• Timing Diagrams
• Static Hazard
• Dynamic Hazard
• Static 1 Hazard
• Hazard Removal
• Removing the static 1 hazard
• To Speed up Ripple Carry Adder
• Fast Carry Generation
• Other Ways to Implement Combinational Logic
• ROM Overview
• ROM Example
• ROM Implementation
• Basic PAL Structure
• Other Memory Devices
• Memory Application
• Bus Contention
• Tristate Buffer
• Control Signals
• Sequential Logic
• Memory Elements
• RS Latch
• RS Latch –State Transition Table
• RS Latch –State Diagram
• Clocks and Synchronous Circuits
• Transparent D Latch
• Master-Slave Flip-Flops
• Master-Slave D Flip-Flop
• D Flip-Flops
• J-K Flip-Flop
• T Flip-Flop
• Asynchronous Inputs
• Timing
• Applications of Flip-Flops
• Counters
• Ripple Counters
• Synchronous Counters
• Characteristic Table
• Excitation Table
• Characteristic and Excitation Tables
• Modified State Transition Table
• Modified State Transition Table
• Synchronous Counter Example
• Synchronous Counter
• Shift Register
• Synchronous State Machines
• Definitions
• Types of State Machines
• Machine Schematics
• Moore vs. Mealy Machines
• Moore Machine -Example
• Example –Traffic Light Controller
• FSM Problems
• Example 2
• State Assignment
• Example Problem
• Sequential State Assignment
• Shift Register Assignment
• One Hot State Encoding
• One Hot -Example
• Tripos Example
• Implementation of FSMs
• GAL Devices
• FPGA

•A memory stores data –usually one bit per
element
•A snapshot of the memory is called the state
•A one bit memory is often called a bistable,
i.e., it has 2 stable internal states
• Flip-flopsand latchesare particular
implementations of bistables

scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->