Finite State Machine Serial Adder
Finite State Machine Serial Adder
net/publication/301849143
CITATIONS READS
0 8,302
1 author:
Divyesh Divakar
Canara Engineering College
9 PUBLICATIONS 7 CITATIONS
SEE PROFILE
All content following this page was uploaded by Divyesh Divakar on 04 May 2016.
Abstract— Logic design is in itself bifurcated to- Combinational Table 1: STATE TABLE of SERIAL ADDER[2]
and Sequential circuits. The later has memory and former doesn’t,
so in an advent effort to incorporate memory into a combinational
circuit brought in the concept of Finite state machine serial adder.
I. INTRODUCTION TO FINITE STATE MACHINE Based on the state table we can construct the state diagram.
The state diagram is as shown in Fig 2. As observed in the state
A finite state machine can be represented by a state
transition table or a state diagram. There is often a fixed
start state which is the initial state of the Finite State Machine
figure as long as the there is no carry generated, it stays in state
G. but if there is a carry generated, it immediately moves to
(before any input has been read). Thus a finite state machine state H. In this state carry is added to the sum. When sum of A
(FSM) is a model describing the behavior of a finite number of & B does not create a carry it moves back to state G.
states, the transitions between those states, and actions [1]. Serial adder requires simple circuitry as compared to parallel
adder, so causes of simple circuitry thus gives low speed and
II. SERIAL ADDER performs bit-by-bit operation [3].
The serial binary adder or bit-serial adder is a digital
circuit that performs binary addition bit by bit. The serial full
adder has three single-bit inputs, two for addition and one for
carry in(C-in). There are two single-bit outputs for the sum and
carry out(C-out). The C-in signal is the previously calculated
C-out signal. Adding each bit, lowest to highest, one per clock
cycle, performs the addition [2]. Fig 1 shows a basic structure
of a FSM serial adder.
Fig 1: Block diagram of a serial adder[2] Simulation was done in two parts, a basic FSM serial adder
which has no storage of its input data or its output & another
The design is based on Mealy model. Let us consider two with shift registers, which acts as dual purpose, i.e. input &
states, G & H i.e. when carry is generated we take H state & output storage.
when carry is zero we take G state. A & B are taken as the
inputs to the serial adder. Table 1 shows the state table of the IV. SIMULATION 1 (FSM SERIAL ADDER)
serial adder [2].
In this simulation we built a full adder using basic gates and
observed the sum via an LED at the output. The two inputs are
www.ijltemas.in Page 65
Volume V, Issue IV, April 2016 IJLTEMAS ISSN 2278 – 2540
During positive pulse, the bits are added, and stored. If carry
is generated it is stored in the first d latch. During negative
pulse the carry is passed into the second d latch where it is
connected to the adders ‘C-in’. Again at positive pulse, new set
of inputs is passed into the adder where the previously
generated carry is added. This process continues for n bit of
values. In case of the simulation that we have done, it is set for
Fig 3: Simulation of FSM serial adder in Multisim.
4-bit addition.
The draw back with this circuit is that it is completely The flaw with this particular simulation is that even though it
manually operated, which means we have to manually enter a is a 4-bit addition, the output could be of 7, 8 or even 10 bit
set of data bit by bit, manually apply clock pulse after every due to no of clock pulses, when the actual value should be only
addition & so on. It becomes difficult to use or in other words, of 4 bits. To elaborate, addition of 0110 & 0010 should give an
it isn’t user friendly. The next simulation takes care of few of output of 1100, but that happens only if 4 clock pulses are
the disadvantages of the current simulation. given. If 7 clock pulses are given the output will be 0001100,
which still give the same value but with unwanted extra bits.
V. SIMULATION 2 (FSM SERIAL ADDER WITH STORAGE) Another flaw is that there isn’t a provision for carry to be
The circuit simulated is pretty much the same, as done added externally. This particular instant might come into use
previously but with few modifications. The simulation is shown when carry needs to be added at the very first instant of
in fig 4. Firstly shift registers are added to the input side if the addition of first two bits.
serial adder, hence making it easier to store data. The output of
the adder, which is the sum, is too stored in a shift register, the VI. CONCLUSION
very same shift register that stores the input initially. This is To build a circuit that can add any two binary numbers using
done so as to save space & it’s economical in the long run. In the sequential method that humans use, a FSM serial adder is
the simulation, the shift register is basically a cascade of D the only solution. For any digital circuit performing operations
latches. Here two types of clocks used i.e. manual clock using such as multiplication, subtraction and division, adders are the
push buttons & an actual clock signal (based on a given basic components used extensively. It is the demand of the day
frequency). To store data the push button is used, which helps to improve the performance of digital adders for the execution
store the data in the shift register (this process is done of binary operations inside a circuit. The main aim of designing
manually). Once the inputs are stored, clock signal is applied & the bit serial adder is to perform one bit at a time, using the
the inputs are passed into the adder, bit by bit. At the carry first bit operation results to influence the processing of
side, we have cascaded two D latches so as to provide subsequent bits. It reduces the amount of hardware required as
sufficient delay while adding the carry to the next cycle. it passes all the bits in the same logic. This approach needs
only (1/n) part of hardware when compared to the n-bit parallel
adders.
www.ijltemas.in Page 66
Volume V, Issue IV, April 2016 IJLTEMAS ISSN 2278 – 2540
ACKNOWLEDGMENT REFERENCES
We would like to thank the Management and the Principal of [1] Steven T. Karris, Introduction to State flow® with Applications, Orchard
our Institution for providing us the facility to work on this Publications.
paper. The authors also gratefully acknowledge [2] S.Shirani, www.ece.mcmaster.ca/~shirani/2di4/chapter8p2.pdf
[3] Ashivani Dubey and Jagdish Nagar, Acropolis Institute of Technology
Dr. Rajalakshmi Samaga B L, Head of Electrical and
and Research, Indore, India, “Comparison between Serial Adder and
Electronics Engineering Department, for the moral support
Parallel Adder" IJSERT September, 2013
throughout the work.
www.ijltemas.in Page 67