EXPERIMENT_33

.docx

School

Florida International University *

*We aren’t endorsed by this school

Course

3370

Subject

Electrical Engineering

Date

Feb 20, 2024

Type

docx

Pages

12

Uploaded by SargentWhaleMaster161

Report
EXPERIMENT 3 Boolean Laws & Rules and DeMorgan’s Theorem OBJECTIVES: Learn and verify Boolean laws and rules. Learn and prove DeMorgan’s theorem Use Xilinx Vivado simulation tools to test combinational circuits. DISCUSSION: A Boolean equation derived directly from a truth table or from a problem statement usually is not in the simplest form. To have an efficient equivalent logic circuit, the Boolean equation representing the logic design must be in the simplest from. Boolean equations can be simplified using Boolean algebra, DeMorgan’s theorem, or/and Karnaugh maps. In this experiment, we will verify Boolean distribute law, absorption rule and DeMorgan’s theorem. PROCEDURE: Part I 1.) Prove this following Boolean distributive law using VHDL code. A ( B + C + D ) ≡ AB + AC + AD X 1 = A ( B + C + D ) X 2 = AB + AC + AD 2.) Define the input and output ports as following: P a g e 1 | 12
3.) Type the VHDL code for expressions between the “begin” and “end Behavioral” . 4.) Use the xdc template from: https://www.xilinx.com/support/documentation/university/Vivado- Teaching/HDL-Design/2015x/Basys3/Supporting%20Material/Basys3_Master.xdc Copy and P a g e 2 | 12
paste the whole text into your constraints file. Uncomment by deleting the # signs in front of the lines of switches and LEDs that we’re going to use. Modify the port names to match with port names defined in the design source as follows: 5.) Run synthesis, run implementation, and generate bitstream . If running synthesis or implementation failed, double check your design file (.vhd). If bitstream generation failed, double check your constraints file (.xdc) 6.) Program the target board. 7.) Toggle the switches, observe and verify your results. Fill out the truth table. 8.) Create a simulation source and modify the code as following: P a g e 3 | 12
9.) Run the simulation. Capture the waveform from 0 ns to 160 ns. RESULTS: Part I P a g e 4 | 12
D C B A X1 X2 Schematic Diagram 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 1 1 1 1 0 1 0 0 0 0 0 1 0 1 1 1 0 1 1 0 0 0 0 1 1 1 1 1 1 0 0 0 0 0 1 0 0 1 1 1 1 0 1 0 0 0 1 0 1 1 1 1 1 1 0 0 0 0 Boolean Equation 1 1 0 1 1 1 X1 = A(B+C+D) X2 = AB + AC + AD 1 1 1 0 0 0 1 1 1 1 1 1 Questions: Part I 1.) Attach 2 photos of your BASYS 3 board results showing the following input conditions: D = LOW, C = HIGH, B = HIGH, A = LOW D = HIGH, C = HIGH, B = HIGH, A = HIGH P a g e 5 | 12
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