lecture 1: introduction to digital logic design
DESCRIPTION
Lecture 1: Introduction to Digital Logic Design. CSE 140: Components and Design Techniques for Digital Systems Fall 2014 CK Cheng Dept. of Computer Science and Engineering University of California, San Diego. Information about the Instructor. Instructor: CK Cheng - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Lecture 1: Introduction to Digital Logic Design](https://reader036.vdocuments.mx/reader036/viewer/2022062408/56813222550346895d98827f/html5/thumbnails/1.jpg)
1
Lecture 1: Introduction to Digital Logic Design
CSE 140: Components and Design Techniques for Digital Systems
Fall 2014
CK ChengDept. of Computer Science and Engineering
University of California, San Diego
![Page 2: Lecture 1: Introduction to Digital Logic Design](https://reader036.vdocuments.mx/reader036/viewer/2022062408/56813222550346895d98827f/html5/thumbnails/2.jpg)
Information about the Instructor
• Instructor: CK Cheng
• Education: Ph.D. in EECS UC Berkeley
• Industrial Exp: Consultant, Engineer of AMD, Mentor Graphics, Bellcore
• Email: [email protected]
• Office: 2130 EBU3B
• Office hours will be posted on the course website
2
![Page 3: Lecture 1: Introduction to Digital Logic Design](https://reader036.vdocuments.mx/reader036/viewer/2022062408/56813222550346895d98827f/html5/thumbnails/3.jpg)
Information about TAs• Ilgweon Kang, <[email protected]>
• Howard Hao Zhuang <[email protected]>
• Dao D Lam <[email protected]>
Office hours will be posted on the course website
3
![Page 4: Lecture 1: Introduction to Digital Logic Design](https://reader036.vdocuments.mx/reader036/viewer/2022062408/56813222550346895d98827f/html5/thumbnails/4.jpg)
Logistics: ResourcesAll information about the class is on the class website:
http://cseweb.ucsd.edu/classes/fa14/cse140-b/index.html
•Approx. Syllabus
•Detailed schedule
•Readings
•Assignments (TED)
•Grading policy (Website)
•Forum (Piazza)•Content/announcements and grades will be posted through Piazza *make sure you have access
I will assume that you check these daily
Office hours and emails available on the course website
4
![Page 5: Lecture 1: Introduction to Digital Logic Design](https://reader036.vdocuments.mx/reader036/viewer/2022062408/56813222550346895d98827f/html5/thumbnails/5.jpg)
5
Logistics: Textbooks
Required text:• [Harris] Digital Design and Computer Architecture,
D.M. Harris and S.L. Harris, Morgan Kaufmann, 2013 (2nd Edition).
Other references:• [Lang]: “Digital Systems and Hardware/Firmware
Algorithms” by Milos D. Ercegovac and Tomas Lang
![Page 6: Lecture 1: Introduction to Digital Logic Design](https://reader036.vdocuments.mx/reader036/viewer/2022062408/56813222550346895d98827f/html5/thumbnails/6.jpg)
Lecture: Peer Instruction• I will pose carefully designed questions. You will
– Solo vote: Think for yourself and select answer– Discuss: Analyze problem in teams of three
• Practice analyzing, talking about challenging concepts
• Reach consensus
• If you have questions, raise your hand and I will come over
– Group vote: Everyone in group votes– Class wide discussion:
• Led by YOU (students) – tell us what you talked about in discussion that everyone should know!
6
![Page 7: Lecture 1: Introduction to Digital Logic Design](https://reader036.vdocuments.mx/reader036/viewer/2022062408/56813222550346895d98827f/html5/thumbnails/7.jpg)
7
Grading (grade on style, completeness and correctness)
• iClicker: x% (10 out of 15 classes), x=5 voted by class
• Homework: 9-x% (grade based on a subset of problems. If more than 70% of class fills CAPEs, best 4 out of 5 )
• Midterm 1: 30% (T 10/28)
• Midterm 2: 30% (T 11/18)
• Midterm 3: 30% (Th 12/11)
• Take home final exam: 1% (due 230PM, F 12/19)
• Grading: The best of– Absolute: A- >90% ; B- >80% of total score (100%).
– The curve: (A+,A-) top 33+ε% of class; (B+,B-) second 33+ε%
– The bottom: C- > 45% of total score.
Logistics: Course Components
![Page 8: Lecture 1: Introduction to Digital Logic Design](https://reader036.vdocuments.mx/reader036/viewer/2022062408/56813222550346895d98827f/html5/thumbnails/8.jpg)
A word on HWs and exams• HWs:
– Practice for exams
– Do them individually for best results
• Exams• (Another) Indication of how well you have absorbed the material
• Solution and grading policy will be posted after exam.
• Learn from mistakes and move on ….
8
![Page 9: Lecture 1: Introduction to Digital Logic Design](https://reader036.vdocuments.mx/reader036/viewer/2022062408/56813222550346895d98827f/html5/thumbnails/9.jpg)
Course Problems…Cheating
• What is cheating?–Studying together in groups is encouraged
–Turned-in work must be completely your own.
–Copying someone else’s solution on a HW or exam is cheating
–Both “giver” and “receiver” are equally culpable
• We have to address the issue once the cheating is reported by TAs or tutors.
9
![Page 10: Lecture 1: Introduction to Digital Logic Design](https://reader036.vdocuments.mx/reader036/viewer/2022062408/56813222550346895d98827f/html5/thumbnails/10.jpg)
10
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 $315 billion in 2013.
![Page 11: Lecture 1: Introduction to Digital Logic Design](https://reader036.vdocuments.mx/reader036/viewer/2022062408/56813222550346895d98827f/html5/thumbnails/11.jpg)
The Digital Revolution
WWII
Integrated Circuit: Many digital operations on the same material
ENIAC Moore’s Law
19651949
Integrated Circuit
Exponential Growth of Computation
Vacuum tubes
(1.6 x 11.1 mm)
Stored ProgramModel 11
![Page 12: Lecture 1: Introduction to Digital Logic Design](https://reader036.vdocuments.mx/reader036/viewer/2022062408/56813222550346895d98827f/html5/thumbnails/12.jpg)
12
Robert Noyce, 1927 - 1990
• Nicknamed “Mayor of Silicon Valley”
• Cofounded Fairchild Semiconductor in 1957
• Cofounded Intel in 1968
• Co-invented the integrated circuit
![Page 13: Lecture 1: Introduction to Digital Logic Design](https://reader036.vdocuments.mx/reader036/viewer/2022062408/56813222550346895d98827f/html5/thumbnails/13.jpg)
13
Gordon Moore
• Cofounded Intel in 1968 with Robert Noyce.
• Moore’s Law: the number of transistors on a computer chip doubles every 1.5 years (observed in 1965)
![Page 14: Lecture 1: Introduction to Digital Logic Design](https://reader036.vdocuments.mx/reader036/viewer/2022062408/56813222550346895d98827f/html5/thumbnails/14.jpg)
Technology Trends: Moore’s Law
• Since 1975, transistor counts have doubled every two years.
14
![Page 15: Lecture 1: Introduction to Digital Logic Design](https://reader036.vdocuments.mx/reader036/viewer/2022062408/56813222550346895d98827f/html5/thumbnails/15.jpg)
15
Principle of Abstraction
Abstraction: Hiding details when they aren’t important
Physics
Devices
AnalogCircuits
DigitalCircuits
Logic
Micro-architecture
Architecture
OperatingSystems
ApplicationSoftware
electrons
transistorsdiodes
amplifiersfilters
AND gatesNOT gates
addersmemories
datapathscontrollers
instructionsregisters
device drivers
programs
focu
s o
f th
is c
ou
rseCSE 30
CSE 141
CSE 140
![Page 16: Lecture 1: Introduction to Digital Logic Design](https://reader036.vdocuments.mx/reader036/viewer/2022062408/56813222550346895d98827f/html5/thumbnails/16.jpg)
16
Scope
• The purpose of this course is that we:– Learn the principles of digital design– Learn to systematically debug increasingly
complex designs – Design and build digital systems– Learn what’s under the hood of an electronic
component
![Page 17: Lecture 1: Introduction to Digital Logic Design](https://reader036.vdocuments.mx/reader036/viewer/2022062408/56813222550346895d98827f/html5/thumbnails/17.jpg)
17
We will cover four major things in this course:
- Combinational Logic (Harris-Chap 2)- Sequential Networks (Harris-Chap 3)- Standard Modules (Harris-Chap 5)- System Design (Harris-Chap 4, 6-8)
![Page 18: Lecture 1: Introduction to Digital Logic Design](https://reader036.vdocuments.mx/reader036/viewer/2022062408/56813222550346895d98827f/html5/thumbnails/18.jpg)
18
Scope: Overall Picture of CS140
Sequential machine
Conditions
Control
Mux
Memory File
ALU
Memory Register
Conditions
Input
Pointer
CLK: Synchronizing Clock
Data Path Subsystem
Select
Control Subsystem
![Page 19: Lecture 1: Introduction to Digital Logic Design](https://reader036.vdocuments.mx/reader036/viewer/2022062408/56813222550346895d98827f/html5/thumbnails/19.jpg)
19
fi(x)
x1
.
.
.xn
fi(x)
Combinational Logic vs Sequential Network
Combinational logic:
yi = fi(x1,..,xn)
CLKSequential Networks1. Memory 2. Time Steps (Clock)
yit = fi (x1
t,…,xnt, s1
t, …,smt)
Sit+1 = gi(x1
t,…,xnt, s1
t,…,smt)
fi(x)
x1
.
.
.xn
fi(x)fi(x)
x1
.
.
.xn
fi(x) si
![Page 20: Lecture 1: Introduction to Digital Logic Design](https://reader036.vdocuments.mx/reader036/viewer/2022062408/56813222550346895d98827f/html5/thumbnails/20.jpg)
20
Scope
Subjects Building Blocks Theory
Combinational Logic
AND, OR, NOT, XOR
Boolean Algebra
Sequential Network
AND, OR, NOT, FF
Finite State Machine
Standard Modules
Operators,
Interconnects, Memory
Arithmetics, Universal Logic
System Design Data Paths, Control Paths
Methodologies
![Page 21: Lecture 1: Introduction to Digital Logic Design](https://reader036.vdocuments.mx/reader036/viewer/2022062408/56813222550346895d98827f/html5/thumbnails/21.jpg)
21
Part I. Combinational Logic
ab + cdab
cd
ecd
ab
e (ab+cd)
Next Lecture Reading:[Harris] Chapter 2, Section 2.1-2.4