Lab Manual, Digital Logic Design Exp # 1. FAMILIARIZATION WITH DIGITAL LOGIC TRAINER Logic Trainer is a device which is used to study interaction of different logic and universal gates. Figure 1: NB-09 Digital Logic Trainer Complete description of NB-09 Digital Logic Trainer shown in figure 1 is described below “A” Section A comprises of DC Jack for the power supply adaptor. ------------------------------------------------------------------------------------------------ ---------------------------------------------------------------------------- Digital System Lab,CPED, UET Taxila 1
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Lab Manual, Digital Logic Design
Exp # 1.FAMILIARIZATION WITH DIGITAL LOGIC TRAINER
Logic Trainer is a device which is used to study interaction of different logic and universal gates.
Figure 1: NB-09 Digital Logic Trainer
Complete description of NB-09 Digital Logic Trainer shown in figure 1 is described below“A”Section A comprises of DC Jack for the power supply adaptor. “B”Section B consists of “8 BIT LED OUTPUT INDICATOR “. The bulb in this section glows when there is logic 1 and remains off when there is logic 0.
“D” Section D consists of “AND GATES”. It is a basic combinational logic device where all inputs must b high for the output to be high. “E”Section E comprises of “OR GATES” It is a basic combination logic device where the output goes high when any or two input will be high. “F”Section F consists of “NAND GATES”. It is a basic combinational logic device where all inputs must be high for output to be low. It is invert of AND GATE. “G”Section G consists of “NOR GATES” it is a basic combinational logic device where all inputs must be low for output to be high. A NOT OR circuit. It is invert of OR. Its meaning No OR. “H”Section H consists of “XOR GATES” it is basic combinational logic device where an odd number of high inputs generates a high output.
“I”Section I consists of “NOT GATES” it is a basic combinational logic device where the output is always the opposite from the input. It is also called an inverter.“J”Section J consists of “VOLTAGE SECTION” one port is of +5V, the other is for ground connection and the third is of -5V.Also Section J consists of “VOLTAGE SECTION” one port is of +15V, the other is for ground connection and the third is of -15V.“L”Section L consists of PULSE. It can be generator a pulse of 1 second, 0.1 second and 0.01 second.“M” Section M consists of DATA SWITCHES. There are five data switches in this trainer and have four there test point in their correspondence. “N” Section N consists of “SOLDER LESS BREADBOARD OR PROTO BOARD” It is consisting of so many holes.
Exp # 2.VERIFICATION OF TRUTH TABLE OF BASIC LOGIC
GATES
Apparatus: 7408IC’s, Logic Trainer and connecting wires.
OBJECTIVEThe basic logic gates are the basic building blocks of more complex logic circuits. The purpose of this lab is to learn about Digital Logic and digital logic circuits. By the end ofthis lab you will have an understanding of the functions and operations of different logic gates.
THEORYAND GateThe AND function is similar to the multiplication in mathematics. This is the all or nothing operator and it provides a logic 1 output only when all the inputs of the gate are at logic 1, and logic 0 output for all other input combinations. The AND function is described in terms of the following “truth table”.Figure 2 input AND Gate.
Exp # 3.VERIFICATION OF TRUTH TABLE OF BASIC LOGIC
GATES
Apparatus: 7432 ,7404,7402 IC’s, Logic Trainer and connecting wires.
OBJECTIVEThe basic logic gates are the basic building blocks of more complex logic circuits. The purpose of this lab is to learn about Digital Logic and digital logic circuits. By the end ofthis lab you will have an understanding of the functions and operations of different logic gates.
OR GateThe OR function is similar to the mathematical function of addition and the output for theOR gate may be analyzed using the laws of addition. The logic operator for the ORfunction is a + sign. The output will be logic 0 only if all the inputs are logic 0, and theoutput will be logic 1 anytime any input is at logic 1. Here, OUT = A+B.Figure 2 input OR Gate.
NOT GateThe NOT circuit or inverter performs the basic logic function of complementation. It may be identified by the presence of a bubble on the input or the output of the traditional logic symbol. The output of NOT gate is the inverse of the input. Unlike the others it only has one input and one output.Figure 1 input NOT Gate
NAND GateThe NAND function is the complement of the AND function and the logic symbols havethe inversion on the output. NAND gate is constructed by adding an inverter afterAND operator. The NAND function provides logic 0 on the output only when both inputs are logic 1, and logic 1 output for all other combinations. Here, OUT = B A.Figure: 2-input NAND gate
NOR GateThe complement of the OR function is the NOR function and the logic symbol has the inversion present on the output. NOR gate is constructed by adding an inverter after OR operator. Here, OUT = B A + .Figure: 2-input NOR gate
PROCEDURE Place the IC 7408LS on the trainer board. Connect VCC and ground to the respective pins on the trainer board. Connect the inputs to the input switches provided in the trainer board. Connect the outputs to the switches of output LEDs. Apply various combinations of inputs as shown in the truth table and observe the conditions of LEDs. Similarly follow these steps for other gates.
PROBLEMS Measure the output voltages in all cases. What is the difference between a Inverter and a NOT gate?
Lab Exercise:
1. Students are required to verify the functioning of each gate in each of there IC’s through T.Ts.2. Then the gate, which is not functioning properly, should be clearly indicated.
Apparatus: 7408, 7432, 7404 IC’s, logic kit and connecting wires.
OBJECTIVEBoolean algebra uses many of the same laws as those of ordinary algebra. In this experiment, we’ll know about this laws & theorem.
THEORYGenerally you’ll find that the basic logic functions AND, OR, NAND, NOR, and NOT are not sufficient to implement complex digital logic functions. These gates are the basis for building more complex logic circuits that are constructed using various combinations of gates which is known as Combinational Logic. Combinational logic requires the use of two or more gates to form a useful, complex function. These complex functions usually begin as a Boolean Equation and the logic circuit may be implemented directly from this equation. The Boolean laws and rules are shown below:
Apparatus: 7408, 7432, 7404 digital logic kit and connecting leads.
OBJECTIVEDe Morgan’stheorem allows for the simplification of a Boolean Expression by the cancellation of some redundant inversions. In this experiment, we’ll know about this laws & theorem.
DE MORGAN`S THEOREMDe Morgan developed a theorem that allows conversion between logic expressions that has inversions on the output to a different logic expression with the inversions on each of the inputs. This may allow for the simplification of a Boolean Expression by the cancellation of some redundant inversions. There are two Boolean Equations that represent De Morgan's Theorem:
It has two statements.
1. (x+y+z) = x.y.zwhere let F1 = (x+y+z) & F2 = x.y.z
Now we shall check this logic circuit by the Truth Table.
Truth Table
i/p’s o/p’s
x y zF1 = (x+y+z) F2 = x.y.z F3 = (x.y.z) F4 =x+y+z
Actual
Observed
Actual
Observed
Actual
Observed
Actual
Observed
0 0 00 0 10 1 00 1 11 0 01 0 11 1 01 1 1
PROCEDURE1. At first construct the circuits shown in the Boolean laws.2. Check if the laws are valid. Give truth tables for each law.3. Construct the circuits shown in the circuit diagram.4. Check if the two circuits give the same result.
OBSERVATIONS & RESULTS1. Write truth tables for each Boolean law.2. Write the equation for the figure 1. Now try to simplify it and find the equation for
OBJECTIVEDigital computers perform a variety of information-processing tasks. Among the basic functions encountered are the various arithmetic operations. The most basic arithmetic operation is the addition of two binary digits. In this experiment we’ll know about the circuits that will add binary digits.
THEORY
Half Adder:
Half Adder is combinational logic circuit that generates the sum of two binary numbers (each having 1 bit length). The logic circuit has two inputs and two outputs i.e. Sum & Carry abbreviated as SHA & CHA respectively. First of all, we shall construct Truth Table of Half Adder
Truth Table
i/p’s o/p’s
x ySHA = xy+xy CHA = x y
Actual Observed
Actual
Observed
0 00 11 01 1
Now we write Boolean function from above Truth Table as
SHA =xy + xyCHA = xy
Implementation
Now we implement above Boolean expression by basic logic gates i.e.
Lab Exercise:1. Students are required to write outputs of Full adder using Basic logic gates..2. Then implement Half Adder using basic logic gates.
Full Adder:
Full Adder is combination logic circuit that performs the sum of 3 input binary numbers, (each having 1 bit length). Two of the binary input variables are x and y represent the two significant bits to be added the third input z, represents the carry from previous lower significant position. Outputs of Full Adder are Sum and Carry represented as SFA and CFA respectively.
First of all, we shall construct Truth Table of Full Adder i.e.
Truth Table
i/p’s o/p’s
x y zSFA CFA
Actual Observed
Actual Observed
0 0 00 0 10 1 00 1 11 0 01 0 11 1 01 1 1
Now we write Boolean expression for Sum and Carry of Full Adder.
Sum = xyz+xyz+xyz+xyzSimplifying by using Boolean Postulates & theorems/k-map, we getSum =(xy+xy) . z + (xy+xy).zSFA = (x y ) z
Carry = xyz + xyz + xyz+xyzSimplifying by using Boolean Postulates & theorems/k-map, we getCarry = (xy+xy) . z+xyCFA = (x y) z + xy
Implementation
Now we implement simplified Boolean expressions of SFA & CFA i.e.
Exp # 7. IMPLEMENTATION/DESIGN OF MAGNITUDE COMPARATORS
Apparatus: 7486, 7432, 7408, 7404 logic kit and connecting wires.
ONE BIT MAGNITUDE COMPARATOR
One Bit Magnitude Comparator is combination logic circuit which is used to compare two input binary numbers (each having one bit length) to check weather two inputs are equal or one less than other or greater then.
First of all we write Truth Table of 1 Bit Magnitude Comparator i.e.
Two Bit Magnitude Comparator which is used to compare two input binary numbers (each having bit length of two ) to check weather two inputs are equal or one less than other or greater then.
USING XOR GATES AND BASIC LOGIC GATESFirst of all we write Truth Table of 2 Bit magnitude Comparator.
k-map’s for outputs of 2 Bit Magnitude Comparator.
k-map of “E”.
k-map of “G”
k-map of “L”.
Boolean Functions
Now writing Boolean functions from above k-maps for outputs of two Bit Magnitude Comparator, we get. E = A1 A0 B1 B0+ A1 A0 B1 B0+ A1 A0 B1 B0+ A1 A0 B1 B0
Exp # 8. DESIGN & IMPLEMENTATION OF A 2 x 4 DECODER
Apparatus: 7432, 7408, 7404 IC’s logic kit and connecting leads
Decoder : n 2n.n = No. of input lines.2n = No. of outputs of a Decoder.Decoder is a circuit that convert binary information from n-input lines to max of 2n
output lines e.g. if we have 2 inputs i.e. x,y then there will be 4 output of a Decoder and size of Decoder will be 2X4.
Now we check this logic circuit by using Truth Tables of 2X4 Decoder as drawn above.
Lab Exercise:
1. Students are directed to write the Truth Table of 3X8 Decoder with Enable. 2. Then, write output Boolean Functions of 3X8 Decoder.3. Then implement 3X8 Decoder using logic gates.
Apparatus: 7432,7408,7404 logic kit and connecting wires
Multiplexer Multiplexer, simply called Mux, is a data selector and is capable of “selecting” one of many input lines (usually 2n) and display its input status on the only output line available.
A Mux has 1. Select lines2. Data input lines 3. Output line. Block diagram of 2x1 MUX
i/p’s of Full Adder o/p’s x y z S C 0 0 0 0 00 0 1 1 00 1 0 1 00 1 1 0 11 0 0 1 01 0 1 0 11 1 0 0 11 1 1 1 1
Function Table of 8x1 Mux
i/p of Full Adder = Select lines of MUX
o/p of 8x1 mux
o/p of 8x1 mux
o/p of 8x1 mux
x y z S = Y C = Y0 0 0 0 0 I0
0 0 1 1 0 I1
0 1 0 1 0 I2
0 1 1 0 1 I3
1 0 0 1 0 I4
1 0 1 0 1 I5
1 1 0 0 1 I6
1 1 1 1 1 I7
Procedure:
First of all we check/implement Carry of Full Adder (having 3 inputs) using 8X1 Mux, for this take : I0 = 0, I1 = 0, I2 = 0, I3 = 1, I4 = 0, I5 = 1, I6 = 1, I7 = 1, from Carry column of Truth table of Full Adder and then select x,y,z from Function table of 8X1 Mux and then observe outputs at Y Pin of 74151 IC, that should be equal to Carry of Full Adder for combination of x,y,z at select lines, which is inserted through data switches, this step is repeated for all x,y,z combinations, at select lines to observe Carry of Full Adder.
Then we check/implement Sum of Full Adder for 3 input variables, using 8X1 Mux for this, we take :I0 = 0, I1 = 1, I2 = 1, I3 = 0, I4 = 1, I5 = 0, I6 = 0, I7 = 1, from Sum column of Truth Table of Full Adder, as data inputs to 8X1 Mux, and then for each combination of x,y,z at select lines from Function table. We see output at Y Pin of 74151 IC, which should be equal to value of Sum of
Full Adder for x,y,z combination at select lines, which is inserted through data switches, this step is repeated for all x,y,z combinations, at select lines to observe Sum of Full Adder.
Exp # 11IMPLEMENTATION OF FULL ADDER WITH 2, 2X4 DECODERS
Apparatus: 74139, 7400 IC’s and connecting wires
Decoder : n 2n.n = No. of input lines.2n = No. of outputs of a Decoder.Decoder is a circuit that convert binary information from n-input lines to max of 2n
output lines e.g. if we have 2 inputs i.e. x,y then there will be 4 output of a Decoder and size of Decoder will be 2x4.
Note:By connecting an OR gate with output Pin 1 & 2 of 2X4 Decoder. Half Adder can be implemented with 2X4 decoder. Similarly by connecting two Half Adders, we can form a Full Adder by using 2, 2X4 Decoder IC’s. Truth Table of Full Adder
EXP NO.12 VERIFICATION OF DIFFERENT TYPES OF FLIP FLOPS
APPARATUSIC 7476, IC 7400,IC 7404
OBJECTIVEThe aim of this experiment is to study the fundamentals of basic memory units and to become familiar with various types of flip-flops. We’ll verify the Truth tables of Flip-Flops:
RS-Type D- Type T- Type. JK-Type
THEORYRS flip-flop is also called Synchronous flip-flop. That means that this flip-flop is concerned with time. Digital circuits can have a concept of time using a clock signal. The clock signal simply goes from low-to-high and high-to-low in a short period of time.
Fig. 1 RS Flip Flop and its Truth Table
In case of D flip-flop, The Q output always takes on the state of the D input at the moment of a rising clock edge. (or falling edge if the clock input is active low). It is called the D flip-flop for this reason, since the output takes the value of the D input or Data input, and Delays it by one clock count. The D flip-flop can be interpreted as a primitive memory cell, zero-order hold, or delay line.
In case of T flip-flop, if the T input is high, the T flip-flop changes state ("toggles") whenever the clock input is strobed. If the T input is low, the flip-flop holds the previous value. The truth table is as follows:
The JK flip-flop augments the behavior of the SR flip-flop (J=Set, K=Reset) by interpreting the S = R = 1 condition as a "flip" or toggle command. Specifically, the combination J = 1, K = 0 is a command to set the flip-flop; the combination J = 0, K = 1 is a command to reset the flip-flop; and the combination J = K = 1 is a command to toggle the flip-flop, i.e., change its output to the logical complement of its current value.
B. Use at least 2 levels of abstraction in your Verilog code.
C. Write your own Verilog code in the lab
D. Submit the lab report along with the answers of given questions.
PreLab:This lab describes a hardware description language (HDL).A hardware description language is a language that describes hardware of a digital system, in a textual form. It can be used to represent logical diagrams, Boolean expressions and other complex digital circuits. The language contents can be stored and retrieved easily and can be processed by computer software in an efficient manner. Two major applications of this language are:
1. LOGICAL SIMULATION2. SYNTHESIS
Logical simulationIt is the representation of the structure and behavior of a digital logical system through the use of a computer. The code that tests the functionalities of the design is called “Stimulus” or “Test Bench”. SynthesisLogical synthesis is the process of driving a list of components and their interconnections (called a NETLIST) from the module of a digital system in HDL.
Levels of abstraction in Verilog
The level of abstraction to describe a module can be changes without any change in the environment there are four levels of abstraction:
A module is the basic building block in Verilog. A module can b element of a collection of lower level design blocks.In Verilog, a module is declared by keyword module a corresponding end module must appear at the end of the module definition.
Register Transfer LevelVerilog allows the designer to mix and match all four levels of abstraction in a design. In the digital design community, the term register transfer level (RTL) is frequently used for a Verilog description that uses a combination of behavioral and data flow constructs and is acceptable to a logical synthesis tool.
Post Lab:
Answer 5 questions in this lab and submit then in your lab report.
Lab Work:
Verilog Code For simple two inputs AND Gate.
Gate Level Verilog Code:
module and_gate (Out, A, B); //Starting of module and defining inputs and outputsinput A, B; //inputsoutput Out; //outputsand A1(Out, A, B); //Gate level description of 2 inputs and 1 output AND gateendmodule
module stim; //Stimulus modulereg A,B; //Always make inputs as Reg or Registerswire Out; //Always make outputs as wireand_gate G1(Out, A, B); //Instantiation of main module (i.e. and_gate)initial beginA=0;B=0;#10 begin A=0;B=1;end#10 begin A=1;B=0; end#10 begin A=1;B=1; end#10 begin A=1;B=1; end
Truth Table For 2 Inputs AND GateInput A Input B Output Out
0 0 00 1 01 0 01 1 1
Timing Diagram Verification for the written code:
Some important things that we can see from the above code are: The module always start with keyword module Inside module () we define inputs and outputs but their sequence is not important But in case of gate level description it is very imp that output must be written before the
inputs i.e. AND (Output, Input1, Input2 ……………...Input n) We can also define additional wires i.e. Links other than input or output as explained in
the second example below Some keywords for gate level description are:
module and_gate (Out, A, B); //Starting of module and defining inputs and outputsinput A, B; //inputsoutput Out; //outputsassign Out=A&B; //Data flow description of 2 inputs and 1 output AND gateendmodulemodule stim; //Stimulus modulereg A,B; //Always make inputs as Reg or Registerswire Out; //Always make outputs as wireand_gate G1(Out, A, B); //Instantiation of main module (i.e. and_gate)initial beginA=0;B=0;#10 begin A=0;B=1;end#10 begin A=1;B=0; end#10 begin A=1;B=1; endendendmodule
The most important thing in data flow is the symbols that are used for different gates following are the symbols that are usually used for different gate
Gate Symbol UsedAND &OR |
NOT ~XOR ^
Timing Diagram Verification for the written code:
Hence from the above timing diagram we can see that both out codes perform the same task the difference is of level of abstraction being used i.e. data flow or gate levelVerilog code for a bit complex circuit.
#10 begin A=0;B=0;C=1; end#10 begin A=0;B=1;C=0; end#10 begin A=0;B=1;C=1; end#10 begin A=1;B=0;C=0; end#10 begin A=1;B=0;C=1; end#10 begin A=1;B=1;C=0; end#10 begin A=1;B=1;C=1; endendendmodule
Truth Table
Truth Table for the given circuitInput A Input B Input C Output y Output x
module stim;reg A,B,C;wire x,y;test TT(A,B,C,x,y);initial beginA=0;B=0;C=0;#10 begin A=0;B=0;C=1; end#10 begin A=0;B=1;C=0; end#10 begin A=0;B=1;C=1; end#10 begin A=1;B=0;C=0; end#10 begin A=1;B=0;C=1; end#10 begin A=1;B=1;C=0; end#10 begin A=1;B=1;C=1; endendendmodule
Exp No. 15UNDERSTATING BEHAVIORAL MODELING AND LEXICAL
CONVENTIONS OF VERILOG HDLObjectives:
E. Understand the design methodologies.
F. Lexical conventions.
G. Data types being used in Verilog
H. Develop code in Verilog using behavioral model
I. Have some concept of gate delays
J. Submit the lab report along with the answers of given questions.
PreLab:
Design Methodologies:There are two basic types of design methodologies: a top-down design methodology and a bottom-up design methodology. In a top down methodology, we define the top level block and identify the sub blocks necessary to build the top level block. We further subdivide the sub blocks until we come to leaf cells, which are the cells that cannot be further subdivided. The following figure shows the top-down design
Figure: Top down design methodology
In a bottom up design methodology, we first identify the building blocks that are available to us. We build bigger cells, using these building blocks. These cells are then used for higher-level
blocks until we build the top level block in the design. Following figure shows the bottom-up design process
Figure: Bottom-up design methodology
Lexical Conventions in Verilog
White Spaces:Blank space (\b), tabs (\t), and new lines (\n) comprise the white spaces. White space is ignored by the Verilog except when it separates tokens. White space is not ignored in strings
Comments:Comments can be inserted into the code for readability and documentation. There are two ways to write comments. A one line comment starts with “//”. Verilog skips from that position to the end of the line. A multiple comment starts with “/*” and ends with “*/”.
Operators are of three types: unary, binary and ternary. Unary operators precede the operands. Binary operators appear between two operands. Ternary operators have two separate operators that separate three operands
a = ~ b; // ~ is a unary operatora = b && c; // && is a binary operatora = b? c : d; // ?: is a ternary operator
Number Specification:
Sized NumbersSizes numbers are represented as <size>’<base format><number>.<size> is written only in decimal and specifies the number of bits in the number. Legal base formats are decimal (d or D), hexadecimal (h or H), binary (b or B) and octal (o or O). the number is specifies as consecutive digits from 0,1,2,3,4,5,6,7,8,9,a,b,c,d,e,f. only a subset of these digits is legal for a particular base.
4’b1111 //This is a 4-bit binary number12’habc //This is a 12-bit hexadecimal number16’d255 //This is a 16-bit decimal number
Unsized NumbersNumbers that are specifies without a <base format> specification are decimal numbers by default. Number that are written without <size> specification have a default no of bits that is simulator or machine specific (must be at least 32)
23456 //This is 32-bit decimal number by default ‘hc3 //This is a 32-bit hexadecimal number‘o21 //This is a 32-bit octal number
X or Z valuesVerilog has two symbols for unknown and high impedance values. These values are very important for modeling real circuits. An unknown value is denoted by an x. A high impedance value is denoted by z.
12’h13x //This is a 32-bit hex number 4 least significant bits unknown6’hx //This is a 16-bit hex number
Strings:A string is a sequence of characters that are enclosed by double quotes. The restriction on a string is that is must contain on a single line, that is without carriage return. it cannot be on multiple lines
“Hello Verilog World” //is a string“a / b” //is a string
#10 begin A=0;B=1;C=1; end#10 begin A=1;B=0;C=0; end#10 begin A=1;B=0;C=1; end#10 begin A=1;B=1;C=0; end#10 begin A=1;B=1;C=1; end#100 $finish;endendmodule
#10 begin x=0;y=1; end#10 begin x=1;y=0; end#10 begin x=1;y=1; end#10 $finish;endendmodule
Timing Diagram Verification
Lab Report Questions:
Q1: Write all System tasks and compiler directives along with their functions performed like $<keyword> $display, $monitor, $time, $stop, $finish etc (Hint: use internet for help)?
Q2: Explain the syntax and usage of Integer, Real, Time Register data types used in Verilog. Also explain the syntax and usage of Arrays and Vectors (Hint: use internet for help)?
Q3: Write the difference between INITIAL block and ALWAYS block used in Verilog and also explain the difference between TASKS and FUNCTIONS used in Verilog?
Q4: Explain the usage of FOLK and JOIN statements in Verilog with the help of example?
Q5: Write Verilog code (in behavior model) for the following diagram and also attach the timing diagram and the truth table (Hint: Take help from your teacher)?
Q6: Write Verilog code (in behavior model) for the following diagram and also attach the timing diagram and the truth table (Hint: Take help from your teacher)?
Always and initial blocks.All behavioral statementsGo in these blocks.
Instantiation of lowerLevel modules
Data flow statements(Assign)
Tasks and Functions
53
Lab Manual, Digital Logic Design
Port Connection Rules:One can visualize a port as consisting of two units. One unit that is internal to the module and another that is external to the module. The internal and external units are connected. There are rules governing ports connections when modules are instantiated within other modules. The Verilog simulator complains if any port connection rules are violated. These rules are simulated in the following figure:
Port Connection Rule
Inputs:Internally, input ports must be of the type net. Externally, the inputs can be connected to a variable which is a reg or a net.
Outputs:Internally, output ports can be of type reg or net. Externally, outputs must always be connected to a net. They cannot be connected to a reg.
Inouts:Internally, inout ports must always be of type net. Externally inout ports must always be connected to a net.
Width matching:It is illegal to connect internal and external items of different items of different sizes when making intermodule port connections. However, a warning is typically issued that the widths do not match. Unconnected Ports:Verilog allows ports to remain unconnected. For example, certain ports might be simply for debugging, and you might not be interested in connecting them to the external signals
Gate Delays in Verilog:There are three types of delays in Verilog HDL i.e. Rise, Turn off and Fall delays
Rise delay:The rise delay is associated with a gate output transition to a 1 from another value
Fall delay:The fall delay is associated with a gate output transition to a 0 from another value
Turn-off delay:The turn off delay is associated with a gate output transition to the high impedance value (x) from another value.If the value changes to x, the minimum of the three delays is considered
Post Lab:
Answer all questions in this lab and submit them in your lab report.
Q2: Define at least 5 characteristics of continuous assignment?
Q3: What is the meaning of blocking assignment and non-blocking assignment, Explain with example?
Q4: Define and explain all 4 types of Loops used in Verilog (i.e. While, For, Repeat and Forever) by giving at least 2 examples of Verilog code for each?
Q5: Explain the characteristics of the following types of blocks used in Verilog?
Sequential Blocks Parallel Blocks Nested Blocks Named Blocks
Q6: Write a Verilog code in behavioral model for 4-bit up counter?
Q7: Write a Verilog code in behavioral model for JK-Flip flop?