Programmable Logic Devices

Size: px
Start display at page:

Download "Programmable Logic Devices"

Transcription

1 EG igital Logic Fundamentals /4/6 EG igital Logic Fundamentals Programmable Logic evices aback Izadi ivision of Engineering Programs Introduction Fuse Link E = blown fuse link E = F = + esign of ombinational Logic

2 EG igital Logic Fundamentals /4/6 asic PLs Programmable N block followed by a programmable OR block Programmable rray lock iagram for Sum of Products Form Inputs ense array of N gates Product terms ense array of OR gates Outputs asic PLs ll possible connections are available before programming esign of ombinational Logic

3 EG igital Logic Fundamentals /4/6 Programming a PL Unwanted connections are "blown" Short-hand notation so we don't have to draw all the wires! 3 = (, ) Y = (3) Z = (, 3) W = (,, ) Y Z W Y Z W Programmable onnection Fixed onnection lternative representation of PLs: PLE Fixed N array Programmable OR array What if you have lots of inputs? Programmable onnection Fixed onnection Y Z W esign of ombinational Logic 3

4 EG igital Logic Fundamentals /4/6 lternative representation of PLs: PL Programmable N array Fixed OR array given column of the OR array has access to only a subset of the possible product terms Programmable onnection Fixed onnection F = + F = + F F PLs with Four Product terms omplete the following: F = F = F3 = F4 = F F F3 F4 esign of ombinational Logic 4

5 EG igital Logic Fundamentals /4/6 lternative representation of PLs: PL Programmable N array Programmable OR array Programmable onnection Fixed onnection F = + ' ' F = ' + ' F F esign Example using PL Multiple functions of,, F = F = + + F3 = F4 = + + F5 = F6 = What is difference between Programmable rray Logic (PL) and Programmable Logic rray (PL)? F F F3 F4 F5 F6 esign of ombinational Logic 5

6 EG igital Logic Fundamentals /4/6 esign Example: to Gray ode onverter Truth Table W Minimized Functions: Y Z K-map for W K-maps K-map for W = + + = ' Y = + Z = ''' + + ' + ' ' K-map for Y K-map for Z ode onverter iscrete Gate Implementation Using SSI \ \ 3 W \ \ \ 3 5 \ \ 3 \ Z \ Y : 744 hex inverters,5: 74 quad -input NN 3: 74 t ri 3-input NN 4: 74 dual 4-input NN 4 SSI Packages vs. PL/PL Package! esign of ombinational Logic 6

7 EG igital Logic Fundamentals /4/6 nother Example: Magnitude omparator K-map for EQ K-map for NE K-map for L T K-map for GT EQ NE LT GT Key dvantage of PL: Shared Product Terms Example: F = + ' ' F = ' + F = ' ' + F3 = ' + Product t erm Personality Matrix Inputs Outputs F F F F 3 Reuse of t erms Input Side: = asserted in term = negated in term - = does not participate Output Side: = term connected to output = no connection to output Finding shared product term not that easy for large design. esign of ombinational Logic 7

8 EG igital Logic Fundamentals /4/6 ombinational Logic to 7 Segment isplay ontroller Problems PL Implementation ctual PL evice 6H8PL: 6 inputs 8 outputs First fuse numbers Increment Note: Fuse number = first fuse number + increment esign of ombinational Logic 8

9 EG igital Logic Fundamentals /4/6 to 7 Segment isplay ontroller on 6H8PL Increment First fuse numbers Note: Fuse number = first fuse number + increment What about FPG? Has millions of programmable gates organized into Logic locks Logic locks are interconnected using programmable switches. esign of ombinational Logic 9

10 EG igital Logic Fundamentals /4/6 What about FPG? Programmable interconnects using switch matrixes Several types of interconnects: short distance (local), long distances across chip, FPG s provide enormous design capabilities. esign of ombinational Logic

! Replace maxterm OR gates with NOR gates! Place compensating inversion at inputs of AND gate

! Replace maxterm OR gates with NOR gates! Place compensating inversion at inputs of AND gate Two-level logic using NN gates (cont d) ELE 4 igital Electronics Week : ombinational Logic Implementation! OR gate with inverted inputs is a NN gate " de Morgan's: ' ' = ( )'! Two-level NN-NN network "

More information

Simplification of two-level combinational logic

Simplification of two-level combinational logic ombinational logic optimization! lternate representations of oolean functions " cubes " karnaugh maps! Simplification " two-level simplification " exploiting don t cares " algorithm for simplification

More information

Simple Ladder Logic. Simple Ladder Logic. OR Operation. Chapter 2: Basic Ladder Logic Programming. Ladder Logic Learning objectives.

Simple Ladder Logic. Simple Ladder Logic. OR Operation. Chapter 2: Basic Ladder Logic Programming. Ladder Logic Learning objectives. OR Operation Chapter 2: asic Ladder Logic Programming Control ehavior: The light should be on when either switch is on (i.e., closed) or switch is on (closed). Otherwise it should be off Task: Implement

More information

CS Spring Combinational Examples - 1

CS Spring Combinational Examples - 1 S 5 - Spring 2 - ombinational Examples - ombinational Logic esign ase Studies General esign Procedure for ombinational Logic General design procedure Examples alendar subsstem to 7-segment displa controller

More information

Chapter 3 working with combinational logic

Chapter 3 working with combinational logic hapter 3 working with combinational logic ombinational Logic opyright 24, Gaetano orriello and Randy H. Katz Working with combinational logic Simplification two-level simplification exploiting don t cares

More information

A search for Compromises!

A search for Compromises! EET 310 Chapter 5 Lesson Notes () PL Categories R.L. Jones 11/6/2011 1 OF 5.5 Programmable Logic array types 5.5.1 The FPL PL s come in many varieties. The FPL type has two Programmable areas; the OR array

More information

Introduction to Actel FPGA Architecture

Introduction to Actel FPGA Architecture Introduction to ctel FPG rchitecture pplication Note 65 This overview of the different ctel device families covers the major architectural features in sufficient detail to ensure the reader is familiar

More information

System Design Choices

System Design Choices System esign hoices Programmable Logic PL e.g. Lattice ispgl22v10, tmel TF1502 PL Field Programmable Gate rray (FPG) e.g. ltera yclone III, Xilinx rtix-7/zync-7000 Semi-ustom esign Mask Programmable Gate

More information

Index A B C D. i-1

Index A B C D. i-1 ccumulating Fast Timer instruction, ccumulating Timer (TMR) instruction, ccumulator, ccumulator Instructions, liases, nalog Ioxes, 0 pprovals, SII onversion Table, G- SII In/Out and PRINT, SII Instructions,

More information

Introduction to CMOS VLSI Design. Programmable Logic. Peter Kogge Fall 2015

Introduction to CMOS VLSI Design. Programmable Logic. Peter Kogge Fall 2015 Introduction to MOS VLSI Design Programmable Logic Peter Kogge Fall 2015 Includes lecture slides by David Harris, Harvey Mudd ollege http://www.cmosvlsi.com/coursematerials.html Programmable Logic Slide

More information

PLC CommuniCations In This Chapter...

PLC CommuniCations In This Chapter... PL ommunications In This hapter... Introduction... PL ommunication Ports Specifications... LE Status Indicators... Steps to Using the LIK PL ommunications... Typical ommunications pplications... W-: om

More information

Chapter 3 Part 1 Combinational Logic Design

Chapter 3 Part 1 Combinational Logic Design Universit of Wisconsin - Madison EE/omp Sci 352 igital Sstems undamentals Kewal K. Saluja and Yu Hen Hu Spring 22 hapter 3 Part ombinational Logic esign Originals b: harles R. Kime and Tom Kamisnski Modified

More information

Review. Pipeline big-delay CL for faster clock Finite State Machines extremely useful You ll see them again in 150, 152 & 164

Review. Pipeline big-delay CL for faster clock Finite State Machines extremely useful You ll see them again in 150, 152 & 164 CS61C L17 Combinatorial Logic Blocks (1) inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture #17 Combinatorial Logic Blocks 2007-7-24 Scott Beamer, Instructor Review Pipeline big-delay CL

More information

Lecture 21: Combinational Circuits. Integrated Circuits. Integrated Circuits, cont. Integrated Circuits Combinational Circuits

Lecture 21: Combinational Circuits. Integrated Circuits. Integrated Circuits, cont. Integrated Circuits Combinational Circuits Lecture 21: Combinational Circuits Integrated Circuits Combinational Circuits Multiplexer Demultiplexer Decoder Adders ALU Integrated Circuits Circuits use modules that contain multiple gates packaged

More information

Lesson 22: Basic Graph Concepts

Lesson 22: Basic Graph Concepts Lesson 22: asic Graph oncepts msc 175 iscrete Mathematics 1. Introduction graph is a mathematical object that is used to model different relations between objects and processes: Linked list Flowchart of

More information

ORCA Series 3C and 3T Field-Programmable Gate Arrays

ORCA Series 3C and 3T Field-Programmable Gate Arrays Product rief January 22 OR Series 3 and 3T Field-Programmable Gate rrays Features High-performance, cost-effective,.35 µm and.3 µm 4-level metal technology (4- or 5-input look-up table delay of.2 ns with

More information

EECS Components and Design Techniques for Digital Systems. Lec 07 PLAs and FSMs 9/ Big Idea: boolean functions <> gates.

EECS Components and Design Techniques for Digital Systems. Lec 07 PLAs and FSMs 9/ Big Idea: boolean functions <> gates. Review: minimum sum-of-products expression from a Karnaugh map EECS 5 - Components and Design Techniques for Digital Systems Lec 7 PLAs and FSMs 9/2- David Culler Electrical Engineering and Computer Sciences

More information

EECS150, Fall 2004, Midterm 1, Prof. Culler. Problem 1 (15 points) 1.a. Circle the gate-level circuits that DO NOT implement a Boolean AND function.

EECS150, Fall 2004, Midterm 1, Prof. Culler. Problem 1 (15 points) 1.a. Circle the gate-level circuits that DO NOT implement a Boolean AND function. Problem 1 (15 points) 1.a. Circle the gate-level circuits that DO NOT implement a Boolean AND function. 1.b. Show that a 2-to-1 MUX is universal (i.e. that any Boolean expression can be implemented with

More information

Functional Block: Decoders

Functional Block: Decoders University of Wisconsin - Madison EE/omp Sci 352 Digital Systems Fundamentals harles R. Kime Section 2 Fall 2 hapter 3 ombinational Logic Design Part 2 Tom Kaminski & harles R. Kime harles Kime & Thomas

More information

Today. Comments about assignment Max 1/T (skew = 0) Max clock skew? Comments about assignment 3 ASICs and Programmable logic Others courses

Today. Comments about assignment Max 1/T (skew = 0) Max clock skew? Comments about assignment 3 ASICs and Programmable logic Others courses Today Comments about assignment 3-43 Comments about assignment 3 ASICs and Programmable logic Others courses octor Per should show up in the end of the lecture Mealy machines can not be coded in a single

More information

Review: Chip Design Styles

Review: Chip Design Styles MPT-50 Introduction to omputer Design SFU, Harbour entre, Spring 007 Lecture 9: Feb. 6, 007 Programmable Logic Devices (PLDs) - Read Only Memory (ROM) - Programmable Array Logic (PAL) - Programmable Logic

More information

Solutions for 3824 Midterm Exam 3/4/ Truth table. A B C Z

Solutions for 3824 Midterm Exam 3/4/ Truth table. A B C Z Solutions for 3824 Midterm Exam 3/4/04 1. Truth table. ----------- 0 0 0 1 0 0 1 1 0 1 0 0 0 1 1 0 1 0 0 0 1 0 1 0 1 1 0 1 1 1 1 0 2. When analyzing a circuit built with NN-gates, the easiest approach

More information

University of Technology

University of Technology University of Technology Lecturer: Dr. Sinan Majid Course Title: microprocessors 4 th year Lecture 5 & 6 Minimization with Karnaugh Maps Karnaugh maps lternate way of representing oolean function ll rows

More information

Student Name: University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Science

Student Name: University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Science University of alifornia at erkeley ollege of Engineering epartment of Electrical Engineering and omputer Science EES 5 all 2 R. H. Katz IRST MITERM EXMINTION Tuesday, 3 October 2 INSTRUTIONS RE THEM NOW!

More information

Specifying logic functions

Specifying logic functions CSE4: Components and Design Techniques for Digital Systems Specifying logic functions Instructor: Mohsen Imani Slides from: Prof.Tajana Simunic and Dr.Pietro Mercati We have seen various concepts: Last

More information

2 Combinational Logic

2 Combinational Logic 2 ombinational Logic O purblind race of miserable men, How many among us at this very hour o forge a lifelong trouble for ourselves, y taking true for false, and false for true! lfred, Lord Tennyson It

More information

EECS150 - Digital Design Lecture 3 - Field Programmable Gate Arrays (FPGAs) FPGA Overview

EECS150 - Digital Design Lecture 3 - Field Programmable Gate Arrays (FPGAs) FPGA Overview EECS150 - igital esign Lecture 3 - Field Programmable Gate rrays (FPGs) January 27, 2009 John Wawrzynek Spring 2009 EECS150 - Lec03-FPG Page 1 FPG Overview asic idea: two-dimensional array of logic blocks

More information

Programmable Logic Devices (PLDs)

Programmable Logic Devices (PLDs) Programmable Logic Devices (PLDs) 212: Digital Design I, week 13 PLDs basically store binary information in a volatile/nonvolatile device. Data is specified by designer and physically inserted (Programmed)

More information

Real Digital Problem Set #6

Real Digital Problem Set #6 Real igital Problem et #6. (2 points) ketch a block diagram for a magnitude comparator bit-slice circuit. Create K-maps to define the bit-slice circuit, and use them to find optimal logic equations. ketch

More information

Combinational Circuits Digital Logic (Materials taken primarily from:

Combinational Circuits Digital Logic (Materials taken primarily from: Combinational Circuits Digital Logic (Materials taken primarily from: http://www.facstaff.bucknell.edu/mastascu/elessonshtml/eeindex.html http://www.cs.princeton.edu/~cos126 ) Digital Systems What is a

More information

Boolean logic. Boolean Algebra. Introduction to Computer Yung-Yu Chuang NOT AND NOT

Boolean logic. Boolean Algebra. Introduction to Computer Yung-Yu Chuang NOT AND NOT oolean lgebra oolean logic ased on symbolic logic, designed by George oole oolean variables take values as or. oolean expressions created from: NOT, ND, OR Introduction to Computer ung-u Chuang with slides

More information

A Brief Introduction to Verilog Hardware Definition Language (HDL)

A Brief Introduction to Verilog Hardware Definition Language (HDL) www.realdigital.org A Brief Introduction to Verilog Hardware Definition Language (HDL) Forward Verilog is a Hardware Description language (HDL) that is used to define the structure and/or behavior of digital

More information

MECH 1500 DIGITAL FUNDAMENTALS AND PROGRAMMABLE LOGIC CONTROLLERS CLASSWORK MANUAL

MECH 1500 DIGITAL FUNDAMENTALS AND PROGRAMMABLE LOGIC CONTROLLERS CLASSWORK MANUAL MH 1500 IGITL FUNMNTLS N PROGRMML LOGI ONTROLLRS LSSWORK MNUL Table of ontents: Subject Page hapter 1 dditional Questions.. 2 hapter 2 dditional Questions.. 3 hapter 3 dditional Questions.. 4 hapter 4

More information

Chapter 9: Elementary Graph Algorithms Basic Graph Concepts

Chapter 9: Elementary Graph Algorithms Basic Graph Concepts hapter 9: Elementary Graph lgorithms asic Graph oncepts msc 250 Intro to lgorithms graph is a mathematical object that is used to model different situations objects and processes: Linked list Tree (partial

More information

Introduction to PEEL TM Arrays

Introduction to PEEL TM Arrays Features ntroduction to PEEL TM s Programmable Electrically Erasable s Programmable Electrically Erasable s Family of medium-density PLs Reprogrammable MOS EEPROM Technology 24, 28, 40 and 44 pins in P,

More information

Lay ay ut Design g R ules

Lay ay ut Design g R ules HPTER 5: Layout esign Rules Introduction ny circuit physical mask layout must conform to a set of geometric constraints or rules called as Layout esign rules before it can be manufactured using particular

More information

CS:APP Chapter 4 Computer Architecture Logic Design Randal E. Bryant Carnegie Mellon University

CS:APP Chapter 4 Computer Architecture Logic Design Randal E. Bryant Carnegie Mellon University S:PP hapter 4 omputer rchitecture Logic esign Randal E. Bryant arnegie Mellon University http://csapp.cs.cmu.edu S:PP Overview of Logic esign Fundamental Hardware Requirements ommunication How to get values

More information

CS2100 Computer Organisation Tutorial #8: MSI Components Answers to Selected Questions

CS2100 Computer Organisation Tutorial #8: MSI Components Answers to Selected Questions C Computer Organisation Tutorial #8: MI Components Answers to elete Questions. Realize the following funtion with (a) an 8: multiplexer, an (b) a 4: multiplexer using the first input variables as the seletor

More information

900MB Series. Analog Output Module. Four Analog Outputs. DC Current or DC Voltage. Description

900MB Series. Analog Output Module. Four Analog Outputs. DC Current or DC Voltage. Description 900M Series Modbus/ nalog Output Module Outputs (2) Four nalog Outputs urrent or Voltage Isolation Four iscrete Outputs Outputs (4) Modbus Outputs (2) 10-36V or 24V Power 917/918M Multi-hannel nalog Output

More information

Administrivia. CSE 370 Spring 2006 Introduction to Digital Design Lecture 9: Multilevel Logic

Administrivia. CSE 370 Spring 2006 Introduction to Digital Design Lecture 9: Multilevel Logic SE 370 Spring 2006 Introduction to igital esign Lecture 9: Multilevel Logic Last Lecture Introduction to Verilog Today Multilevel Logic Hazards dministrivia Hand in Homework #3 Homework #3 posted this

More information

INTRODUCTION TO FPGA ARCHITECTURE

INTRODUCTION TO FPGA ARCHITECTURE 3/3/25 INTRODUCTION TO FPGA ARCHITECTURE DIGITAL LOGIC DESIGN (BASIC TECHNIQUES) a b a y 2input Black Box y b Functional Schematic a b y a b y a b y 2 Truth Table (AND) Truth Table (OR) Truth Table (XOR)

More information

Programmable Logic Devices UNIT II DIGITAL SYSTEM DESIGN

Programmable Logic Devices UNIT II DIGITAL SYSTEM DESIGN Programmable Logic Devices UNIT II DIGITAL SYSTEM DESIGN 2 3 4 5 6 7 8 9 2 3 4 5 6 7 8 9 2 Implementation in Sequential Logic 2 PAL Logic Implementation Design Example: BCD to Gray Code Converter A B

More information

ENEL Digital Circuits Midterm Examination

ENEL Digital Circuits Midterm Examination Name: Lecture Section: L0 N. artley :-:50 L02 S. Norman, 2:-2:50 ENEL 353 - igital ircuits Midterm Examination Wednesday, October 30, 203 Instructions: Time allowed is 90 minutes. In order to minimize

More information

Implementing LED Drivers in MAX and MAX II Devices. Introduction. Commercial LED Driver Chips

Implementing LED Drivers in MAX and MAX II Devices. Introduction. Commercial LED Driver Chips Implementing LE rivers in MAX and MAX II evices October 2008 AN-286-2.3 Introduction iscrete LE driver chips are common on many system boards. Altera MAX II, MAX 7000B, MAX 7000A, MAX 3000A, and MAX 7000S

More information

Controller Implementation--Part I. Cascading Edge-triggered Flip-Flops. Clock Skew. Cascading Edge-triggered Flip-Flops. Why Gating of Clocks is Bad!

Controller Implementation--Part I. Cascading Edge-triggered Flip-Flops. Clock Skew. Cascading Edge-triggered Flip-Flops. Why Gating of Clocks is Bad! Controller Implementation--Part I lternative controller FSM implementation approaches based on: Classical Moore and Mealy machines Time state: ivide and Jump counters Microprogramming (ROM) based approaches»

More information

EXPERIMENT #8: BINARY ARITHMETIC OPERATIONS

EXPERIMENT #8: BINARY ARITHMETIC OPERATIONS EE 2 Lab Manual, EE Department, KFUPM EXPERIMENT #8: BINARY ARITHMETIC OPERATIONS OBJECTIVES: Design and implement a circuit that performs basic binary arithmetic operations such as addition, subtraction,

More information

60-265: Winter ANSWERS Exercise 4 Combinational Circuit Design

60-265: Winter ANSWERS Exercise 4 Combinational Circuit Design 60-265: Winter 2010 Computer Architecture I: Digital Design ANSWERS Exercise 4 Combinational Circuit Design Question 1. One-bit Comparator [ 1 mark ] Consider two 1-bit inputs, A and B. If we assume that

More information

of integration y e.g. TTL packages: Data Book for 100 s of different parts y Map your circuit to the Data Book parts

of integration y e.g. TTL packages: Data Book for 100 s of different parts y Map your circuit to the Data Book parts x x x x x x volution of Implementation Technologies Gate rra Technolog (IM - s) iscrete devices: relas, transistors (s-s) trend toward iscrete logic gates (s-s) higher levels Integrated circuits (s-s)

More information

Department of Electrical Engineering McGill University ECSE 221 Introduction to Computer Engineering Assignment 2 Combinational Logic

Department of Electrical Engineering McGill University ECSE 221 Introduction to Computer Engineering Assignment 2 Combinational Logic Department of Electrical Engineering McGill University ECSE 221 Introduction to Computer Engineering Assignment 2 Combinational Logic Question 1: Due October 19 th, 2009 A convenient shorthand for specifying

More information

Appendix. System Functions. In This Appendix...

Appendix. System Functions. In This Appendix... s ppendix In This ppendix... s... - Write all Registers (L-PL)... - Write One Register (Ioxes)... - Write One Register (L-PL)... - Read Error ode (Ioxes)... - Read Error ode (L-PL)... - ppendix : s s s

More information

Designing Information Devices and Systems II Spring 2018 J. Roychowdhury and M. Maharbiz Discussion 1A

Designing Information Devices and Systems II Spring 2018 J. Roychowdhury and M. Maharbiz Discussion 1A EEC 16B esigning Information evices and ystems II pring 2018 J. Roychowdhury and M. Maharbiz iscussion 1A 1 igit Bases (N) p is used to indicate that the number N is expressed in base p. For example, (N)

More information

Moore EECS150. Implement of Processor FSMs. Memory-Register Interface Timing. Processor / Memory Interface. Processor Signal FLow

Moore EECS150. Implement of Processor FSMs. Memory-Register Interface Timing. Processor / Memory Interface. Processor Signal FLow Moore RES PC EECS5 IF PC MR, PC + PC Section Controller Implementations Fall Note capture of MBR in these states IF IF IF3 O MR Mem,,, Mem MBR MBR IR = = = IR MR, L IR MR ST C MBR MR Mem, MR Mem, L, ST,,,

More information

Chapter 5 12/2/2013. Objectives. Computer Systems Organization. Objectives. Objectives (continued) Introduction. INVITATION TO Computer Science 1

Chapter 5 12/2/2013. Objectives. Computer Systems Organization. Objectives. Objectives (continued) Introduction. INVITATION TO Computer Science 1 Chapter 5 Computer Systems Organization Objectives In this chapter, you will learn about: The components of a computer system Putting all the pieces together the Von Neumann architecture The future: non-von

More information

2B 52 AB CA 3E A1 +29 A B C. CS120 Fall 2018 Final Prep and super secret quiz 9

2B 52 AB CA 3E A1 +29 A B C. CS120 Fall 2018 Final Prep and super secret quiz 9 S2 Fall 28 Final Prep and super secret quiz 9 ) onvert 8-bit (2-digit) 2 s complement hex values: 4-29 inary: Hex: x29 2) onvert 8-bit 2 s complement hex to decimal: x3 inary: xe5 Decimal: 58 Note 3*6+

More information

6.1 Combinational Circuits. George Boole ( ) Claude Shannon ( )

6.1 Combinational Circuits. George Boole ( ) Claude Shannon ( ) 6. Combinational Circuits George Boole (85 864) Claude Shannon (96 2) Digital signals Binary (or logical ) values: or, on or off, high or low voltage Wires. Propagate logical values from place to place.

More information

Implementing LED Drivers in MAX Devices

Implementing LED Drivers in MAX Devices Implementing LE rivers in MAX evices ecember 2002, ver. 1.0 Application Note 286 Introduction Commercial LE river Chips iscrete light-emitting diode (LE) driver chips are common on many system boards.

More information

Designing Information Devices and Systems II Fall 2017 Miki Lustig and Michel Maharbiz Discussion 1B

Designing Information Devices and Systems II Fall 2017 Miki Lustig and Michel Maharbiz Discussion 1B EEC 16B esigning Information evices and ystems II Fall 2017 Miki Lustig and Michel Maharbiz iscussion 1B igit Bases (N) p is used to indicate that the number N is expressed in base p. For example, (N)

More information

Slide Set 1. for ENEL 339 Fall 2014 Lecture Section 02. Steve Norman, PhD, PEng

Slide Set 1. for ENEL 339 Fall 2014 Lecture Section 02. Steve Norman, PhD, PEng Slide Set 1 for ENEL 339 Fall 2014 Lecture Section 02 Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary Fall Term, 2014 ENEL 353 F14 Section

More information

Objectives: 1. Design procedure. 2. Fundamental circuits. 1. Design procedure

Objectives: 1. Design procedure. 2. Fundamental circuits. 1. Design procedure Objectives: 1. Design procedure. 2. undamental circuits. 1. Design procedure Design procedure has five steps: o Specification. o ormulation. o Optimization. o Technology mapping. o Verification. Specification:

More information

Incompletely Specified Functions with Don t Cares 2-Level Transformation Review Boolean Cube Karnaugh-Map Representation and Methods Examples

Incompletely Specified Functions with Don t Cares 2-Level Transformation Review Boolean Cube Karnaugh-Map Representation and Methods Examples Lecture B: Logic Minimization Incompletely Specified Functions with Don t Cares 2-Level Transformation Review Boolean Cube Karnaugh-Map Representation and Methods Examples Incompletely specified functions

More information

Optimized Reconfigurable Cell Array (ORCA ) OR3Cxxx/OR3Txxx Series Field-Programmable Gate Arrays

Optimized Reconfigurable Cell Array (ORCA ) OR3Cxxx/OR3Txxx Series Field-Programmable Gate Arrays Preliminary Product rief November 997 Optimized Reconfigurable ell rray (OR ) OR3xxx/OR3Txxx Series Field-Programmable Gate rrays Features High-performance, cost-effective,.35 µm 4-level metal technology,

More information

Abstraction of State Elements. Sequential Logic Implementation. Forms of Sequential Logic. Finite State Machine Representations

Abstraction of State Elements. Sequential Logic Implementation. Forms of Sequential Logic. Finite State Machine Representations Sequential ogic Implementation! Models for representing sequential circuits " Finite-state machines (Moore and Mealy) " epresentation of memory (states) " hanges in state (transitions)! Design procedure

More information

Introduction. Synchronous vs. Asynchronous Memory. Converting Memory from Asynchronous to Synchronous for Stratix & Stratix GX Designs

Introduction. Synchronous vs. Asynchronous Memory. Converting Memory from Asynchronous to Synchronous for Stratix & Stratix GX Designs Converting from synchronous to Synchronous for Stratix & Stratix GX esigns November 2002, ver. 2.0 pplication Note 210 Introduction The Stratix TM and Stratix GX device families provide a unique memory

More information

CO Computer Architecture and Programming Languages CAPL. Lecture 9

CO Computer Architecture and Programming Languages CAPL. Lecture 9 CO20-320241 Computer Architecture and Programming Languages CAPL Lecture 9 Dr. Kinga Lipskoch Fall 2017 A Four-bit Number Circle CAPL Fall 2017 2 / 38 Functional Parts of an ALU CAPL Fall 2017 3 / 38 Addition

More information

PowerFlex 523 AC Drive

PowerFlex 523 AC Drive PowerFlex 523 A rive PowerFlex 523 A drives are designed to help reduce installation and configuration time with an innovative modular design while providing just enough control for your application. These

More information

EE292: Fundamentals of ECE

EE292: Fundamentals of ECE EE292: Fundamentals of ECE Fall 2012 TTh 10:00-11:15 SEB 1242 Lecture 22 121115 http://www.ee.unlv.edu/~b1morris/ee292/ 2 Outline Review Binary Number Representation Binary Arithmetic Combinatorial Logic

More information

Chapter. F0-04AD-2, 4-Channel Analog Voltage Input. In This Chapter...

Chapter. F0-04AD-2, 4-Channel Analog Voltage Input. In This Chapter... F0-0-, -hannel nalog Voltage Input hapter In This hapter... Module Specifications... Setting the Module Jumpers... onnecting and isconnecting the Field Wiring... Wiring iagram... Module Operation... Special

More information

EECS 150 Homework 7 Solutions Fall (a) 4.3 The functions for the 7 segment display decoder given in Section 4.3 are:

EECS 150 Homework 7 Solutions Fall (a) 4.3 The functions for the 7 segment display decoder given in Section 4.3 are: Problem 1: CLD2 Problems. (a) 4.3 The functions for the 7 segment display decoder given in Section 4.3 are: C 0 = A + BD + C + BD C 1 = A + CD + CD + B C 2 = A + B + C + D C 3 = BD + CD + BCD + BC C 4

More information

AMD actual programming and testing on a system board. We will take a simple design example and go through the various stages of this design process.

AMD actual programming and testing on a system board. We will take a simple design example and go through the various stages of this design process. actual programming and testing on a system board. We will take a simple design example and go through the various stages of this design process. Conceptualize A Design Problem Select Device Implement Design

More information

Introduction to Digital Logic Missouri S&T University CPE 2210 Hardware Implementations

Introduction to Digital Logic Missouri S&T University CPE 2210 Hardware Implementations Introduction to Digital Logic Missouri S&T University CPE 2210 Hardware Implementations Egemen K. Çetinkaya Egemen K. Çetinkaya Department of Electrical & Computer Engineering Missouri University of Science

More information

6.1 Combinational Circuits. George Boole ( ) Claude Shannon ( )

6.1 Combinational Circuits. George Boole ( ) Claude Shannon ( ) 6. Combinational Circuits George Boole (85 864) Claude Shannon (96 2) Signals and Wires Digital signals Binary (or logical ) values: or, on or off, high or low voltage Wires. Propagate digital signals

More information

13 Entering Programs

13 Entering Programs Entering Ladder Programs Purpose of Section Handheld Programmer Key Sequences Instruction Overview This section will demonstrate how to use the Handheld programmer for mnemonic programming. The HPP is

More information

Chapter 3. Gate-Level Minimization. Outlines

Chapter 3. Gate-Level Minimization. Outlines Chapter 3 Gate-Level Minimization Introduction The Map Method Four-Variable Map Five-Variable Map Outlines Product of Sums Simplification Don t-care Conditions NAND and NOR Implementation Other Two-Level

More information

CS.17.A.MachineI.Overview

CS.17.A.MachineI.Overview P R T I I : L G O R I T H M S, M H I N E S, a n d T H E O R Y P R T I I : L G O R I T H M S, M H I N E S, a n d T H E O R Y omputer Science 7. omputing Machine omputer Science 7. omputing Machine Overview

More information

Chapter 13 Programmable Logic Device Architectures

Chapter 13 Programmable Logic Device Architectures Chapter 13 Programmable Logic Device Architectures Chapter 13 Objectives Selected areas covered in this chapter: Describing different categories of digital system devices. Describing different types of

More information

Alternative controller FSM implementation approaches based on:

Alternative controller FSM implementation approaches based on: Overview lternative controller FSM implementation approaches based on: classical Moore and Mealy machines jump counters microprogramming (ROM) based approaches branch sequencers horizontal microcode vertical

More information

Introduction. Textbook and Reference book. Learning outcomes. Information Delivery. Introduction to Logic Design. Course Descriptions

Introduction. Textbook and Reference book. Learning outcomes. Information Delivery. Introduction to Logic Design. Course Descriptions S411 igital System esign r. rshad ziz Introduction ourse escriptions digital design course for undergraduate students in EE/EL Language-based design method: a new approach to digital circuits/systems design,

More information

Lecture 10: Combinational Circuits

Lecture 10: Combinational Circuits Computer Architecture Lecture : Combinational Circuits Previous two lectures.! TOY machine. Net two lectures.! Digital circuits. George Boole (85 864) Claude Shannon (96 2) Culminating lecture.! Putting

More information

A Comparison of Self-Timed Design using FPGA, CMOS, and GaAs Technologies

A Comparison of Self-Timed Design using FPGA, CMOS, and GaAs Technologies omparison of Self-Timed Design using FPG, MOS, and Gas Technologies E. runvand N. Michell K. Smith Dept. of omputer Science, University of Utah Salt Lake ity, UT, 84112 bstract synchronous or self-timed

More information

Overview COMP Microprocessors and Embedded Systems. Lectures 14: Making Decisions in C/Assembly Language II

Overview COMP Microprocessors and Embedded Systems. Lectures 14: Making Decisions in C/Assembly Language II OMP 3221 Microprocessors and Embedded Systems Lectures 14: Making Decisions in /Assembly Language II Overview ompare instruction mechanism Flag setting Instructions onditional Instructions onclusion http://www.cse.unsw.edu.au/~cs3221

More information

Lecture (05) Boolean Algebra and Logic Gates

Lecture (05) Boolean Algebra and Logic Gates Lecture (05) Boolean Algebra and Logic Gates By: Dr. Ahmed ElShafee ١ Minterms and Maxterms consider two binary variables x and y combined with an AND operation. Since eachv ariable may appear in either

More information

Chapter. System design and. configuration. In This Chapter

Chapter. System design and. configuration. In This Chapter hapter System design and configuration In This hapter L0 System esign Strategies... Module Placement... Power udgeting... onfiguring the L0 s omm Ports... onnecting to MOUS and irectnet Networks... Non

More information

ECOM 4311 Digital Systems Design

ECOM 4311 Digital Systems Design ECOM4311 Digital Systems Design ECOM 4311 Digital Systems Design Eng. Monther busultan Computer Engineering Dept. Islamic University of Gaza genda 1. History of Digital Design pproach 2. HDLs 3. Design

More information

Ace PLCs. Velocio s Ace PLCs

Ace PLCs. Velocio s Ace PLCs Ace PLs Velocio s Ace PLs Ace PLs are members of the Velocio s groundbreaking series of programmable logic controllers. These PLs introduce revolutionary new concepts, capabilities, performance and ease

More information

Follow-up question: now, comment on what each of these acronyms actually means, going beyond a mere recitation of the definition.

Follow-up question: now, comment on what each of these acronyms actually means, going beyond a mere recitation of the definition. Question 1 Define the following acronyms as they apply to digital logic circuits: ASIC PAL PLA PLD CPLD FPGA file 03041 Answer 1 ASIC: Application-Specific Integrated Circuit PAL: Programmable Array Logic

More information

CS150 Spring 98 R. Newton & K. Pister 1. Common Representations Used in the Design Process. Overall Sequential Design Flow

CS150 Spring 98 R. Newton & K. Pister 1. Common Representations Used in the Design Process. Overall Sequential Design Flow Outline Last time: Review State Tables & State Transition iagrams Implementation Using Flip-Flops Machine Equivalence Incompletely Specified Machines State Assignment & State Coding Schemes esign Example:

More information

Logic Design (Part 2) Combinational Logic Circuits (Chapter 3)

Logic Design (Part 2) Combinational Logic Circuits (Chapter 3) Digital Logic Circuits Logic Design (Part ) Combinational Logic Circuits (Chapter 3) ² We saw how we can build the simple logic gates using transistors ² Use these gates as building blocks to build more

More information

Overview. CSE372 Digital Systems Organization and Design Lab. Hardware CAD. Two Types of Chips

Overview. CSE372 Digital Systems Organization and Design Lab. Hardware CAD. Two Types of Chips Overview CSE372 Digital Systems Organization and Design Lab Prof. Milo Martin Unit 5: Hardware Synthesis CAD (Computer Aided Design) Use computers to design computers Virtuous cycle Architectural-level,

More information

For full product information, visit Use the SpeedSPEC Code for quick access to the specific web page.

For full product information, visit   Use the SpeedSPEC Code for quick access to the specific web page. Safety Light urtains F3SJ- F3SJ For full product information, visit www.sti.com. Use the SpeedSP ode for quick access to the specific web page. Safety Light urtains Fast and easy installation Resolution:

More information

Simplification of Boolean Functions

Simplification of Boolean Functions COM111 Introduction to Computer Engineering (Fall 2006-2007) NOTES 5 -- page 1 of 5 Introduction Simplification of Boolean Functions You already know one method for simplifying Boolean expressions: Boolean

More information

Universal SAS and ACP Cabling Guide

Universal SAS and ACP Cabling Guide IM System Storage N series Universal SS and P abling Guide G27-3919-02 ontents Preface................................ v Supported features............................. v Websites................................

More information

Chapter. BRX Do-more! Designer. Getting Started. In This Chapter...

Chapter. BRX Do-more! Designer. Getting Started. In This Chapter... RX o-more! esigner Getting Started hapter In This hapter... Overview... - efore You egin... - RX o-more! esigner System Requirements... - Step : Install o-more! esigner Software... - Step : Launch the

More information

This Unit: Digital Logic & Hdw Description. CIS 371 Computer Organization and Design. Motivation: Implementing an ISA. Readings

This Unit: Digital Logic & Hdw Description. CIS 371 Computer Organization and Design. Motivation: Implementing an ISA. Readings This Unit: igital Logic & Hdw escription CI 371 Computer Organization and esign pp pp pp ystem software Mem CPU I/O Transistors & frabrication igital logic basics Focus on useful components Hardware design

More information

ECEN 468 Advanced Logic Design

ECEN 468 Advanced Logic Design ECEN 468 Advanced Logic Design Lecture 26: Verilog Operators ECEN 468 Lecture 26 Operators Operator Number of Operands Result Arithmetic 2 Binary word Bitwise 2 Binary word Reduction 1 Bit Logical 2 Boolean

More information

Lecture 7. Summary of two-level combinational-logic. Ways of specifying circuits. Solving combinational design problems. Verilog versus VHDL

Lecture 7. Summary of two-level combinational-logic. Ways of specifying circuits. Solving combinational design problems. Verilog versus VHDL Lecture 7 Summary of two-level combinational-logic Logistics Homework due today Homework out today due next Wednesday First midterm a week Friday: Friday Jan 0 Will cover up to the of Multiplexers/DeMultiplexers

More information

STrIde SITeLInk PLaTform In this Chapter... Overview Getting started User Interface Registering Your Device...

STrIde SITeLInk PLaTform In this Chapter... Overview Getting started User Interface Registering Your Device... STRIE SiteLink Platform In this hapter... hapter Overview... - ata Fair Use Policy... - Getting started... - reate a User ccount... - Login... - hoose ompany... - User Interface... - Registering Your evice...

More information

Lecture Topics ECE 341. Lecture # 6. CLA Delay Calculation. CLA Fan-in Limitation

Lecture Topics ECE 341. Lecture # 6. CLA Delay Calculation. CLA Fan-in Limitation EE 34 Lecture # 6 Instructor: Zeshan hishti zeshan@pdx.edu October 5, 24 Lecture Topics Design of Fast dders arry Looakaheaddders (L) Blocked arry-lookahead dders ultiplication of Unsigned Numbers rray

More information

Programmable logic technology

Programmable logic technology Programmable logic technology This worksheet and all related files are licensed under the Creative Commons Attribution License, version 1.0. To view a copy of this license, visit http://creativecommons.org/licenses/by/1.0/,

More information

Combinational Circuits

Combinational Circuits Combinational Circuits Q. What is a combinational circuit? A. Digital: signals are or. A. No feedback: no loops. analog circuits: signals vary continuously sequential circuits: loops allowed (stay tuned)

More information

Slide Set 1. for ENEL 353 Fall Steve Norman, PhD, PEng. Electrical & Computer Engineering Schulich School of Engineering University of Calgary

Slide Set 1. for ENEL 353 Fall Steve Norman, PhD, PEng. Electrical & Computer Engineering Schulich School of Engineering University of Calgary Slide Set 1 for ENEL 353 Fall 2017 Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary Fall Term, 2017 SN s ENEL 353 Fall 2017 Slide Set 1 slide

More information