NashikGraminShikshanPrasarakMandal’s

BRAHMAVALLEYCOLLEGEOFTECHNICAL
EDUCATION, ANJANERI, NASHIK

Electronics And Computer Technology

PROJECTWORKBOOK

YEAR2024-2025
ProjectTitle:Digital Arithmetic Circuit
Name of Student: Nayan Bhausaheb Hire
Om Dinesh Deore
Kishor Ramesh
Ahire

Roll No: Exams No. :

ProjectGuide: [Link]
 MAHARASHTRASTATE
BOARDOFTECHNICALEDUCATION(MSBTE),MUMBAI

BrahmaValleyCollegeofTechnicalEducation,
Anjaneri, Nasik
Electronics And ComputerTechnology

2024-2025

A
ProjectReport
On
[DigitalArithmetic Circuit]
By
[Nayan Hire]
[Om Deore]
[Kishor Ahire]

Undertheguidanceof

[[Link]]
 BrahmaValleyCollegeofTechnical
Education,
Anjaneri,Nasik

DepartmentofComputerTechnology

CERTIFICATE
This is to certify that

[Nayan Hire]
[Om Deore]
[Kishor Ahire]

have successfully completed their Project on “Digital Arithmetic circuit” at

Brahma Valley College of Technical Education, Anjaneri, Nashik in the partial
fulfillmentoftheDiplomacourseinElectronicsAndComputerTechnologyintheacad
emicYear 2024-2025.

Prof.S. N. Katore
Guide External

[Link] Prof.V.P. Nikhade

Head of Department Principal
 BrahmaValleyCollegeofTechnical
Education,
Anjaneri,Nasik

Electronics And Computer Technology

CERTIFICATE

This is to certify that Nayan Hire from Electronics And Computer

Technology Department has successfully completed his/her Projecton

“Digital Arithmetic Circuit”at

BrahmaValleyCollegeofTechnicalEducation,Anjaneri,Nashikin the partial

fulfillment of theDiploma course in Electronics And Computer Technology in

the academic Year 2024-2025.

Prof.S. N. Katore
Guide External

[Link] Prof.V.P. Nikhade

Head of Department Principal
 ACKNOWLEDGEMENT

I wouldliketodeeplythankthevariouspeoplewho, duringtheseveralmonthswhichthis
endeavor lasted, provided us with useful and helpful assistance. Without care and
consideration, this seminar would likely not have matured.

[Link]. Her
guidance reflects expertise we certainly do not master ourselves. I also thank him for
his patience throughout, in cross-reviewing which constitutes a rather difficult
balancing act.

Second,IwouldliketothankalltheStaffMembersofComputerDepartmentforproviding
[Link]
extend my thanks to our lab assistants who guided us in implementation of our seminar.

I would like to extend my special thanks to our Principal, Prof. V. P. Nikhadefor his
encouragement and words of wisdom.

Finally,Iexpressmydeepestgratitudetomyfamilyandfriendswhoencouragedmesince the
beginning and provided me with their insightful reviews to help me make my Project
successful.

[Nayan Hire]
[Om Deore]
[Kishor Ahire]
 Index
Sr. contents Page
No. No.
1 Abstract 1
2 Introduction 2
3 TypesofAdder 3
4 conclusion 4
 ABSTRACT

In the present scenario,most of the electronicequipment like computers,

mobiles,
musicsystems,ATMs,automationandcontrolcircuits,andsystemsarebasedondigi
talcircuitswhich the diploma electronic engineering pass-outs (also called
technologists) have
[Link],combinationalandsequentiallogiccircuit
susingdiscretegatesaswellasdigitalICswillenablethestudentstointerpretthewor
kingoftheequipment and maintain them. After completion of the course,
students will be able todevelop digital circuit-based applications

1
 Introduction
Arithmeticcircuitscanperformsevendifferentarithmeticoperationsusingasinglecomposite circuit.

Itusesafulladder (FA)[Link](MUX)isusedtoprovide different inputs

to the circuit in order to obtain different arithmetic operations as outputs.

4-bitArithmeticCircuit:

[Link] arithmetic
operations by varying the inputs of the multiplexer and the carry (C0).

2
 Typesof Adder
HalfAdder:

Halfadderisacombinationalcircuit,whichperformstheaddition of
two binary numbers A and B are of single bit. It produces two
outputs sum, S & carry, C.

TheTruth tableofHalfadderisshown below.

Whenwedothe additionoftwobits,theresultantsum canhave the

values ranging from 0 to 2 in decimal. We can represent the
decimal digits 0 and 1 with single bit in binary. But, we can’t
[Link],werequire two bits
for representing it in binary.

Let, sum, S is the Least significant bit and carry, C is the Most
[Link]
inputs, carry, C is zero and the value of S will be either zero or
one based on the number of onespresent at the inputs. But, for last
combination of inputs, carry, C is one and sum, S is zero, since
the resultant sum is two.

FromTruthtable,wecandirectlywritetheBooleanfunctionsfor each
output S=A⊕B = ⊕ C=AB = We can implement the

3
above functions with 2-input Ex-OR gate & 2-input AND gate.
ThecircuitdiagramofHalfadderisshowninthefollowingfigure.

In the above circuit, a two input Ex-OR gate & two input AND
gateproducessum,S&carry,[Link],Half- adder
performs the addition of two bits.

FullAdder:

Full adder is a combinational circuit, which performs the addition

of three bitsA, B and Cin. Where, A & B are the two parallel
significant bits and Cin is the carry bit, which is generated from
[Link],S &
carry, Cout, which are similar to Half adder.

TheTruthtableofFulladderisshown below.

4
When we do the addition of three bits, the resultant sum can
[Link] the
decimal digits 0 and 1 with single bit in binary. But, we can’t
represent the decimal digits 2 and 3 with single bit in binary. So,
we require two bits for representing those two decimal digits in
binary.

Let, sum, S is the Leastsignificantbitand carry, C out is the Most

significant bit of resultant sum. It is easy to fill the values of
outputs for all combinations of inputs in the truth table. Just
count the number of onespresent at the inputs and write the
[Link],then Full
adder truth table is same as that of Half adder truth table.

Wewillgetthefollowing Booleanfunctionsforeachoutputafter
simplification.

S=A⊕B⊕Cin = ⊕ ⊕ cout=AB+(A⊕B)cin = +( ⊕ )

Thesum, Sisequaltoone, whenodd numberofonespresentat the

inputs. We know that Ex-OR gate produces an output, which
[Link],we canuseeithertwo2inputEx-ORgates or one
3-input Ex-OR gate in order to produce sum, S. We can
implement carry, Cout using two 2-input AND gates & one OR
gate. The circuit diagramof Full adder is shown in the following
figure.

5
This adder is called as Full adderbecause for implementing one
Full adder, we require two Half adders and one OR gate. If C in is
zero,[Link] from
the above circuit diagram or from the Boolean functions of
outputs of Full adder.

4-bitBinaryAdder

The4-bitbinaryadderperformstheaddition oftwo4-bitnumbers.
Letthe4-bitbinary
numbers,A=A3A2A1A0 = 3 2 1 0andB=B3B2B1B0 = 3 2 1 0.
Wecanimplement4-bitbinaryadderinoneofthetwofollowing ways.

 Use one Half adder for doing the addition of two Least
significantbitsandthreeFulladdersfordoingtheaddition of
three higher significant bits.
 [Link],initialcarryCinis zero,
the Full adder which is used for adding the least significant
bits becomes Half adder.

Forthetimebeing,[Link] block
diagramof 4-bit binary adder is shown in the following figure.

Here, the 4 Full adders are cascaded. Each Full adder is getting
therespectivebitsoftwoparallelinputsA&[Link] of one
Full adder will be the carry input of subsequent higher order Full
adder. This 4-bit binary adder produces the resultant sum having
atmost5bits. So, carry outof laststage Full adder will be the MSB.

6
Inthisway,wecanimplementanyhigherorderbinaryadderjust by
cascading the required number of Full adders. This binary adder is
also called as ripple carry binary adderbecause the carry
propagates ripples from one stage to the next stage.

BinarySubtractor

Thecircuit,whichperformsthesubtractionoftwobinarynumbers is
known as Binary subtractor. We can implement Binary subtractor
in following two methods.

 CascadeFullsubtractors
 2’scomplement method

Infirstmethod,wewillgetann-bitbinarysubtractorby
cascading ‘n’ Full subtractors. So, first you can implement Half
subtractor and Full subtractor, similar to Half adder & Full adder.
Then,youcanimplementann-bitbinarysubtractor,bycascading ‘n’
Fullsubtractors. So, wewillbehaving twoseparatecircuitsfor binary
addition and subtraction of two binary numbers.

Insecondmethod,wecanusesame. binaryadderforsubtracting two

binary numbers just by doing some modifications in the second
input. So, internally binary addition operation takes place but, the
output is resultant subtraction.

Weknowthatthesubtractionoftwo binarynumbersA&B can be

written as,

A−B=A+(2′scomplimentofB) − = +(2′ )

⇒A−B=A+(1′scomplimentofB)+1

7
 Conclusion

Theadderformsthebasisforall ofthearithmeticfunctionsin theALU.

Subtraction,
multiplication,anddivisionallareimplementedusingalgorithmswhicharebased
on the adder. The adder is therefore a stand in for all of the other types of
functions performed by the ALU.

Despite the appearance that addition is more complex, it can be

implemented as a Boolean function consisting only of AND, OR, and XOR
gates. These simple Boolean functions are implemented in circuits called
half adders and full adders. It is when
thesefunctionsarechainedtogethersothatthe
carryfromeachpreviousfunctionis used in the next function that the adder
can add larger numbers.

The implementation of the full adder circuit is more complex than the
other circuits which have been looked at so far. It required 3 different
chips, 2 outputs, and 5
[Link]
nd forethought to implement and debug it.

Theadderwasthefirst circuit implemented in thistext that isacomponent,

and it hasbeenencapsulated asanIC. The7482(2-bitbinaryfulladder)and
7483(4-bit binary full adder) IC chips are implementations of this circuit.