Lab #15: Introduction to Computer Aided Design

Similar documents
Overview. Multiplexor. cs281: Introduction to Computer Systems Lab02 Basic Combinational Circuits: The Mux and the Adder

Combinational Logic Trainer Lab Manual

Logic Gate Level. Part 2

The Karnaugh Map COE 202. Digital Logic Design. Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals

The course web site s notes entitled Switches, Gates and Circuits which can be found at will be useful to you throughout the lab.

Chapter 1: Logic systems

Laboratory 3 Measuring Capacitor Discharge with the MicroBLIP

first name (print) last name (print) brock id (ab17cd) (lab date)

University of Toronto Faculty of Applied Science and Engineering Department of Electrical and Computer Engineering Midterm Examination

Digital electronic systems are designed to process voltage signals which change quickly between two levels. Low time.

RC Circuits. 1. Designing a time delay circuit. Introduction. In this lab you will explore RC circuits. Introduction

1.1. Unit 1. Circuit Basics KVL, KCL, Ohm's Law LED Outputs Buttons/Switch Inputs

Exercise 1: RC Time Constants

ECE 2210 Final given: Spring 15 p1

Designing Information Devices and Systems II Fall 2017 Miki Lustig and Michel Maharbiz Homework 1. This homework is due September 5, 2017, at 11:59AM.

ECE 220 Laboratory 4 Volt Meter, Comparators, and Timer

Digital Electronics H H

1.10 (a) Function of AND, OR, NOT, NAND & NOR Logic gates and their input/output.

University of Florida EEL 3701 Fall 2014 Dr. Eric. M. Schwartz Department of Electrical & Computer Engineering Wednesday, 15 October 2014

Laboratory II. Exploring Digital Logic

2. Associative Law: A binary operator * on a set S is said to be associated whenever (A*B)*C = A*(B*C) for all A,B,C S.

CMOS Technology Worksheet

Experiment 7: Magnitude comparators

DIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA

CARLETON UNIVERSITY. X = Y 0 0 X > Y 1 0 X < Y 0 1 never 1 1 happens. Examples

Computer Organization I. Lecture 13: Design of Combinational Logic Circuits

11.1 As mentioned in Experiment 10, sequential logic circuits are a type of logic circuit where the output of

University of Florida EEL 3701 Summer 2015 Dr. Eric. M. Schwartz Department of Electrical & Computer Engineering Tuesday, 30 June 2015

2005 AP PHYSICS C: ELECTRICITY AND MAGNETISM FREE-RESPONSE QUESTIONS

Examination paper for TFY4185 Measurement Technique/ Måleteknikk

Computer Science 324 Computer Architecture Mount Holyoke College Fall Topic Notes: Digital Logic

ES205 Analysis and Design of Engineering Systems: Lab 1: An Introductory Tutorial: Getting Started with SIMULINK

University of Florida EEL 3701 Fall 1996 Dr. Eric M. Schwartz

Electrical Circuits. Winchester College Physics. makptb. c D. Common Time man. 3rd year Revision Test

2009 Spring CS211 Digital Systems & Lab CHAPTER 2: INTRODUCTION TO LOGIC CIRCUITS

Class #12: Experiment The Exponential Function in Circuits, Pt 1

Lecture 6: Time-Dependent Behaviour of Digital Circuits

Boolean algebra. Examples of these individual laws of Boolean, rules and theorems for Boolean algebra are given in the following table.

DIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA

EECS 141: FALL 05 MIDTERM 1

CSE 140L Spring 2010 Lab 1 Assignment Due beginning of the class on 14 th April

of Digital Electronics

Chapter 9. Estimating circuit speed. 9.1 Counting gate delays

Intro To Digital Logic

Name (print): Lab (circle): W8 Th8 Th11 Th2 F8. θ (radians) θ (degrees) cos θ sin θ π/ /2 1/2 π/4 45 2/2 2/2 π/3 60 1/2 3/2 π/

EE213, Spr 2017 HW#3 Due: May 17 th, in class. Figure 1

Schedule. ECEN 301 Discussion #25 Final Review 1. Date Day Class No. 1 Dec Mon 25 Final Review. Title Chapters HW Due date. Lab Due date.

AC Circuits Homework Set

Department of Electrical Engineering and Computer Sciences University of California, Berkeley. Final Exam Solutions

Floating Point Representation and Digital Logic. Lecture 11 CS301

SC125MS. Data Sheet and Instruction Manual. ! Warning! Salem Controls Inc. Stepper Motor Driver. Last Updated 12/14/2004

ISSP User Guide CY3207ISSP. Revision C

School of Computer Science and Electrical Engineering 28/05/01. Digital Circuits. Lecture 14. ENG1030 Electrical Physics and Electronics

Combinational logic systems

Boolean Algebra & Digital Logic

ENGR4300 Fall 2005 Test 3A. Name. Section. Question 1 (25 points) Question 2 (25 points) Question 3 (25 points) Question 4 (25 points)

Connecticut Common Core Algebra 1 Curriculum. Professional Development Materials. Unit 8 Quadratic Functions

CMSC 313 Lecture 17. Focus Groups. Announcement: in-class lab Thu 10/30 Homework 3 Questions Circuits for Addition Midterm Exam returned

Digital Electronics Final Examination. Part A

Building a Computer Adder

Binary addition (1-bit) P Q Y = P + Q Comments Carry = Carry = Carry = Carry = 1 P Q

Implementation of Boolean Logic by Digital Circuits

ENG2410 Digital Design Combinational Logic Circuits

Foundations of Computation

ENGR4300 Fall 2005 Test 3S. Name solution. Section. Question 1 (25 points) Question 2 (25 points) Question 3 (25 points) Question 4 (25 points)

Review Getting the truth table

Z = F(X) Combinational circuit. A combinational circuit can be specified either by a truth table. Truth Table

Simplifying Logic Circuits with Karnaugh Maps

ECE 342 Electronic Circuits. Lecture 34 CMOS Logic

T02 Tutorial Slides for Week 6

CS/COE0447: Computer Organization and Assembly Language

CS 226: Digital Logic Design

EXEMPLAR NATIONAL CERTIFICATE (VOCATIONAL) ELECTRICAL PRINCIPLES AND PRACTICE NQF LEVEL 3 ( ) (X-Paper) 09:00 12:00

COMPUTER ENGINEERING PROGRAM

Learning Objectives 10/7/2010. CE 411 Digital System Design. Fundamental of Logic Design. Review the basic concepts of logic circuits. Dr.

ECE2210 Final given: Spring 08

Contents. Chapter 3 Combinational Circuits Page 1 of 36

CSE 20 DISCRETE MATH. Fall

EXPERIMENT #4: SIMPLIFICATION OF BOOLEAN FUNCTIONS

UNIVERSITY OF CALIFORNIA, BERKELEY College of Engineering Department of Electrical Engineering and Computer Sciences

1 Boolean Algebra Simplification

Unit 3 Session - 9 Data-Processing Circuits

BE 3600 BIOMEDICAL INSTRUMENTATION (LAB) - WEEK 2

CHAPTER 7. Exercises 17/ / /2 2 0

Numbers & Arithmetic. Hakim Weatherspoon CS 3410, Spring 2012 Computer Science Cornell University. See: P&H Chapter , 3.2, C.5 C.

Chapter 2: Boolean Algebra and Logic Gates

Department of Electrical Engineering and Computer Sciences University of California, Berkeley. Final Exam: Friday, August 10, 2012

Digital logic signals

Digital logic signals

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

ECE/CS 250: Computer Architecture. Basics of Logic Design: Boolean Algebra, Logic Gates. Benjamin Lee

Lab 4 CAPACITORS & RC CIRCUITS

ECE/CS 250 Computer Architecture

PHY222 - Lab 7 RC Circuits: Charge Changing in Time Observing the way capacitors in RC circuits charge and discharge.

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

EGC221: Digital Logic Lab

Combinational Logic. By : Ali Mustafa

Chapter 3 Combinational Logic Design

Part 1: Digital Logic and Gates. Analog vs. Digital waveforms. The digital advantage. In real life...

ECE 250 / CPS 250 Computer Architecture. Basics of Logic Design Boolean Algebra, Logic Gates

Transcription:

Lab #15: Introduction to Computer Aided Design Revision: 02 Nov 2016 Print Name: Section: GETTING FAMILIAR WITH YOUR BASYS3 DIGILAB BOARD. Problem 1: (26 points) Visually inspect the Digilab board, enter the number of components in the blanks for all entries. (Get to know the board.) COUNT ONLY INSTALLED DEVICES! Some positions are empty. count item count item resistors (Rx) capacitors (Cx) integrated circuits (ICx) connectors (e.g J8 & JD) LEDs (LDx) jumpers (e.g. JP4 & J7) 7-segment display digits pushbutton switches slide switches diodes (Dx) inductors (Lx) crystal oscillator (X1) transistors (Qx) Problem 2: (16 points) Complete the following test procedure for the Digilab board, circling Y (for Yes) or N (for No) for all entries. Manual Test Procedure Section 1. Power-on test. Connect USB cable to the board and to your computer. Locate JP2, set shunt to USB position (power from USB). 1.1 Proper USB cable obtained Y N 1.2 Power-on LED illuminates brightly Y N Section 2. Manual tests 2.1 red power LED illuminates when power switch is in the on position Y N When program button pressed, green done LED goes out and amber 2.2 busy LED comes on. When button is released, the LEDs return to their initial states after a brief delay. Section 3. Automated tests (diagnostic program running at initial power up). 3.1 The 4 display digits count 0 9 with no dark segments Y N 3.2 All buttons function correctly (BTNx) Y N 3.3 All switches function correctly (sw0-sw15) Y N 3.4 LEDs function correctly (led0-led15) Y N Y N

Lab #15 Submission Form Page 2 Problem 3: (8 points) Create a truth table from simulation data. The following simulation shows the logic states of the 3 inputs and of the output as functions of time. The green trace shows the states of each signal at different points in time. Naturally there are only two states for each. When the green trace is low, the state is 0 (zero), when it is high, the state is 1. Thus the far left end of the trace shows a=0, b=0, c=0, and y=0. Proceeding to the right, we see that a changes state so that we then have a=1, b=0, c=0, and y=0. Continuing to the right, the next change gives us a=0, b=1, c=0, and y=0. The entire truth table can be read off such a representation of the states of the system provided that enough combinations are displayed. The time dependence is not important here, but it gives us a simple way to see the output voltage at all possible combinations of the input voltages. Create a truth table that corresponds to the simulation shown above. Show all input and output values in the truth table, and sketch a logic circuit that could have been used to create the waveform. A B C Y 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1

Lab #15 Submission Form Page 3 Problem 4: (15 points) Use the Vivado Design Suite to create separate VHDL code blocks for each of the following logic statements. Be sure to assign both inputs and outputs so they match the ports defined in the constraints file (XDC file). Also connect A, B, and C to outputs so you can more easily troubleshoot your circuit. For testing, assign the inputs A, B, & C to sw0, sw1, & sw2, respectively. Assign the outputs A, B, & C to led0, led1, & led2, respectively, and the remaining output to led3. When the circuits have been completed and simulated, print, and attach a copy of each VHDL code block & XDC file to your lab report. 1) Y = A C + AB C 2) F = BC + A BC + A C 3) G = (A+B+C)(A +C )(B +C ) demo date: TA initials: Problem 5: (15 points) Adapt the three VHDL code blocks from problems 4a, 4b, and 4c as lower level modules and use them in a new top-level VHDL code block. Include three inputs (A, B, C; sw0-sw2) and six outputs (A, B, C, Y, F, G; led0-led5), and Use the same A, B, and C signals as inputs for the instances of each lower level module. Program the Basys3 board to verify you have a working implementation. Demo this circuit to the lab assistant and have them initial your lab submission form. Attach printed a copies of the top-level VHDL code block, the lower level modules, and the XDC file. demo date: TA initials: Problem 6: (20 points) Implement a circuit for the Overhead Coffee Company buy decision. Show any work performed in arriving at a minimal circuit below. Implement the circuit in VHDL using the Vivado Design Suite, and then program the logic on the Digilab board. Demo this circuit to the lab assistant and have them initial your lab submission form. Attach a printed a copy of the VHDL code block, the lower level modules (if any), and the XDC file.

Lab #15 Submission Form Page 4 Homework (100 points) 1. (16 points) Sketch circuits for the following logic equations. Recall a tick mark ( ) following a variable or parenthetical expression means to invert that variable or expression. Y = BC + A D F= (A B) XOR (C + D) G = ((AB ) + BC ) Z = ((A + C). (B+D) )

Lab #15 Submission Form Page 5 2. (18 points) Sketch minimal circuits defined by the truth tables below. A B C F L L L 1 L L H 1 L H L 0 L H H 0 H L L 0 H L H 0 H H L 1 H H H 1 A B C F L L L 0 L L H 1 L H L 0 L H H 0 H L L 1 H L H 1 H H L 0 H H H 0 A B C F L L L 1 L L H 0 L H L 1 L H H 0 H L L 1 H L H 0 H H L 1 H H H 0

Lab #15 Submission Form Page 6 3. (20 points) Simplify the following expressions using the laws of Boolean Algebra A. A(B + A ) + C (A + B ) B. (X + Y )(X Z + Y ) C. (A + AB + (B C) ) D. A B + A B C + AD +ACD E. (AB)C + (AB) C

Lab #15 Submission Form Page 7 5. (18 points) In a logic function with n inputs, there are 2 n unique combinations of inputs and 2 2n possible logic functions. The table below has four rows that show the four possible combinations of two inputs (2 2 = 4), and 16 output columns that show all possible two-input logic functions (2 22 = 16). Some of these output columns are associated with logic circuits, and some are not. Write the name of the logic function in the blanks below the output columns, or write N/A if the column is not associated with a common function (4 blanks have already been filled in). n 2 Inputs A B ALL 2 2 n POSSIBLE LOGIC FUNCTION OUTPUTS F0 F1 F2 F3 F4 F5 F6 F7 F8 F9 F10 F11 F12 F13 F14 F15 LV LV LV HV LV HV LV HV LV HV LV HV LV HV LV HV LV HV LV HV LV LV HV HV LV LV HV HV LV LV HV HV LV LV HV HV HV LV LV LV LV LV HV HV HV HV LV LV LV LV HV HV HV HV HV HV LV LV LV LV LV LV LV LV HV HV HV HV HV HV HV HV Function GND N/A XOR VDD A table like the one above for 3 inputs would need rows and columns. A table like the one above for 4 inputs would need rows and columns. A table like the one above for 5 inputs would need rows and columns. 6. (12 points) In the table below, the voltage levels from the table above have been mapped to 1 s and 0 s. Six of the columns represent common logic functions of two variables. Circle the six columns, and label them with the circuit function. Draw the circuit symbols for the functions represented. INPUTS ALL POSSIBLE OUTPUTS A B 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 0 0 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 0 1 1 0 0 1 1 0 0 1 1 0 0 1 1 1 0 0 0 0 0 1 1 1 1 0 0 0 0 1 1 1 1 1 1 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 7. (16 points) Design and sketch a minimal four-input circuit that outputs a LHV whenever two or more inputs are asserted.