PART 1. Simplification Using Boolean Algebra

Similar documents
EET 1131 Lab #7 Arithmetic Circuits

Experiment 3: Logic Simplification

Name EET 1131 Lab #14 Random Access Memory

Experiment 4 Boolean Functions Implementation

Summary. Boolean Addition

A3 A2 A1 A0 Sum4 Sum3 Sum2 Sum1 Sum

Last Name Student Number. Last Name Student Number

Chapter 2. Boolean Expressions:

Date Performed: Marks Obtained: /10. Group Members (ID):. Experiment # 04. Boolean Expression Simplification and Implementation

EEE130 Digital Electronics I Lecture #4_1

Standard Logic Chips and National Instruments ELVIS Breadboarding for Combinational Logic Circuits

Assignment (3-6) Boolean Algebra and Logic Simplification - General Questions

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.

Combinational Digital Design. Laboratory Manual. Experiment #3. Boolean Algebra Continued

EECS 140 Laboratory Exercise 5 Prime Number Recognition

EMT1250 LABORATORY EXPERIMENT. EXPERIMENT # 10: Implementing Binary Adders. Name: Date:

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

DKT 122/3 DIGITAL SYSTEM 1

CET4805 Component and Subsystem Design II. EXPERIMENT # 5: Adders. Name: Date:

Lecture 7 Logic Simplification

Date Performed: Marks Obtained: /10. Group Members (ID):. Experiment # 09 MULTIPLEXERS

Physics 536 Spring Illustrating the FPGA design process using Quartus II design software and the Cyclone II FPGA Starter Board.

Combinational Logic Circuits

Ch. 5 : Boolean Algebra &

LAB #3: ADDERS and COMPARATORS using 3 types of Verilog Modeling

GEORGIA INSTITUTE OF TECHNOLOGY School of Electrical and Computer Engineering ECE 2020 Fall 2017 Lab #1: Digital Logic Module

Altera Quartus II Tutorial ECE 552

Chapter 3. Boolean Algebra and Digital Logic

SCHEMATIC DESIGN IN QUARTUS

LSN 4 Boolean Algebra & Logic Simplification. ECT 224 Digital Computer Fundamentals. Department of Engineering Technology

EE 231 Fall Lab 1: Introduction to Verilog HDL and Altera IDE

Boolean Analysis of Logic Circuits

CprE 281: Digital Logic

ECE 152A LABORATORY 2

Digital Fundamentals

Experiment 8 Introduction to VHDL

To write Boolean functions in their standard Min and Max terms format. To simplify Boolean expressions using Karnaugh Map.

A graphical method of simplifying logic

Homework. Update on website issue Reading: Chapter 7 Homework: All exercises at end of Chapter 7 Due 9/26

A B A+B

Standard Forms of Expression. Minterms and Maxterms

Name EGR 2131 Lab #6 Number Representation and Arithmetic Circuits

CET4805 Component and Subsystem Design II. EXPERIMENT # 2: VHDL(VHSIC Hardware Descriptive Language) Name: Date:

ENEE 245 Lab 1 Report Rubrics

Combinational Circuits Digital Logic (Materials taken primarily from:

Finite State Machine Lab

Programmable Logic Design Techniques I

ECE241 Digital Systems Lab 2 Altera Software Tutorial and Use

University of Florida EEL 3701 Dr. Eric M. Schwartz Madison Emas, TA Department of Electrical & Computer Engineering Revision 1 5-Jun-17

A3 A2 A1 A0 Sum4 Sum3 Sum2 Sum1 Sum

Review: Standard forms of expressions

Lab 16: Tri-State Busses and Memory U.C. Davis Physics 116B Note: We may use a more modern RAM chip. Pinouts, etc. will be provided.

Pearson Education Limited Edinburgh Gate Harlow Essex CM20 2JE England and Associated Companies throughout the world

Digital Logic Design (3)

Digital Logic Design (CEN-120) (3+1)

FPGA Introductory Tutorial: Part 1

Bawar Abid Abdalla. Assistant Lecturer Software Engineering Department Koya University

Chapter 3. Gate-Level Minimization. Outlines

LAB 2: INTRODUCTION TO LOGIC GATE AND ITS BEHAVIOUR

COS 116 The Computational Universe Laboratory 7: Digital Logic I

Laboratory 4 Design a Muti-bit Counter

ECSE-323 Digital System Design. Lab #1 Using the Altera Quartus II Software Fall 2008

ECE241 - Digital Systems. University of Toronto. Lab #2 - Fall Introduction Computer-Aided Design Software, the DE2 Board and Simple Logic

Digital Techniques. Lecture 1. 1 st Class

ENGIN 112 Intro to Electrical and Computer Engineering

ECE241 - Digital Systems

University of California, Davis Department of Electrical and Computer Engineering. Lab 1: Implementing Combinational Logic in the MAX10 FPGA

CSE P567 - Winter 2010 Lab 1 Introduction to FGPA CAD Tools

QUESTION BANK FOR TEST

EE 231 Fall EE 231 Lab 3. Decoders and Multiplexers. Figure 1: 7-Segment Display. Memory: where the program is stored.

SFWR ENG 2DA4 Lab 1. Announcements: Marking Scheme: Lab Safety Manual:

2.6 BOOLEAN FUNCTIONS

Digital logic fundamentals. Question Bank. Unit I

Lecture 4: Implementation AND, OR, NOT Gates and Complement

CS2630: Computer Organization Homework 3 Combinational logic and Logisim Due October 14, 2016, 11:59pm

University of Florida EEL 3701 Dr. Eric M. Schwartz Department of Electrical & Computer Engineering Revision 0 12-Jun-16

EXPERIMENT 1. INTRODUCTION TO ALTERA

CSCB58 - Lab 0. Intro to The Lab & The DE2 Board. Prelab /4 Part I (in-lab) /1 Part II (in-lab) /1

EECS 140 Laboratory Exercise 4 3-to-11 Counter Implementation

EXPERIMENT NUMBER 7 HIERARCHICAL DESIGN OF A FOUR BIT ADDER (EDA-2)

Laboratory Exercise 1

EE 231 Fall EE 231 Lab 2

Chapter 2 Combinational Logic Circuits

cs281: Introduction to Computer Systems Lab03 K-Map Simplification for an LED-based Circuit Decimal Input LED Result LED3 LED2 LED1 LED3 LED2 1, 2

CHAPTER-2 STRUCTURE OF BOOLEAN FUNCTION USING GATES, K-Map and Quine-McCluskey

SYNERGY INSTITUTE OF ENGINEERING & TECHNOLOGY,DHENKANAL LECTURE NOTES ON DIGITAL ELECTRONICS CIRCUIT(SUBJECT CODE:PCEC4202)

1/Build a Mintronics: MintDuino

Lab 16: Data Busses, Tri-State Outputs and Memory

LAB #1 BASIC DIGITAL CIRCUIT

Pre-Laboratory #Boolean Expressions ECE 332

1 Discussion. 2 Pre-Lab

S1 Teknik Telekomunikasi Fakultas Teknik Elektro FEH2H3 2016/2017

structure syntax different levels of abstraction

Here is a list of lecture objectives. They are provided for you to reflect on what you are supposed to learn, rather than an introduction to this

Lab 6: Integrated the Decoder with Muti-bit Counter and Programming a FPGA

Hours / 100 Marks Seat No.

Introduction to MATLABs Data Acquisition Toolbox, the USB DAQ, and accelerometers

Combinational Devices and Boolean Algebra

EMT1250 LABORATORY EXPERIMENT. EXPERIMENT # 6: Quartus II Tutorial and Practice. Name: Date:

Lab 4: Digital Electronics BMEn 2151 Introductory Medical Device Prototyping Prof. Steven S. Saliterman

Transcription:

Name EET 1131 Lab #5 Logic Simplification Techniques OBJECTIVES: Upon completing this lab, you ll be able to: 1) Obtain the experimental truth table of a logic circuit. 2) Use Boolean algebra to simplify a logic circuit. 3) Use Karnaugh maps to simplify a logic circuit. 4) Verify that a logic circuit and its simplified version give the same output. 5) Use Multisim software to obtain a circuit s truth table and simplified expression. EQUIPMENT REQUIRED: Safety glasses ICs: 7408, 7432, and other chips as needed ETS-7000 Digital-Analog Training System Quartus II software and Altera DE2-115 board Multisim simulation software PART 1. Simplification Using Boolean Algebra PROCEDURE: 1. Consider the schematic diagram shown below. 2. In Quartus II, create a new project named Lab5Circuit1. Following the steps you learned in the previous lab, create a block diagram/schematic file that implements the circuit shown above. Then compile your design, assign input and output pin numbers so that you can use three switches as your inputs and an LED for your output, and download your design to the FPGA on the DE2-115 board. EET 1131 Lab #5 - Page 1 Revised 12/29/2014

3. Obtain and write the circuit s experimental truth table, using a straight edge to draw the lines in your truth table. 4. When your truth table is complete, ask me to check your work. Circuit works correctly? 5. From the schematic diagram (repeated below), write the Boolean expression for X as a function of A, B, and C. Do not simplify the expression using any of our rules or theorems just write the expression that you get directly from the diagram. X = EET 1131 Lab #5 - Page 2 Revised 12/29/2014

6. Now simplify this expression using the laws, rules, and theorems of Boolean algebra. Show each step in the simplification, and label each step with the rule, law, or theorem that you used in that step. When you re finished, ask me to check your simplified expression. EET 1131 Lab #5 - Page 3 Revised 12/29/2014

7. Draw the schematic diagram for your simplified expression. Write chip numbers and pin numbers on it. 8. Build the simplified circuit on the breadboard. Obtain and write its experimental truth table, using a straight edge to draw the lines in your truth table. 9. When your truth table is complete, ask me to check your work. Safety glasses? Circuit works? DIPs inserted correctly? Using power/ground busses? Wire colors? Wire lengths? Wire ends trimmed? DIPs accessible? 10. How does your truth table in Step 9 compare to your truth table in Step 4? EET 1131 Lab #5 - Page 4 Revised 12/29/2014

PART 2. Simplification Using Karnaugh Maps PROCEDURE: 12. Consider the new schematic diagram shown below. 13. In Quartus II, create a new project named Lab5Circuit2. Create a block diagram/schematic file that implements the circuit shown above. Then compile your design, assign input and output pin numbers so that you can use four switches as your inputs and an LED for your output, and download your design to the FPGA on the DE2-115 board. 14. Test your circuit, and write the circuit s truth table on the next page. EET 1131 Lab #5 - Page 5 Revised 12/29/2014

15. Obtain and write the circuit s experimental truth table, using a straight edge to draw the lines in your truth table. Now write the SOP expression that you get directly from this truth table. Do not simplify. X = 16. Ask me to check your work. SOP expression correct? EET 1131 Lab #5 - Page 6 Revised 12/29/2014

17. From your SOP expression, use a straight edge to draw the circuit s Karnaugh map. Then read off the simplified expression from the K-map. Simplified expression: X = Call me over to check your K-map and simplified expression. 18. Draw the schematic diagram for this simplified expression. Label the gates with chip numbers and pin numbers. (You re free to use chips not listed on the front page of this lab.) EET 1131 Lab #5 - Page 7 Revised 12/29/2014

19. Build the simplified circuit on the breadboard. Obtain and write its experimental truth table. 20. When your truth table is complete, ask me to check your work. Safety glasses? Circuit works? DIPs inserted correctly? Using power/ground busses? Wire colors? Wire lengths? Wire ends trimmed? DIPs accessible? 21. How does your truth table in Step 20 compare to your truth table in Step 16? EET 1131 Lab #5 - Page 8 Revised 12/29/2014

PART 3. Simplification Using Multisim 23. Shown below is the circuit from Part 1 of this lab. Draw this circuit in Multisim. Then connect Multisim s Logic Converter as shown below. Notice that you don t need to hook up V CC or ground to use the Logic Converter. 24. Double-click the Logic Converter to open it. Then press its button to generate a truth table. 25. How does the Logic Converter s truth table compare to your results from Step 4 and Step 9? 26. Press the Logic Converter s button to generate a simplified expression. 27. How does the Logic Converter s simplified expression compare to your simplified expression from Step 7? 28. Copy and paste your circuit diagram and the Logic Converter into a Microsoft Word document, so that they both fit on a single page. Make sure that you can read the Logic Converter s truth table and simplified expression. Print this page out and turn it in with your lab. EET 1131 Lab #5 - Page 9 Revised 12/29/2014

29. Shown below is the circuit from Part 2 of this lab. Draw this circuit in Multisim. (If you can t find a 7411 in Multisim, you can use a 74LS11 or AND3.) Then use Multisim s Logic Converter to obtain the circuit s truth table and simplified expression. 30. Copy and paste your schematic diagram and the Logic Converter into a Microsoft Word document, so that they both fit on a single page. Make sure that you can read the Logic Converter s complete truth table and simplified expression. Print this page out and turn it in with your lab. 31. How do the results of Step 31 compare to results from earlier steps in Part 2 of this lab? EET 1131 Lab #5 - Page 10 Revised 12/29/2014

32. Write chip numbers and pin numbers on each gate in the drawing below. (This is a new circuit, completely different from the circuits that you ve been working with on the previous pages.) 33. From the diagram, write the Boolean expression for Y as a function of A, B, and C. Do not simplify the expression using any of our rules or theorems just write the expression that you get directly from the diagram. Y = 34. Draw the circuit in Multisim. Connect Multisim s Logic Converter, and use it to generate the circuit s truth table. Copy this truth table below. 35. Use the Logic Converter to find the simplified expression for this circuit. Note that Multisim uses apostrophes instead of overbars to show that a variable is complemented. For example, the complement of A is written in Multisim as A instead of A. Copy the simplified expression below, but use overbars instead of apostrophes. Y = 36. Copy and paste your schematic diagram and the Logic Converter into a Microsoft Word document, so that they both fit on a single page. Make sure that you can read the Logic Converter s truth table and simplified expression. Print this page out and turn it in with your lab. EET 1131 Lab #5 - Page 11 Revised 12/29/2014