Download presentation
Presentation is loading. Please wait.
Published byEvangeline Alexia O’Neal’ Modified over 9 years ago
1
1 Lecture 1: Introduction to Digital Logic Design CK Cheng CSE Dept. UC San Diego
2
2 Outlines Administration Motivation Scope
3
3 Administration Web site: http://www.cse.ucsd.edu/classes/fa12/cse140-a/ WebCT: http://ted.ucsd.edu
4
4 Administration Instructor: CK Cheng, CSE2130, ckcheng+140@ucsd.edu, 858 534-6184 Teaching Assistants: Shih-Hung Weng, s2weng@ucsd.edu Jyoti Wadhwani, jwadhwan@ucsd.edu
5
5 Administration Schedule Outline (Use index to check the location of the textbooks) Lectures: 3:00-3:50PM, MWF, Center 115. Discussion: 9:00-9:50AM, F, Center 101. Office hours: CSE2130 –10:30-11:30AM, T –1:00-2:00PM, W
6
6 Administration Textbook: Digital Design and Computer Architecture, D.M. Harris and S.L. Harris, Morgan Kaufmann, Second Edition, 2012. Grading iClicker: 5% (a ramp function saturates at 80% of class points) CK Cheng Office Hr. visits: 2% bonus (1% per visit) Homework: 10% (grade on style, completeness or correctness) Midterm 1: 25% (M 10/22) (style, completeness and correctness) Midterm 2: 30% (W 11/14) Midterm 3: 30% (F 12/07) Optional take home final exam due 6PM, F. 12/14: 1% bonus
7
7 Motivation Microelectronic technologies have revolutionized our world: cell phones, internet, rapid advances in medicine, etc. The semiconductor industry has grown from $21 billion in 1985 to $304 billion in 2010.
8
8 Robert Noyce, 1927 - 1990 Nicknamed “Mayor of Silicon Valley” Cofounded Fairchild Semiconductor in 1957 Cofounded Intel in 1968 Co-invented the integrated circuit
9
9 Gordon Moore, 1929 - Cofounded Intel in 1968 with Robert Noyce. Moore’s Law: the number of transistors on a computer chip doubles every year (observed in 1965) Since 1975, transistor counts have doubled every two years.
10
10 Moore’s Law “If the automobile had followed the same development cycle as the computer, a Rolls-Royce would today cost $100, get one million miles to the gallon, and explode once a year...” – Robert Cringley
11
11 iClicker The purpose of this course is that we: A.Learn what’s under the hood of an electronic component B.Learn the principles of digital design C.Learn to systematically debug increasingly complex designs D.Design and build digital systems E.All of the above F.Most of the above
12
12 iClicker Digital system can be built upon A.Mechanical relays B.Silicon transistors C.DNAs D.Quantum mechanical phenomena E.All of the above
13
13 Scope: Position in the Design Flow The class assumes CMOS transistors AND, OR logic Flip-Flip registers Synchronous designs, but the application reaches beyond the assumed region.
14
14 Scope: Sequence of Courses CSE20: Discrete Math CSE140/L: Digital System CSE141/L: Computer Architecture CSE142-149: Architecture, Design Automation, Embedded Systems CSE237, 240-249, 291: Architecture, Design Automation, Embedded Systems ECE260A-C: VLSI Designs
15
15 We will cover four major things in this course: - Combinational Logic (H2) - Sequential Networks (H3) - Standard Modules (H5) - System Design (H4, H6-8) Scope: Content
16
16 Scope: Overall Picture of CS140 Control Subsystem Conditions Control Mux Memory File ALU Memory Register Conditions Input Pointer CLK: Synchronizing Clock Data Path Subsystem
17
17 f i (x) x1...xnx1...xn Combinational Logic vs Sequential Network Combinational logic: y i = f i (x 1,..,x n ) CLK Sequential Networks 1. Memory 2. Time Steps (Clock) y i t = f i (x 1 t,…,x n t, s 1 t, …,s m t ) s i t+1 = g i (x 1 t,…,x n t, s 1 t,…,s m t ) f i (x) x1...xnx1...xn x1...xnx1...xn sisi
18
18 Scope SubjectsBuilding BlocksTheory Combinational Logic AND, OR, NOT, XOR Boolean Algebra Sequential Network AND, OR, NOT, FF Finite State Machine Standard Modules Operators, Interconnects, Memory Arithmetic, Universal Logic System DesignData Paths, Control Paths Methodologies
19
19 Perspective Class notes Homework Textbook
20
20 Part I. Combinational Logic I) Specification II) Implementation III) Different Types of Gates ab + cd abab cdcd e cd ab e (ab+cd)
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.