Difference between revisions of "Syllabus"
From CSE260M Wiki
Jump to navigationJump to search| Line 14: | Line 14: | ||
|Course Introduction<br />Number Systems<br />Base Conversion<br />Arithmetic Operations<br />Codes | |Course Introduction<br />Number Systems<br />Base Conversion<br />Arithmetic Operations<br />Codes | ||
|[[media:Einstein.pdf|Course Introduction]]<br />[[media:Mano_ch01_images.pdf|Chapter 1]]<br />[[media:The_Reflected_Binary_(Gray)_Code.pdf|The Reflected Binary (Gray) Code]] | |[[media:Einstein.pdf|Course Introduction]]<br />[[media:Mano_ch01_images.pdf|Chapter 1]]<br />[[media:The_Reflected_Binary_(Gray)_Code.pdf|The Reflected Binary (Gray) Code]] | ||
| + | | | ||
| + | | | ||
|- | |- | ||
| Line 26: | Line 28: | ||
|Standard Forms: POS Notation<br />Two-Level Circuit Optimization Using K-Maps<br />Proving Identities Using K-Maps<br />The XOR Gate<br />The Half Adder<br />The Full Adder<br />The Ripple-Carry Adder | |Standard Forms: POS Notation<br />Two-Level Circuit Optimization Using K-Maps<br />Proving Identities Using K-Maps<br />The XOR Gate<br />The Half Adder<br />The Full Adder<br />The Ripple-Carry Adder | ||
|[[media:Mano_ch02_images.pdf|Chapter 2]]<br />[[media:Mano_ch03_images.pdf|Chapter 3]] | |[[media:Mano_ch02_images.pdf|Chapter 2]]<br />[[media:Mano_ch03_images.pdf|Chapter 3]] | ||
| + | | | ||
| + | | | ||
|- | |- | ||
| Line 32: | Line 36: | ||
|Essential Prime Implicants and Optimized Expressions<br />Standard Forms: SOP Notation<br />Five- and Six-Variable K-Maps<br />Don’t cares<br />Gate propagation delay<br />The Mux<br />The Decoder<br />Implementing Circuits Using Muxes | |Essential Prime Implicants and Optimized Expressions<br />Standard Forms: SOP Notation<br />Five- and Six-Variable K-Maps<br />Don’t cares<br />Gate propagation delay<br />The Mux<br />The Decoder<br />Implementing Circuits Using Muxes | ||
|[[media:Mano_ch02_images.pdf|Chapter 2]]<br />[[media:Mano_ch03_images.pdf|Chapter 3]] | |[[media:Mano_ch02_images.pdf|Chapter 2]]<br />[[media:Mano_ch03_images.pdf|Chapter 3]] | ||
| + | | | ||
| + | | | ||
|- | |- | ||
| Line 38: | Line 44: | ||
|Standard Cell Implementation of Logic Circuits<br />VHDL: VHSIC Hardware Description Language<br />VHDL Constructs: IF, WHEN, SELECT<br />Xilnix Vivado Tool Suite<br />Boole's Expansion Theorem (First Pass) | |Standard Cell Implementation of Logic Circuits<br />VHDL: VHSIC Hardware Description Language<br />VHDL Constructs: IF, WHEN, SELECT<br />Xilnix Vivado Tool Suite<br />Boole's Expansion Theorem (First Pass) | ||
|[[media:Standard_Cell.JPG|Standard Cell Circuit]]<br />[[media:EVERYTHING_YOU_ALWAYS_WANTED_2016.pdf|VHDL Tutorial]]<br />[[media:Vivado_Simulation_Tutorial.pdf|Vivado Simulation Tutorial 1]]<br />[[media:Vivado_Tutorial.pdf|Full Vivado Tutorial]]<br />[[media:Boole’s_Expansion_Theorem.pdf|Boole's Expansion Theorem]] | |[[media:Standard_Cell.JPG|Standard Cell Circuit]]<br />[[media:EVERYTHING_YOU_ALWAYS_WANTED_2016.pdf|VHDL Tutorial]]<br />[[media:Vivado_Simulation_Tutorial.pdf|Vivado Simulation Tutorial 1]]<br />[[media:Vivado_Tutorial.pdf|Full Vivado Tutorial]]<br />[[media:Boole’s_Expansion_Theorem.pdf|Boole's Expansion Theorem]] | ||
| + | | | ||
| + | | | ||
|- | |- | ||
| Line 44: | Line 52: | ||
|Boole's Expansion Theorem (Second Pass)<br />FPGAs<br />USING LUTs to Implement Logic (LUT = Storage + MUX)<br /> | |Boole's Expansion Theorem (Second Pass)<br />FPGAs<br />USING LUTs to Implement Logic (LUT = Storage + MUX)<br /> | ||
|[[media:Mano_ch05_images.pdf|Chapter 5]] | |[[media:Mano_ch05_images.pdf|Chapter 5]] | ||
| + | | | ||
| + | | | ||
|- | |- | ||
| Line 50: | Line 60: | ||
|Digilent Development Board<br />Concepts of VCCIO and Core Voltage<br />Demo Board Schematic (LEDs, Switches) | |Digilent Development Board<br />Concepts of VCCIO and Core Voltage<br />Demo Board Schematic (LEDs, Switches) | ||
|[[media:Dev_Board_Manual.pdf|Manual]]<br />[[media:Dev_Board_Schematics.pdf|Schematics]] | |[[media:Dev_Board_Manual.pdf|Manual]]<br />[[media:Dev_Board_Schematics.pdf|Schematics]] | ||
| + | |Lab 1 | ||
| + | |Homework 3 | ||
|} | |} | ||
Revision as of 15:07, 9 May 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 |
||
| 2 | AUG 30 | Boolean Algebra 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 |
||
| 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 Mux The Decoder Implementing Circuits Using Muxes |
Chapter 2 Chapter 3 |
||
| 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 |
||
| 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 |
