Difference between revisions of "Syllabus"

From CSE260M Wiki
Jump to navigationJump to search
Line 132: Line 132:
 
|15
 
|15
 
|OCT 23
 
|OCT 23
|
+
|Digital Systems = Datapath + Control<br />Register Transfers<br />Tri-State Buffers<br />The Bus-Based Difference Engine
|
+
|[[media:Mano_ch06_images.pdf|Chapter 6]]
|Homeowrk 6
+
|Homeowrk 6<br />Lab 2
 
|Homework 5
 
|Homework 5
  
Line 140: Line 140:
 
|16
 
|16
 
|OCT 25
 
|OCT 25
 +
|S
 
|
 
|
 
|
 
|
|Lab 2
 
 
|
 
|
  

Revision as of 17:59, 9 May 2017

FALL 2017
LECTURE DATE MATERIAL PREPARATION ASSIGNED DUE
1 AUG 28 Course Introduction
Number Systems
Base Conversion
Arithmetic Operations
Codes
Course Introduction
Chapter 1
The Reflected Binary (Gray) Code
Homework 1
2 AUG 30 Boolean Algebra
DeMorgan's Theorem
The Consensus Theorem
Introduction to K-Maps
Chapter 2
3 SEPT 6 Standard Forms: POS Notation
Two-Level Circuit Optimization Using K-Maps
Proving Identities Using K-Maps
The XOR Gate
The Half Adder
The Full Adder
The Ripple-Carry Adder
Chapter 2
Chapter 3
Homework 2 Homework 1
4 SEPT 11 Essential Prime Implicants and Optimized Expressions
Standard Forms: SOP Notation
Five- and Six-Variable K-Maps
Don’t cares
Gate propagation delay
The 74LS04 Inverter
The Mux
The Decoder
Implementing Circuits Using Muxes
Chapter 2
Chapter 3
74LS04 Datasheet
5 SEPT 13 Standard Cell Implementation of Logic Circuits
VHDL: VHSIC Hardware Description Language
VHDL Constructs: IF, WHEN, SELECT
Xilnix Vivado Tool Suite
Boole's Expansion Theorem (First Pass)
Standard Cell Circuit
VHDL Tutorial
Vivado Simulation Tutorial 1
Full Vivado Tutorial
Boole's Expansion Theorem
Homework 3 Homework 2
6 SEPT 18 Boole's Expansion Theorem (Second Pass)
FPGAs
USING LUTs to Implement Logic (LUT = Storage + MUX)
Chapter 5
7 SEPT 20 Digilent Development Board
Concepts of VCCIO and Core Voltage
Demo Board Schematic (LEDs, Switches)
Manual
Schematics
Lab 1 Homework 3
8 SEPT 25 Implementing Functions with NAND and NOR Gates
Implementing Functions with Decoders
The Priority Encoder
The 4-bit Adder as a 2-Level Circuit
Addition and Subtraction of 2s Complement Numbers
Incrementing (The Incrementer Circuit)
Multiplication by Constants
Chapter 3
9 SEPT 27 Gate Delay
Races and Hazards
Chapter 2 Lab 1
10 OCT 2 EXAM 1
11 OCT 4 Oscillators and Clock Distribution
Flip-Flop as a Black Box
A First Counter (Incrementer + FFs)
The Difference Engine
VHDL for FFs, Registers, and The Difference Engine
Setup Time
Hold Time
Clock-to-Output Time
Introduction to Metastability
Chapter 4
Oscillators and Clock Distribution
First Counter
Using Babbage's Difference Engine to Introduce Computer Architecture
Anomalous Behavior of Synchronizer and Arbiter Circuits
Measured Flip-Flop Responses to Marginal Triggering
Homework 4
12 OCT 9 Latches
NOR SR Latch VHDL
Flip-Flops
74LS74/74S74 Flip-Flop
Formal Definition of Mealy- and Moore-Model FSMs
State Tables
Second Counter: FSM Design Example
Clocks in VHDL
Chapter 4
NOR SR Latch VHDL
74LS74 Datasheet
Second Counter
Vivado Simulation Tutorial 2 (Forcing a Clock)
13 OCT 11 Sequence Recognizer
FSMs in VHDL
One-Hot FSM Implementation
Recognizing Character Sequences (Packet Sniffing)
Chapter 4
VHDL Tutorial
Homework 5 Homework 4
OCT 16 Fall Break
14 OCT 18 FSM Timging/Max Clock Rate
Equivalent States
Minimizing Complete Specified Machines
Combination Mealy/Moore Machines
Chapter 4
Definitions and Theorems for Sequential Machines
Minimizing Completely Specified Machines
15 OCT 23 Digital Systems = Datapath + Control
Register Transfers
Tri-State Buffers
The Bus-Based Difference Engine
Chapter 6 Homeowrk 6
Lab 2
Homework 5
16 OCT 25 S
17 OCT 30 Homework 6
18 NOV 1 Lab 2
19 NOV 6 Exam 2