COEN212 Lab 2

docx

School

Concordia University *

*We aren’t endorsed by this school

Course

212

Subject

Electrical Engineering

Date

Dec 6, 2023

Type

docx

Pages

Uploaded by DeanCloverMink40

LABORATORY REPORT Digital Design Course: COEN212 Lab Section: WQ-X Experiment No.: 2 Date Performed: 2023 – 03 –06 YYYY – MM – DD Experiment Title: Combinational Logic Circuit Design. Name: Elias Chanis ID No.: 40264885 I certify that this submission is my original work and meets the Faculty’s Expectations of Originality Signature: Elias Chanis Date: 2023 – 03 –19 YYYY – MM – DD

Objectives: This experiment will help students design and construct a 2-bit combinational multiplier by using the K-map method. Moreover, students will be able to minimize their combinational logic circuit. Lastly, they will be able to gain further experience in constructing digital circuits using a breadboard. Theory: To start off, it is important to recall some concepts from the first laboratory in order to construct our Boolean functions. Boolean algebra and K-Maps have the same function. They minimize all min-terms of an output to a simpler set. This helps reduce the amount of connections required as well as the amount of gates used. For this experiment, we are multiplying 2 inputs and each input is consisted of 2 bits that will result in a 4 output logic circuit. The first 2- bit input A1 and A0 are used to create a decimal number ranging from 0 to 3. Similarly, the other 2-bit input range has a decimal value ranging from 0 to 3. The output however will result in a 4-bit digit ranging from 0 to 15 (in decimal). The following table shows all the possible input combinations as well as the output of the multiplication of both 2-bit inputs.

X = The equivalent decimal value of each pair =

Your preview ends here

Eager to read complete document? Join bartleby learn and gain access to the full version

Access to all documents
Unlimited textbook solutions
24/7 expert homework help

The table with all possible combinations in binary is converted into decimal values to validate the outputs and verify if the multiplication makes sense. For each output, a respective K-map was built (prelab at the end of report) in order to determine and find the Boolean function for each output and then design the final logic circuit with all 4 outputs together. Each Boolean function of each K-map is to be presented in a sum-of- product form in order to obtain a simplified function and not complicating the circuit.

Procedure: For the experimental part, students are asked to build the obtained Boolean functions for each output and verify if the output respects what is expected and follow the truth table. AND, OR, NOT gates are expected to be used. Questions: 1) How many rows would the truth table of a combinational 3-bit multiplier have? How many outputs would be required? What kind of a K-map would be required to minimize this truth table? Answer: The truth table of a combinational 3-bit multiplier will have 64 possible combinations as we have 2 3-bit inputs. In other words, we have 6 inputs and 2^6 will equal to 64. Moreover, we will need a 6-bit output because the two highest 3-bit digits that can be multiplied together are 7*7 which give 49. A 6-bit output will give 63 as a maximum decimal value whilst

a 5-bit will give 31. In result, we should have a 6-but output. We should have a 8 by 8 K-map because we will have 3 inputs on the top side and 3 inputs on the left side of the K-map. 2) Obtain the minimal sum-of-product Boolean expression for the truth table of the circuit in Figure 1.7 of Experiment 1. Comment on the circuit provided in Figure 1.8 of Experiment 1 and its relationship with the obtained minimal sum-of-products expression. Answer: The minimal sum-of-product Boolean expression for the circuit in figure 1.7 is A’C + BC. This Boolean function represents the simplified circuit in figure 1.8.

Your preview ends here

Eager to read complete document? Join bartleby learn and gain access to the full version

Access to all documents
Unlimited textbook solutions
24/7 expert homework help

Conclusion: In conclusion, K-maps prove to be the most efficient and easy way to build whatever truth table is needed. Not only it is simple to use, it simplifies the Boolean function and if the function is not simplified then students should be able to realize that there is a mistake somewhere in their outputs. With the help of K-maps, the construction and verification of Boolean functions are easier.

Related Documents

M6 lab.pdf

Mahela Plasencia phet-contribution-5169-8991.docx

Market Disruptions -3.docx

hw 12 financial calculation.xlsx

Carson Kramer--Article Review 1.docx

ELEC273 lab report #2.docx

ELEC273 Lab report #1.docx

COEN212 Report 4.docx

ELEC273 lab report 4-5.docx

ECE 3110 - Prelab 8 .docx

lab 4.docx

Lab1 (1).pdf

Related Questions

The ______ terminal of the JFET is the equivalent of the Collector terminal of a BJT. a.Drain b.Source c.None of these d.Gate

5) Draw the circuit diagram using diode and write the truth table of a logic gates whose output will be the logical OR operation of two inputs.

The following question is related to isolated de to de converters.(a)Discuss the requirements for electrical isolation in relation to do to deconverters.

Before firing, the voltage across the TRIAC is a. OV b. Once the TRIAC is turned on, it can only be turned off by. a. Removing gate voltage. b. Reducing the current flowing through TRAIC below the holding current value. Both a and b. Approximately Equal to power supply. C.

w4444

Using appropriate diagrams, explain how a combination of transistors and resistors would be used to construct an OR logic gate to control the flow of electrons inside an integrated circuit.

1. Moore's Law: 1) What is Moore's Law about? 2) Why we have been used Moore's law to predict computer performance before multicore? 3) What limits the performance scaling based on Moore's law

SEE MORE QUESTIONS

Recommended textbooks for you

Introductory Circuit Analysis (13th Edition)

Electrical Engineering

ISBN:9780133923605

Author:Robert L. Boylestad

Publisher:PEARSON

Delmar's Standard Textbook Of Electricity

Electrical Engineering

ISBN:9781337900348

Author:Stephen L. Herman

Publisher:Cengage Learning

Programmable Logic Controllers

Electrical Engineering

ISBN:9780073373843

Author:Frank D. Petruzella

Publisher:McGraw-Hill Education

Fundamentals of Electric Circuits

Electrical Engineering

ISBN:9780078028229

Author:Charles K Alexander, Matthew Sadiku

Publisher:McGraw-Hill Education

Electric Circuits. (11th Edition)

Electrical Engineering

ISBN:9780134746968

Author:James W. Nilsson, Susan Riedel

Publisher:PEARSON

Engineering Electromagnetics

Electrical Engineering

ISBN:9780078028151

Author:Hayt, William H. (william Hart), Jr, BUCK, John A.

Publisher:Mcgraw-hill Education,

SEE MORE TEXTBOOKS

Related Questions

Recommended textbooks for you

Introductory Circuit Analysis (13th Edition)
Electrical Engineering
ISBN:9780133923605
Author:Robert L. Boylestad
Publisher:PEARSON
Delmar's Standard Textbook Of Electricity
Electrical Engineering
ISBN:9781337900348
Author:Stephen L. Herman
Publisher:Cengage Learning
Programmable Logic Controllers
Electrical Engineering
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education
Fundamentals of Electric Circuits
Electrical Engineering
ISBN:9780078028229
Author:Charles K Alexander, Matthew Sadiku
Publisher:McGraw-Hill Education
Electric Circuits. (11th Edition)
Electrical Engineering
ISBN:9780134746968
Author:James W. Nilsson, Susan Riedel
Publisher:PEARSON
Engineering Electromagnetics
Electrical Engineering
ISBN:9780078028151
Author:Hayt, William H. (william Hart), Jr, BUCK, John A.
Publisher:Mcgraw-hill Education,