I already did 1-4. Just need photos of the BASYS 3 BOARD device.
EXPERIMENT#1 AND Gates & OR Gates OBJECTIVES: · Implement 3-input AND gate and 3-input OR gate using VHDL · Program .bit file to the target board. · Demonstrate the characteristics of AND and OR gates. · Develop truth tables for AND and OR gates. DISCUSSION: AND and OR gates are hardware implementations of the two fundamental Boolean operations: logical multiplication (AND) and logical addition (OR). They are represented on a diagram by gate symbols, and their characteristics can be described by truth tables, Boolean equations, and timing waveforms. Both AND and OR gates can have two or more inputs, but only one output. Gate Characteristics: 1.) The AND Gate Symbol Boolean Equation Truth Table The behavior of an AND gate can be summarized as follows: The output is HIGH (true or logic ‘1’) only when all the inputs are HIGH. If any of the inputs is LOW (false or logic 0), the output will be LOW. 2.) The AND Gate Symbol Boolean Equation Truth Table As seen from the above truth table, the output is LOW only when all the inputs are LOW. If any of the inputs is HIGH, then the output is HIGH. For both AND gates and OR gates, the output goes HIGH when the required HIGH logic levels are applied to the input. We describe this by saying that AND gates and OR gates have active-high inputs and active-high outputs. PROCEDURE: 1.) Implement 3-input AND gate and 3-input OR gate using VHDL. 2.) Define the input and output ports as following: 3.) Type the gate-equivalent VHDL code for the AND & OR gates 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 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 8.) Fill out the truth tables, draw schematic diagrams and write the Boolean equations. 9.) Answer post-experiment questions. RESULTS: 1.) AND Gate A2 A1 A0 X Schematic Diagram 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 Boolean Equation 1 1 0 1 1 1 2.) OR Gate B2 B1 B0 Y Schematic Diagram 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 Boolean Equation 1 1 0 1 1 1 Questions: 1.) How many rows must a truth table have in order to describe a 4-input AND gate? Which input will make the output HIGH? 2.) Which output is the unique one in a 3-input OR gate? Does it agree with the statement in our Discussion section? 3.) Sketch the output X for the given waveform A and B 4.) Attach 4 photos of your BASYS 3 board results showing the following input conditions: · B2 = HIGH, B1 = HIGH, B0 = HIGH; A2 = HIGH, A1 = HIGH, A0 = HIGH · B2 = HIGH, B1 = LOW, B0 = LOW; A2 = HIGH, A1 = LOW, A0 = LOW · B2 = LOW, B1 = HIGH, B0 = HIGH; A2 = LOW, A1 = HIGH, A0 = HIGH · B2 = LOW, B1 = LOW, B0 = LOW; A2 = LOW, A1 = LOW, A0 = LOW Page 18 | 18 Logic Design Lab EEL3712l Experiment 2 EXPERIMENT#2 Inverting Logic: NOT, NAND, & NOR OBJECTIVES: · Examine inverting logic circuits. · Demonstrate the characteristics of NOT, NAND, and NOR gates. · Develop truth tables for NOT, NAND, and NOR gates. DISCUSSION: The inverter (or NOT gate) represents logical complementation. A NOT gate can have only one input and one output. The output of a NOT gate simply reverses (inverts) the logic value presented at its input. The NOT gate can be combined with AND and OR gates to construct two more basic gates: NAND and NOR gates. Both NAND and NOR gates are universal logic gates, which means that either NAND gates or NOR gates can be used to construct any combinational logic circuit. We will use gate symbols, truth tables, and Boolean equations to demonstrate their characteristics. As with AND and OR gates, NAND and NOR gates can have two or more inputs but only one output. Gate Characteristics: 1. The NOT Gate Symbol Boolean Equation Truth Table Because the NOT gate has only one input, the truth table has two rows. Moreover, the output inverts the logic level of the input. In addition to the overhead bar shown above (read as “X = A-bar’), notation for logical inversion includes the following: 2. The NAND Gate Symbol Boolean Equation Truth Table The behavior of a NAND gate can be summarized as follows: The output is LOW only when all the inputs are HIGH. If one or more inputs are LOW (false or logic 0), the output will be HIGH. Comparing the truth table for the NAND gate with that of the AND gate, you will find out that each output of a NAND gate is exactly the opposite (inverted) logic value of the corresponding output of an AND gate. In fact, a NAND gate is functionally equivalent to an AND gate cascaded with a NOT gate as shown below. 3. The NOR Gate Symbol Boolean Equation Truth Table As seen from the truth table, the output of a NOR gate is HIGH only when all the inputs are LOW. If one or more of the inputs are HIGH, then the output is LOW. Similarly, a NOR gate can be constructed using an OR gate cascaded with a NOT gate. In other words, a NOR gate is functionally equivalent to an OR gate followed by an inverter. NAND and NOR gates can be used to perform some useful functions such as enabling and disabling signals. Also, NAND and NOR gates can be used to perform the function of a NOT gate. PROCEDURE: Part I 1.) Implement 3-input NAND gate, 3-input NOR gate and NOT gate using VHDL. 2.) Define the input and output ports as following: 3.) Type the gate-equivalent VHDL code for the NAND, NOR & NOT gates 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 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 8.) Fill out the truth tables, draw schematic diagrams and write the Boolean equations. 9.) Answer post-experiment questions. RESULTS: Part I 1.) 3-input NAND Gate A2 A1 A0 X Schematic Diagram 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 Boolean Equation 1 1 0 1 1 1 2.) 3-input NOR Gate B2 B1 B0 Y Schematic Diagram 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 Boolean Equation 1 1 0 1 1 1 3.) NOT Gate C Z0 Schematic Diagram Boolean Equation 0 1 Questions: 1.) Comment on your results. Do they agree with the statements in our Discussion section? 2.) Attach 2 photos of your BASYS 3 board results showing the following input conditions: · C = HIGH, B2 = LOW, B1 = LOW, B0 = LOW; A2 = HIGH, A1 = HIGH, A0 = HIGH · C = LOW, B2 = HIGH, B1 = HIGH, B0 = HIGH; A2 = LOW, A1 = LOW, A0 = LOW PROCEDURE: Part II 1.) Modify the previous .vhd source code in order to add the implementations of these gates. 2.) Modify the port names in the constraints file to match with updated port names defined in the design source as follows: (Nothing has changed for the switches section) 3.) Since the design has changed, you have to run synthesis, run implementation, and generate bitstream again. If running synthesis or implementation failed,