Basic Logic Review. Rules. Lecture Roadmap Combinational Logic. Textbook References. Basic Logic Gates (2-input versions)

Similar documents
ECE 545 Digital System Design with VHDL Lecture 1. Digital Logic Refresher Part A Combinational Logic Building Blocks

ECE 545 Digital System Design with VHDL Lecture 1A. Digital Logic Refresher Part A Combinational Logic Building Blocks

First derivative analysis

CHAPTER VI COMBINATIONAL LOGIC BUILDING BLOCKS

CHAPTER VI COMBINATIONAL LOGIC BUILDING BLOCKS

Propositional Logic. Combinatorial Problem Solving (CPS) Albert Oliveras Enric Rodríguez-Carbonell. May 17, 2018

Section 11.6: Directional Derivatives and the Gradient Vector

NEW APPLICATIONS OF THE ABEL-LIOUVILLE FORMULA

Basic Polyhedral theory

priority queue ADT heaps 1

y = 2xe x + x 2 e x at (0, 3). solution: Since y is implicitly related to x we have to use implicit differentiation: 3 6y = 0 y = 1 2 x ln(b) ln(b)

Function Spaces. a x 3. (Letting x = 1 =)) a(0) + b + c (1) = 0. Row reducing the matrix. b 1. e 4 3. e 9. >: (x = 1 =)) a(0) + b + c (1) = 0

ECE 344 Microwave Fundamentals

Fourier Transforms and the Wave Equation. Key Mathematics: More Fourier transform theory, especially as applied to solving the wave equation.

Higher order derivatives

MCE503: Modeling and Simulation of Mechatronic Systems Discussion on Bond Graph Sign Conventions for Electrical Systems

Aim To manage files and directories using Linux commands. 1. file Examines the type of the given file or directory

Give the letter that represents an atom (6) (b) Atoms of A and D combine to form a compound containing covalent bonds.

Addition of angular momentum

u x v x dx u x v x v x u x dx d u x v x u x v x dx u x v x dx Integration by Parts Formula

CS 6353 Compiler Construction, Homework #1. 1. Write regular expressions for the following informally described languages:

Logic Gates and Boolean Algebra

Hydrogen Atom and One Electron Ions

ph People Grade Level: basic Duration: minutes Setting: classroom or field site

General Notes About 2007 AP Physics Scoring Guidelines

Differentiation of Exponential Functions

10. Limits involving infinity

XOR - XNOR Gates. The graphic symbol and truth table of XOR gate is shown in the figure.

Solution: APPM 1360 Final (150 pts) Spring (60 pts total) The following parts are not related, justify your answers:

u r du = ur+1 r + 1 du = ln u + C u sin u du = cos u + C cos u du = sin u + C sec u tan u du = sec u + C e u du = e u + C

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

Addition of angular momentum

Exponential Functions

ECE 407 Computer Aided Design for Electronic Systems. Instructor: Maria K. Michael. Overview. CAD tools for multi-level logic synthesis:

10. EXTENDING TRACTABILITY

System variables. Basic Modeling Concepts. Basic elements single and. Power = effort x flow. Power = F x v. Power = V x i. Power = T x w.

Chapter Finding Small Vertex Covers. Extending the Limits of Tractability. Coping With NP-Completeness. Vertex Cover

From Elimination to Belief Propagation

The graph of y = x (or y = ) consists of two branches, As x 0, y + ; as x 0, y +. x = 0 is the

Instructions for Section 1

LOGIC GATES A Y=A+B. Logic symbol of OR gate B The Boolean expression of OR gate is Y = A + B, read as Y equals A 'OR' B.

The Matrix Exponential

ECE602 Exam 1 April 5, You must show ALL of your work for full credit.

The Matrix Exponential

LR(0) Analysis. LR(0) Analysis

INC 693, 481 Dynamics System and Modelling: The Language of Bound Graphs Dr.-Ing. Sudchai Boonto Assistant Professor

Dealing with quantitative data and problem solving life is a story problem! Attacking Quantitative Problems

Computing and Communications -- Network Coding

Least Favorable Distributions to Facilitate the Design of Detection Systems with Sensors at Deterministic Locations

Image Filtering: Noise Removal, Sharpening, Deblurring. Yao Wang Polytechnic University, Brooklyn, NY11201

Constants and Conversions:

Partial Derivatives: Suppose that z = f(x, y) is a function of two variables.

1 Minimum Cut Problem

cycle that does not cross any edges (including its own), then it has at least

COSC 243. Introduction to Logic And Combinatorial Logic. Lecture 4 - Introduction to Logic and Combinatorial Logic. COSC 243 (Computer Architecture)

That is, we start with a general matrix: And end with a simpler matrix:

Searching Linked Lists. Perfect Skip List. Building a Skip List. Skip List Analysis (1) Assume the list is sorted, but is stored in a linked list.

MA 262, Spring 2018, Final exam Version 01 (Green)

4 x 4, and. where x is Town Square

Slide 1. Slide 2. Slide 3 DIGITAL SIGNAL PROCESSING CLASSIFICATION OF SIGNALS

Worksheet: Taylor Series, Lagrange Error Bound ilearnmath.net

COHORT MBA. Exponential function. MATH review (part2) by Lucian Mitroiu. The LOG and EXP functions. Properties: e e. lim.

Thus, because if either [G : H] or [H : K] is infinite, then [G : K] is infinite, then [G : K] = [G : H][H : K] for all infinite cases.

2. Laser physics - basics

Brief Introduction to Statistical Mechanics

Digital Fundamentals

perm4 A cnt 0 for for if A i 1 A i cnt cnt 1 cnt i j. j k. k l. i k. j l. i l

Chapter 6 Folding. Folding

What are those βs anyway? Understanding Design Matrix & Odds ratios

10. The Discrete-Time Fourier Transform (DTFT)

(Upside-Down o Direct Rotation) β - Numbers

CPSC 665 : An Algorithmist s Toolkit Lecture 4 : 21 Jan Linear Programming

Abstract Interpretation: concrete and abstract semantics

XI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL.

Massachusetts Institute of Technology Department of Mechanical Engineering

GEOMETRICAL PHENOMENA IN THE PHYSICS OF SUBATOMIC PARTICLES. Eduard N. Klenov* Rostov-on-Don, Russia

Middle East Technical University Department of Mechanical Engineering ME 413 Introduction to Finite Element Analysis

Alpha and beta decay equation practice

Middle East Technical University Department of Mechanical Engineering ME 413 Introduction to Finite Element Analysis

Note If the candidate believes that e x = 0 solves to x = 0 or gives an extra solution of x = 0, then withhold the final accuracy mark.

MATHEMATICS (B) 2 log (D) ( 1) = where z =

Linear Non-Gaussian Structural Equation Models

September 23, Honors Chem Atomic structure.notebook. Atomic Structure

A Hybrid Wave-Pipelined Network Router

PROBLEM SET Problem 1.

Homework #3. 1 x. dx. It therefore follows that a sum of the

6.1 Integration by Parts and Present Value. Copyright Cengage Learning. All rights reserved.

PHA 5127 Answers Homework 2 Fall 2001

Goals for Lecture. Binary Logic and Gates (MK 2.1) Binary Variables. Notation Examples. Logical Operations

Trigonometric functions

EECE 301 Signals & Systems Prof. Mark Fowler

1 1 1 p q p q. 2ln x x. in simplest form. in simplest form in terms of x and h.

Experiment 7: Magnitude comparators


Calculus concepts derivatives

Association (Part II)

Three Concepts: Probability Henry Tirri, Petri Myllymäki

Chapter 2 Boolean Algebra and Logic Gates

What is the product of an integer multiplied by zero? and divided by zero?

Digital Design. Digital Design

Transcription:

Lctur Roadmap ombinational Logic EE 55 Digital Systm Dsign with VHDL Lctur Digital Logic Rrshr Part ombinational Logic Building Blocks Basic Logic Rviw Basic Gats D Morgan s Law ombinational Logic Building Blocks Multiplrs Dcodrs, Dmultiplrs Encodrs, Priority Encodrs rithmtic circuits ROM. Implmnting combinational logic using ROM. Tristat burs. 2 Ttbook Rrncs ombinational Logic Rviw Stphn Brown and Zvonko Vransic, Fundamntals o Digital Logic with VHDL Dsign, 2 nd or 3 rd Edition haptr 2 Introduction to Logic ircuits (2.2. only) haptr 6 ombinationalircuit Building Blocks (6.6.5 only) OR your undrgraduat digital logic ttbook (chaptrs on combinational logic) Basic Logic Rviw som slids modiid rom: S. Dandamudi, Fundamntals o omputr Organization and Dsign 3 Ruls Basic Logic Gats (2input vrsions) I you bliv that you know a corrct answr, plas rais your hand I will slct on or mor studnts (indpndntly whthr an answr givn by th irst studnt is corrct or incorrct) Plas, idntiy yoursl by irst nam and giv an answr orrct answr = bonus point 5 6

Basic Logic Gats Gnralizd Simpl logic gats ND à i on or mor inputs is OR à i on or mor inputs is NND = ND + NOT i on or mor inputs is NOR = OR + NOT i on or mor input is XOR à i an odd numbr o inputs is XNOR à i an vn numbr o inputs is NND and NOR gats rquir wr transistors than ND and OR in standard MOS Functionality can b prssd by a truth tabl truth tabl lists output or ach possibl input combination Numbr o Functions Numbr o unctions With N logical variabls, w can din 2 2N unctions Som o thm ar usul ND, NND, NOR, XOR, Som ar not usul: Output is always Output is always Numbr o unctions dinition is usul in proving compltnss proprty 7 omplt St o Gats omplt sts st o gats is complt i w can implmnt any logic unction using only th typ o gats in th st Som ampl complt sts {ND, OR, NOT} Not a minimal complt st {ND, NOT} {OR, NOT} {NND} {NOR} Minimal complt st complt st with no rdundant lmnts. NND as a omplt St Proving NND gat is univrsal 9 Logic Functions ltrnativ Rprsntations o Logic Function Logic unctions can b prssd in svral ways: Truth tabl Logical prssions Graphical schmatic orm HDL cod Eampl: Majority unction Output is on whnvr majority o inputs is W us 3input majority unction Truth tabl B F HDL cod: Logical prssion orm F = B + B + Graphical schmatic orm F <= ( ND B) OR (B ND ) OR ( ND ) ; 2 2

Boolan lgbra Boolan idntitis Nam ND vrsion OR vrsion Idntity. = + = omplmnt. = + = ommutativ. y = y. + y = y + Distribution. (y+z) = y+z + (y. z) = (+y) (+z) Idmpotnt. = + = Null. = + = Boolan lgbra (cont d) Boolan idntitis (cont d) Nam ND vrsion OR vrsion Involution = ( ) bsorption. (+y) = + (. y) = ssociativ. (y. z) = (. y). z + (y + z) = ( + y) + z d Morgan (. y) = + y ( + y) =. y (d Morgan s law in particular is vry usul) 3 ltrnativ symbols or NND and NOR Driving Equivalnt Eprssions Using NND gats Gt an quivalnt prssion B + D = ( B + D) Using d Morgan s law B + D = ( ( B). ( D) ) an b gnralizd Eampl: Majority unction B + B + = (( B). (B ). () ) 5 6 Majority Function Using Othr Gats Majority unction ombinational Logic Building Blocks Som slids modiid rom: S. Dandamudi, Fundamntals o omputr Organization and Dsign S. Brown and Z. Vransic, "Fundamntals o Digital Logic" 7 3

Multiplrs 2to Multiplr log 2n slction inputs s s w w w w n inputs output (a) Graphical symbol (b) Truth tabl multiplr n binary inputs (binary input = bit input) log 2 n binary slction inputs binary output Function: on o n inputs is placd onto output alld nto multiplr w s w (c) Sumoproducts circuit w s w (d) ircuit with transmission gats 9 Sourc: Brown and Vransic 2 to Multiplr Multibit to Multiplr s s s s s s s s w w w 2 w 3 w w w 2 w 3 w w w 2 w 3 w w w 2 w 3 (a) Graphic symbol (b) Truth tabl (a) Graphic symbol (b) Truth tabl s w s w w 2 w 3 Whn drawing schmatics, can draw multibit multiplrs Eampl: bit to multiplr inputs (ach bits) output ( bits) 2 slction bits an also hav multibit 2to mus, 6to mus, tc. Sourc: Brown and Vransic (c) ircuit 2 22 bit to Multiplr Dcodrs s s w(7) w(7) w2(7) w3(7) (7) n inputs w y n 2 n w 2 n outputs s s w w w 2 w 3 = s s w(6) w(6) w2(6) w3(6) s s w() w() w2() w3() (6) () n bit to multiplr is composd o ight [bit] to multiplrs Enabl En Dcodr n binary inputs 2 n binary outputs Function: dcod ncodd inormation I nabl=, on output is assrtd high, th othr outputs ar assrtd low I nabl=, all outputs assrtd low Otn, nabl pin is not ndd (i.. th dcodr is always nabld) alld nto2 n dcodr an considr n binary inputs as a singl nbit input an considr 2 n binary outputs as a singl 2 n bit output Dcodrs ar otn usd or RM/ROM addrssing y 23 2

2to Dcodr En w w y 3 y 2 y y (a) Truth tabl w y 3 w y 2 y En y (b) Graphical symbol Problm Show how to implmnt a dcodr that rcognizs th ollowing rangs o a 6bit addrss, and gnrats th corrsponding nabl signals,,2,3: w w y y y 2 For in: FFF: DDFFF: EEFFF: FFFFF: ssrt 2 3 y 3 En Sourc: Brown and Vransic (c) Logic circuit 25 Dmultiplrs to Dmultiplr log 2n slction inputs input n outputs Dmultiplr binary input n binary outputs log 2n binary slction inputs Function: placs input onto on o n outputs, with th rmaining outputs assrtd low alld ton dmultiplr losly rlatd to dcodr an build ton dmultiplr rom log 2nton dcodr by using th dcodr's nabl signal as th dmultiplr's input signal, and using dcodr's input signals as th dmultiplr's slction input signals. 27 2 Encodrs to2 Encodr 2 n inputs w 2 n w y y n n outputs w 3 w 2 w w y y (a) Truth tabl Encodr 2 n binary inputs n binary outputs Function: ncods inormation into an nbit cod alld 2 n ton ncodr an considr 2 n binary inputs as a singl 2 n bit input an considr n binary output as a singl nbit output Encodrs only work whn actly on binary input is qual to w w y w 2 y w 3 29 (b) ircuit 3 5

Priority Encodrs to2 MSB Priority Encodr 2 n inputs w 2 n w y n n outputs y z "valid" output Priority Encodr 2 n binary inputs n binary outputs binary "valid" output Function: ncods inormation into an nbit cod basd on priority o inputs alld 2 n ton priority ncodr Priority ncodr allows or multipl inputs to hav a valu o '', as it ncods th input with th highst priority (MSB = highst priority, LSB = lowst priority) "valid" output indicats whn priority ncodr output is valid Priority ncodr is mor common than an ncodr w 3 w 2 w w y y z 3 32 bit Unsignd Multiplir bit Signd Multiplir a * c b U a * c b S 33 3 Unsignd vs. Signd Multiplication Logical Shit Right Unsignd 5 5 225 Signd >> L (3) (2) () () (3) (2) () 35 36 6

rithmtic Shit Right Fid Rotation >> (3) (2) () () (3) (3) (2) () <<< (3) (2) () () (2) () () (3) 37 3 bit Variabl Rotator Lt Rad Only Mmory (ROM) 3 B <<< B m DDR ROM DOUT n 39 Implmnting rbitrary ombinational Logic Using ROM Tristat Bur X5 X X3 X2 X Y DDR DOUT 5 ROM (a) tristat bur Z Z (c) Truth tabl = = (b) Equivalnt circuit 2 7

Four typs o Tristat Burs (a) (b) (c) (d) 3