CS计算机代考程序代写 algorithm mips assembly Abstraction & Digital Logic: From Transistors to Gates

Abstraction & Digital Logic: From Transistors to Gates

Lab 1 – DUE TUESDAY 1/19 11:59pm
 Lab 1 due in 1.5 weeks, released tomorrow
1. Must commit/push to git server
2. Submit Commit ID in Google form
 Uses MML (MultiMedia Logic)
 We will talk about transistors to build gates today
 Lab will use gates to build logic functions
 You should be reading Section 3 of the ZyBook (or equivalent of other books) as on schedule
CSE12 Winter 2021
2

Start going through Zybooks textbook
 We will first cover a little bit of Chapter 3  Today’s lecture will mirror 3.1,3.2
 Start doing the participation activities!
CSE12 Winter 2021
3

Problem Transformation – levels of abstraction
CSE12 Winter 2021
13
The desired behavior: the application
Natural Language Algorithm Program Machine Architecture Micro-architecture Logic Circuits Devices
The building blocks: electronic devices

Levels of Abstraction
 These levels do not necessarily correspond to discrete components, but to well defined standard interfaces.
 Standard interfaces provide
 portability  third party
software/hardware  wider usage
 These levels are to some extent arbitrary – there are other ways to draw the lines.
Natural Language
Algorithm
Program
Machine Architecture
Micro-architecture
Logic Circuits
Devices
CSE12 Winter 2021
14

The Program Level
Most computers run a management program called the operating system (OS).
Application programs interface to the machine architecture via the OS.
This lecture Data An example:
Program (Software)
Application Program
Operating System
Application Program Operating System
PowerPoint
Windows 10
CSE12 Winter 2021
15

Course Outline – What is Next?
 The building blocks of computers: logic gates  How to represent information
 The basic algorithm: the von Neumann model  MIPS structure
 Programming the machine: assembly language  A higher-level language: (Some) C
CSE12 Winter 2021
18

The Transistor: building block of computers
 Microprocessors contain many transistors
 15-Core Xeon Ivy Bridge-EX (2014): 4310 million  10-Core Xeon Westmere-EX (2011): 2600 million  Six-Core Core i7(2010): 1170 million
 AMD 6-core Opteron (2009): 904 million
 Intel Core i7 Quad (2008): 731 million
 Intel Core 2 Duo (2006): 291 million
 IBM/Apple PowerPC G5 (2003): 58 million
 Intel Pentium 4 (2000): 42 million
 IBM PowerPC 750FX (2002): 38 million
 Intel 4004 (1971): 2300
CSE12 Winter 2021
19

The Transistor: Past and Present
CSE12 Winter 2021 20

What Is a Transistor?
 A switch, which can close between the source and the drain
 Changing the voltage of the gate lets you change the current flow between the source and drain (closing or opening the switch)
CSE12 Winter 2021 23

Neuron- Transistor analogy
Register transfer level (RTL)
CSE12 Winter 2021
Transistor level
Gate level
24

What is a transistor?
 Logically, each transistor is used as a switch  Combined to implement logic functions
AND, OR, NOT
 Combined to build higher-level structures
Adder, multiplexer, decoder, register, …  Combined to build a processor
ARM, Core 2 Duo, i7 9700k, etc
CSE12 Winter 2021
28

Simple switch circuit
 ECE 101
Switch open:
No current through
circuit Light is off Vout is +2.9V
Switch closed: Short circuit across
switch Current flows Light is on Vout is 0V
Switch-based circuits can
easily represent two states: on/off, open/closed, voltage/no voltage.
CSE12 Winter 2021
29

1. CMOS Logic Operation
CSE12 Winter 2021
30

Tas
k – Problem Statement
Algorithm
NMOS
PMOS
CSE12 Winter 2021
Pro
Inst
Log
gram
ruction Set Architecture
Microarchitecture
ic Gates
Devices
31

NMOS
PMOS
Logic 1/0
Logic 1/0
Out
GND
Out
CSE12 Winter 2021
32

1
CSE12 Winter 2021
1
33

0
CSE12 Winter 2021
0
34

Out= Vdd
Complementary MOS (CMOS)
CSE12 Winter 2021
35

NOT gate (Inverter )
CSE12 Winter 2021
Vdd V (Logic 1) 0 V (Logic 0)
36

CSE12 Winter 2021
1
1 1
0 NAND gate
37

CSE12 Winter 2021
38

CSE12 Winter 2021
1
0 0 0
39

CSE12 Winter 2021
40

A general CM
CSE12 Winter 2021
OS circuit
Pull Up Network (PUN)
Q. How to determine Out without solving for entire truth table???
A. Follow Output path through either the PUN (towards Vdd) or the PDN (towards gnd)
PDN approach: Under what conditions does Out have a direct path to gnd??
Out = 0, (when AAND B ON) OR (whenCANDDON)
Pull Down Network (PDN)
41

CSE12 Winter 2021
42