DCS Lab Manual Complete
DCS Lab Manual Complete
(IT-302)
LAB MANUAL
B.TECH- INFORMATION TECHNOLOGY
Vision of Department
To transform young minds into competent Information Technology professionals
by synergizing ethical values and adapting the technological advancements to meet
global challenges.
Mission of Department
● M1 : To continuously strive for the overall development of students by
educating them in latest IT technologies.
Course Outcomes
CO 1 Solve problems of number systems ,code conversion and Boolean algebra.
CO 2 Design various combinational circuit and implement then using universal
gate.
CO 3 Design sequential circuits such as counter using various flip flops.
CO 4 Summarize various digital logic families with their specifications
CO 5 Explain functions of various multi vibrator, display devices and signal
converters
Course Articulation Matrix (CO-PO-PSO
Mapping)
POs PO PO PO PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
1 2 3
COs
CO1 3 0 0 2 2 0 0 0 2 0 0 0 2 0
CO2 2 2 3 0 2 0 0 0 2 0 0 0 2 0
CO3 2 2 3 0 0 0 0 0 0 0 0 0 2 0
CO4 2 0 0 0 0 0 0 0 0 0 0 0 0 0
CO5 2 0 0 0.00 0 0 0 0 0 0 0 0 2 0
Avg. 2.20 0.80 1.20 0.40 0.80 0.00 0.00 0.00 0.80 0.00 0.00 0.00 1.60 0.00
INDEX
● Download & Install Free Student Version of PSpice
1. Study and verify the operations of AND, OR, NOT, NOR and NAND logic
gates.
2. Design all basic logic gates using NOR gate.
This manual will help you to start your simulation on OrCAD PSpice software. This will give the
introduction of software and a process to download and install freely available student version of
PSpice.
How to Download
We can download and install PSpice free student version 9.2 from internet. First open the Google
and type PSpice student version 9.2 free download.
Figure 1: Google search
This will give you a list of various download sources. Click on first link which is PSPICE Links.
This will open a window like figure 2. Chose “Where can I get my own copy of PSPICE using
Schematics?”
Click on Download locally
Your Download will start
Figure 2: Link to Download
Downloaded zipped file will be available in Downloads folder of your pc as shown in figure 3.
The file named 91pspstu will be present there. Double click on that file, and it will ask you
whether you want to unzip the file or not, and also it will ask where would you like to unzip the
file, as shown in the figure below,
Figure 3: Unzip the file in specific folder
You can create a folder in C drive and named it as pspice. Unzip the zipped file in that folder. It
will extract all files in that folder. Click on Setup file.
● While the setup is running it will not allow you to run any other application, don’t panic
its normal. After the setup copies all the files from PSPICE to your system a final prompt
message will appear asking you to finishing the installation as shown in the figure below,
●
● Now go to the search bar of your system of press the search button present on the
keyboard and type capture as shown in the figure below,
To open capture student we can tupe ‘capture’ in search at the bottom of the screen
(Windows 10) or go to start and find capture under pspice in programs. Before we open it
for the very first time we must run it as administrator. For this we need to right click on
capture and click run as administrator. Figure below shows this process.
Chose Create a blank project when we got such a message. This will open a workspace
for design of a project something like a bread board. Please ensure you will have the
necessary buttons on our page as shown below in fig 3.
A circuit which performs an AND operation is shown in figure. It has n input (n >= 2)
and one output.
Logic diagram
Truth Table
Design of circuit
Select all the libraries and open it, this will add all the libraries to your part list. Each
library contains some part of importance for example
● Logic gates are in EVAL library
● Digital clock is in SOURCE library
Some other parts can be found on the screen itself for example
● Wire is available at extreme right hand side of screen
● Voltage marker is available at top of the screen
Figure 5: Voltage marker
In the circuit of fig 7 we have used one AND gate, two digital clocks and three voltage
markers. For first clock ON time and OFF time are kept 0.5us means it will give a time
period of 1us, On the other hand the time period of second clock is kept 2us so that
it will be ON of 1us and OFF for 1us. This is done to get all the four possible
combinations of the two inputs.
Clock 1
Clock 2
For these type of experiments we need to set Analysis Type as Time Domain (Transient)
and Run to time is kept as 2us so that it will show one complete cycle of our analysis.
Click Apply and ok go move further.
Now, a window of SCHEMATIC will appear on the screen (sometimes schematic and simulation
profile window will appear in the Taskbar as shown in fig 11).
Run the simulation again after modifications. The Schematic will appear as shown in figure 13.
The three waveforms V1, V2 and AND.
From this figure 13, we can see that the circuit performing the operation of logic AND. The two
inputs V1 and V2 are generating four input combinations as listed below. The output is
equivalent to logic AND operation of the two given inputs.
Tab file
Then merge screenshots of the circuit diagram and output in a page and pin in your lab file.
Similarly we can verify other logic operations like OR. NOT, NAND and NOR.
EXPERIMENT – 1
AIM - Study and verify the operations of AND, OR, NOT, NOR and NAND logic gates.
Wire
Theory:
Electric Logic
• “True” or “1” can be defined as voltage on a wire while “False” or “0” can be define as no
voltage.
• Analog values can be anything while digital logic only has discrete values, 0 or 1
OR GATE CIRCUIT
OR GATE OUTPUT
RESULT: The operations of AND, OR, NOT, NOR and NAND logic gates are verified.
EXPERIMENT – 2
Digclock
Theory :
In Boolean Algebra, the NAND and NOR gates are called universal gates because any digital
circuit can be implemented by using any one of these two i.e. any logic gate can be created using
NAND or NOR gates only.
All the basic gates can be implemented using NOR gate and that is why NOR gate is also known
as universal gate.
A single NOR gate with joining of both inputs perform the function of NOT gate. The input is
negated and the output thus obtained is the inversion that is characteristic of a NOT gate.
The OR gate is created by using an inverse of the output of the NOR operation. An inverted form
of the inputs is provided directly into the NOR gate while the output is provided in NOR gate
using fixed inputs. This inversion gives the OR gate logic.
An AND gate can be made using three NOR gates. First, the inputs are combined with a NOR
gate. Then, the result is negated twice using two more NOR gates. This setup ensures the AND
function, where all inputs must be true (1) for the output to be true.
Digclock
Theory :
All the basic gates can be implemented using NAND gates and that is why NAND gate is also
known as universal gate.
A single NAND gate with ‘a’ and ‘b’ inputs connected respond to a NOT gate. The NOT gate
function is achieved as the result of NAND operation because the input signal is inverted.
An AND gate can be made using two NAND gates. The first NAND gate gives a standard
NAND output. The second NAND gate takes this output as both its inputs, flipping it to act like
an AND gate. The final output is HIGH only when both inputs are HIGH.
An OR gate can be made using three NAND gates. First, two NAND gates invert the inputs.
Then, these inverted outputs are fed into a third NAND gate, which combines them to produce
the OR function.
Wire
Theory :
Two of the theorems were suggested by De Morgan that are extremely useful for Boolean
Algebra. These two theorems have been discussed below :
De Morgan’s Theorem 1:
● The left-hand side of this theorem represents the NOR gate that has inputs A and B. On
the other hand, the right-hand side represents the AND gate that has inverted inputs.
● The AND gate here is known as a Bubbled AND.
● The complement of the sum of two or more variables is equal to the product of the
complement of the variables.
(A + B)’ = A’.B’
● The LHS (left-hand side) of this theorem represents the NAND gate that has inputs A and
B. On the other hand, the RHS (right-hand side) of this theorem represents the OR gate
that has inverted inputs.
● The OR gate here is known as a Bubbled OR.
● The complement of the product of two or more variables is equal to the sum of the
complements of the variables.
(A.B)’ = A’ + B’
AIM – Construction and verification of half adder and full adder circuits.
Wire
Theory :
Half adder :
● The half adder adds two binary digits called as augend and addend and produces two outputs
as sum and carry.
● 0 + 0 = 00
1 + 0 = 01
0 + 1 = 01
1 + 1 = 10
TRUTH TABLE
Input output
A B sum carry
0 0 0 0
0 1 1 0
1 0 1 0
1 1 0 1
● 1- bit adder can be easily implemented with the help of XOR gate for the output ‘SUM’ and
an AND gate for the carry.
● The half adder is useful to add one binary digit quantities.
Full adder :
● The difference between half adder and full adder is that full adder has 3 input and 2 output
whereas half adder has 0nly 2 inputs and 2 outputs.
● The first two are A and B and the third input is an input carry as C-IN.
● The output carry is designated as C-OUT and the normal output is designated as S.
TRUTH TABLE:
INPUTS OUTPUT
A B C-IN C-OUT S
0 0 0 0 0
0 0 1 0 1
0 1 0 0 1
0 1 1 1 0
1 0 0 0 1
1 0 1 1 0
1 1 0 1 0
1 1 1 1 1
● The implementation of a full adder can be done by adding two half adders.as show in the fig.
Full Adder
Output :
Half Adder
Output :
AIM - Construction and verification of half subtractor and full subtractor circuits.
Digclock Wire
Theory:
Subtractor : Subtractor is the one which used to subtract two binary number(digit) and
provides Difference and Borrow as a output . In digital electronics we have two types of
subtractor .
1. Half Subtractor
2. Full Subtractor
Half Subtractor : Half Subtractor is used for subtracting one single bit
binary digit from another single bit binary digit . The truth table of Half Subtractor is
shown on the next page.
From the Truth Table The Difference and Borrow will written as
= A'B'C + A'BC '+ A'BC + A'BC + A'BC + ABC A'BC + A'BC + A'BC +A'BC
= A'C(B' + B) + A'B(C' + C) + BC(A' + A)
Borrow=A'C + A'B + BC
The logic diagram of Full Subtractor is Shown below
Full Subtractor
Output :
Half Subtractor
Output :
The logical circuit which converts binary code to equivalent gray code is known as binary to
gray code converter. The gray code is a non weighted code. The successive gray code differs in
one bit position only that means it is a unit distance code. It is also referred as cyclic code. It is
also a reflective code. An n-bit Gray code can be obtained by reflecting an n-1 bit code about an
axis after 2n-1 rows, and putting the MSB of 0 above the axis and the MSB of 1 below the axis.
That means, in 4 bit gray code, (4-1) or 3 bit code is reflected against the axis drawn after (24-1)th
or 8th row. The bits of 4 bit gray code are considered as G4G3G2G1. Now from conversion table,
From above SOPs, let us draw K -maps for G4, G3, G2 and G1.
In gray to binary code converter, input is a multiplies gray code and output is its equivalent
binary code.
Let us consider a 4 bit gray to binary code converter. To design a 4 bit gray to binary code
converter, we first have to draw a conversion table
From above gray code we get,
Binary to Gray Code Convertor
Output :
Gray Code To Binary Convertor
Output :
RESULT: Logic circuit for converters, Binary to Grey Code and Grey Code to Binary Code.
EXPERIMENT – 8
Theory: A code converter is a circuit that makes the two systems compatible even though each
uses a different binary code. To convert from binary code to Excess-3 code, the input lines must
supply the bit combination of elements as specified by code and the output lines generate the
corresponding bit combination of code.
The input variable are designated as B3, B2, B1, B0 and the output variables are designated as
C3, C2, C1, Co. from the truth table, combinational circuit is designed. The Boolean functions
are obtained from K-Map for each output variable.
K-Map for E3 :- K-Map for E2 :-
Theory:
● A multiplexer is a combinational circuit that has many data inputs and a single output,
depending on control or select inputs.
● Multiplexers are also known as “N-to-1 selectors,” parallel-to-serial converters,
many-to-one circuits, and universal logic circuits.
● For N input lines, log2(N) selection lines are required, or equivalently, for 2^n input
lines, n selection lines are needed.
● They are mainly used to increase the amount of data that can be sent over a network
within a certain amount of time and bandwidth.
2 × 1 Multiplexer :-
The 2×1 is a fundamental circuit which is also known 2-to-1 multiplexer that are used to choose
one signal from two inputs and transmits it to the output. The 2×1 mux has two input lines, one
output line, and a single selection line.
Given Below is the Block Diagram and Truth Table of 2:1 Mux.
In this Block Diagram where I0 and I1 are the input lines ,Y is the output line and S0 is a single
select line.
Truth table :
The output of the 2×1 Mux will depend on the selection line S0,
Using the Truth Table ,the Logical Expression for Mux can be determined as :-
2 × 1 MULTIPLEXER
Output:
Theory:
1×2 De-multiplexer :-
In the 1 to 2 De-multiplexer, there are only two outputs, i.e., Y0, and Y1, 1 selection lines, i.e.,
S0, and single input, i.e., A.On the basis of the selection value, the input will be connected to one
of the outputs.
The block diagram and the truth table of the 1×2 multiplexer are given below.
Truth table:
The output of the 1×2 De- Mux will depend on the selection line S0,
Y0=S0'.A
Y1=S0.A
1 × 2 DE- MULTIPLEXER
Output:
Sources of Information:
1. https://www.youtube.com/watch?v=8wvcwUMKvNE
2. https://microcontrollerslab.com/
3. https://resources.orcad.com/orcad-blog/pspice-simulation
4. http://www.eng.auburn.edu/~troppel/pspice_links.html