Lecture 1: Introduction to Digital Logic Design CSE 140: Components - - PowerPoint PPT Presentation

▶
lecture 1 introduction to digital logic design
SMART_READER_LITE
LIVE PREVIEW

Lecture 1: Introduction to Digital Logic Design CSE 140: Components - - PowerPoint PPT Presentation

Jun 29, 2023 331 likes •732 views

Lecture 1: Introduction to Digital Logic Design CSE 140: Components and Design Techniques for Digital Systems Spring 2017 CK Cheng Dept. of Computer Science and Engineering University of California, San Diego 1 Outlines Staff

slide-1
SLIDE 1

1

Lecture 1: Introduction to Digital Logic Design

CSE 140: Components and Design Techniques for Digital Systems Spring 2017 CK Cheng

  • Dept. of Computer Science and Engineering

University of California, San Diego

slide-2
SLIDE 2

Outlines

  • Staff

– Instructor, TAs, Tutors

  • Logistics

– Websites, Textbooks, Grading Policy

  • Motivation

– Moore’s Law, Internet of Things

  • Scope

– Position among courses – Coverage

2

slide-3
SLIDE 3

Information about the Instructor

  • Instructor: CK Cheng
  • Education: Ph.D. in EECS UC Berkeley
  • Industrial Experiences: Engineer of AMD, Mentor

Graphics, Bellcore; Consultant for technology companies

  • Email: ckcheng+140@ucsd.edu
  • Office: Room 2130 CSE Building
  • Office hours are posted on the course website

– 2-250PM Tu; 330-420PM Th

  • Websites

– http://cseweb.ucsd.edu/~kuan – http://cseweb.ucsd.edu/classes/sp17/cse140-a

3

slide-4
SLIDE 4

Information about TAs and Tutors

TAs

  • He, Jennifer Lily email:p3he@ucsd.edu
  • Jakate, Prateek Ravindra email:pjakate@ucsd.edu
  • Knapp, Daniel Alan email:dknapp@ucsd.edu
  • Luo, Mulong email:muluo@ucsd.edu (BSV CSE140L Winter 2017)
  • Shih, Yishin email:y2shih@ucsd.edu (BSV CSE140L Winter 2017)

Tutors

  • Guan, Yuxiang email:yug049@ucsd.edu
  • Huh, Sung Rim email:srhuh@ucsd.edu
  • Li, Xuanang email:xul065@ucsd.edu
  • Lu, Anthony email:anl176@ucsd.edu
  • Park, Dong Won email:dwp003@ucsd.edu
  • Wang, Moyang email:mowang@ucsd.edu
  • Yao, Bohan email:boyao@ucsd.edu
  • Yu, Yue email:yuy079@ucsd.edu

Office hours will be posted on the course website

4

slide-5
SLIDE 5

Logistics: Sites for the Class

  • Class website

– http://cseweb.ucsd.edu/classes/sp17/cse140-a/index.html – Index: Staff Contacts and Office Hrs – Syllabus

  • Grading policy
  • Class notes
  • Assignment: Homework and zyBook Activities
  • Exercises: Solutions and Rubrics
  • Forum (Piazza): Online Discussion *make sure you have access
  • ACMS Labs ieng6: BSV mainly for CSE140L
  • zyBook: UCSDCSE140ChengSpring2017
  • TritonEd: Score record

5

slide-6
SLIDE 6

6

Logistics: Textbooks

Required text:

  • Online Textbook: Digital Design by F. Vahid
  • 1. Sign up at zyBooks.com
  • 2. Enter zyBook code UCSDCSE140ChengSpring2017
  • 3. Fill email address with domain ucsd.edu
  • 4. Fill section A01 or A02
  • 5. Click Subscribe $48
  • BSV by Example, R.S. Nikhil and K. Czeck, 2010 (online).

Reference texts (recommended and reserved in library)

  • Digital Design, F. Vahid, 2010 (2nd Edition).
  • Digital Design and Computer Architecture, D.M. Harris and S.L.

Harris, Morgan Kaufmann, 2015 (ARM Edition).

  • Digital Systems and Hardware/Firmware Algorithms, Milos D.

Ercegovac and Tomas Lang.

slide-7
SLIDE 7

Lecture: iCliker for Peer Instruction

  • I will pose 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

– Class wide discussion:

  • Led by YOU (students) – tell us what you talked about in

discussion that everyone should know.

  • Many questions are open, i.e. no exact solutions.

– Emphasis is on reasoning and team discussion – No solution will be posted

7

slide-8
SLIDE 8

8

Grade on style, completeness and correctness

  • zyBook exercises: 20%
  • iClicker: 9% (by participation up to three quarters of classes)
  • Homework: 15% (grade based on a subset of problems. If more

than 85% of class fill out CAPE evaluations, the lowest homework score will be dropped)

  • Midterm 1: 27% (T 5/2/17)
  • Midterm 2: 28% (Th 6/8/17)
  • Final: 1% (take home exam, due 10PM, Th 6/15/17)
  • Grading: The best of the following

– The absolute: A- >90% ; B- >80% of total 100% score – The curve: (A+,A,A-) top 33+ε% of class; (B+,B,B-) second 33+ε% – The bottom: C- above 45% of absolute score.

Logistics: Grading

slide-9
SLIDE 9

A word on the grading components

  • zyBook: Interactive learning experience

– Reset of answers causes no penalty – No excuse for delay

  • iClicker:

– Clarification of the concepts and team discussion – Participation of three quarters of class – No excuse for missing

  • Homework: BSV (Bluespec System Verilog) will be used

– Practice for exams. Group discussion is encouraged – However, we are required to write them individually for the best results – Discount 10% loss of credit for each day after the deadline but no credit after the solution is posted. – Metric: Posted solutions and rubrics, but not grading results

9

slide-10
SLIDE 10

A word on the grading components

  • Midterms: (Another) Indication of how well we have absorbed

the material – Samples will be posted for more practices. – Solution and grading policy will be posted after the exam. – Midterm 2 is not cumulative but requires a good command

  • f the whole class.
  • Final:

– Take home exam – Application of the class materials – Free to use libraries but no group discussion – Fun and educational to work on.

10

slide-11
SLIDE 11

BSV: Bluespec System Verilog

  • High Level Language for Hardware (above

Verilog)

  • Promote modular design methodology
  • Inventor: Arvind, MIT while he started an

Ethernet router chip company.

  • CSE140L Winter 2017 started BSV (Arvind,

Gupta)

  • CSE140L Spring 2017 adopts BSV (Isaac Chu)
  • CSE140: Our homework will use BSV (learn by

examples)

11

slide-12
SLIDE 12

Course Problems…Cheating

  • What is cheating?

–Studying together in groups is not cheating but 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.

12

slide-13
SLIDE 13

13

Motivation

  • Microelectronic technologies have revolutionized
  • ur world: cell phones, internet, rapid advances in

medicine, etc.

  • The semiconductor industry has grown from $21

billion in 1985 to $335 billion in 2015.

slide-14
SLIDE 14

The Digital Revolution

WWII Integrated Circuit: Many digital operations on the same material

ENIAC Moore’s Law

1965 1949

Integrated Circuit

Exponential Growth

  • f Computation

Vacuum tubes

(1.6 x 11.1 mm)

Stored Program Model

14

slide-15
SLIDE 15

Building complex circuits

15

Transistor

slide-16
SLIDE 16

16

Robert Noyce, 1927 - 1990

  • Nicknamed “Mayor of Silicon

Valley”

  • Cofounded Fairchild

Semiconductor in 1957

  • Cofounded Intel in 1968
  • Co-invented the integrated

circuit

slide-17
SLIDE 17

17

Gordon Moore

  • Cofounded Intel in

1968 with Robert Noyce.

  • Moore’s Law: the

number of transistors

  • n a computer chip

doubles every 1.5 years (observed in 1965)

slide-18
SLIDE 18

Technology Trends: Moore’s Law

  • Since 1975, transistor counts have doubled every two years.

18

slide-19
SLIDE 19

19

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

slide-20
SLIDE 20

Position among CSE Courses

  • Big idea: Coordination of many levels of abstraction

CSE 140

I/O system Processor Compiler Operating System (Mac OSX) Application (ex: browser) Digital Design Circuit Design Instruction Set Architecture Datapath & Control

Transistors

Memory

Hardware Software

Assembler

Dan Garcia

CSE 120 CSE 140,141 CSE 131 Algos: CSE 100, 101

slide-21
SLIDE 21

21

Principle of Abstraction

Abstraction: Hiding details when they are not important

Physics Devices Analog Circuits Digital Circuits Logic Micro- architecture Architecture Operating Systems Application Software electrons transistors diodes amplifiers filters AND gates NOT gates adders memories datapaths controllers instructions registers device drivers programs focus of this course

CSE 30 CSE 141 CSE 140

slide-22
SLIDE 22

22

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

BSV: Design specification and modular design methodology

slide-23
SLIDE 23

23

fi(x,s) x1 . . . xn

Combinational Logic vs Sequential Network

Combinational logic:

yi = fi(x1,..,xn)

CLK Sequential Networks

  • 1. Memory
  • 2. Time Steps (Clock)

yi

t = fi (x1 t,…,xn t, s1 t, …,sm t)

si

t+1 = gi(x1 t,…,xn t, s1 t,…,sm t)

fi(x) x1 . . . xn fi(x) fi(x) x1 . . . xn fi(x) si

slide-24
SLIDE 24

24

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

slide-25
SLIDE 25

25

Combinational Logic Basics

slide-26
SLIDE 26

What is a combinational circuit?

26

  • No memory
  • Realizes one or more functions
  • Inputs and outputs can only have two discrete values
  • Physical domain (usually, voltages) (Ground 0V, Vdd 1V)
  • Mathematical domain : Boolean variables (True, False)

Differentiate between different representations:

  • physical circuit
  • schematic diagram
  • mathematical expressions
slide-27
SLIDE 27

<27>

Boolean Algebra

A branch of algebra in which the values of the variables belong to a set B (e.g. {0, 1}), has two

  • perations {+, .} that satisfy the following four

sets of laws.

  • Commutative laws: a+b=b+a, a·b=b·a
  • Distributive laws: a+(b·c)=(a+b)·(a+c),

a·(b+c)=a·b+a·c

  • Identity laws: a+0=a, a·1=a
  • Complement laws: a+a’=1, a·a’=0

(x’: the complement element of x)

slide-28
SLIDE 28

Representations of combinational circuits: The Schematic

28

A B Y

  • What is the simplest combinational circuit that you

know?

slide-29
SLIDE 29

Representations of combinational circuits

Truth Table: Enumeration of all combinations

29

A B Y=AB

Example: AND id A B Y 1 1 2 1 3 1 1 1

slide-30
SLIDE 30

<30>

Boolean Algebra

Similar to regular algebra but defined on sets with only three basic ‘logic’ operations:

  • 1. Intersection: AND (2-input);

Operator: . ,&

  • 2. Union: OR (2-input);

Operator: + ,|

  • 3. Complement: NOT ( 1-input);

Operator: ‘ ,! “&, |, !” Symbols in BSV

slide-31
SLIDE 31

31

Two-input AND ( ∙ )

A B Y 0 0 0 0 1 0 1 0 0 1 1 1 AND A B Y 0 0 0 0 1 1 1 0 1 1 1 1 OR A Y 0 1 1 0 NOT

Boolean algebra and switching functions

For an AND gate, 0 at input blocks the other inputs and dominates the output 1 at input passes signal A For an OR gate, 1 at input blocks the other inputs and dominates the output 0 at input passes signal A A 1 1 A A A 1 A A

Two-input OR (+ ) One-input NOT (Complement, ’ )

slide-32
SLIDE 32

<32>

Boolean Algebra

iClicker Q: For two Boolean variables X and Y with X=1, Y=0, what is function F(X,Y)=X+Y? A.F(X,Y)=0 B.F(X,Y)=1 C.F(X,Y)=2

slide-33
SLIDE 33

<33>

Boolean Algebra

iClicker Q: For two Boolean variables X and Y with X=1, Y=0, what is function F(X,Y)=X+X+Y? A.F(X,Y)=0 B.F(X,Y)=1 C.F(X,Y)=2

slide-34
SLIDE 34

<34>

Boolean Algebra

iClicker Q: For two Boolean variables X and Y with X=1, Y=0, what is function F(X,Y)=X+XY? A.F(X,Y)=0 B.F(X,Y)=1 C.F(X,Y)=2

slide-35
SLIDE 35

<35>

Boolean Algebra

iClicker Q: For two Boolean variables X and Y with X=1, Y=0, what is function F(X,Y)=(X+Y)Y? A.F(X,Y)=0 B.F(X,Y)=1 C.F(X,Y)=2

slide-36
SLIDE 36

36

So, what is the point of representing gates as symbols and Boolean expressions?

ab + cd a b c d e cd ab y=e (ab+cd)

Logic circuit vs. Boolean Algebra Expression

  • Given the Boolean expression, we can draw the

circuit it represents by cascading gates (and vice versa)

slide-37
SLIDE 37

37

BSV Description: An example

ab + cd a b c d e cd ab y=e (ab+cd) function Bit#(1) fy(Bit#(1) a, Bit#(1) b, Bit#(1) c, Bit#(1) d, Bit#(1) e); Bit#(1) y= e &((a &b) | (c&d)); return y; endfunction “Bit#(n)” type declaration says that a is n bit wide.

slide-38
SLIDE 38

Next class

  • Designing Combinational circuits

38