INTERNATIONAL JOURNAL OF INNOVATIVE TECHNOLOGIES, VOL.

01, ISSUE 03, SEP 2013 ISSN 2321 –8665

Design 4-Bit Binary Counter with Parallel Load using

Nanometric Technique
1
Ms. P.SWETHA 2Mr.MD.SHAHBAZKHAN 3Mr.E N V PURNACHANDRA RAO
1
M.Tech, CMRIT, Kandlakoya, Medchal, RangaReddy[D], Hyderabad, AP-INDIA,
E-mail: swetha.pulgam@gmail.com
2
Associate Professor, E-mail:shahbazkhan434@gmail.com
3
ECE Department HOD, CMRIT

Abstract- In this paper, we propose a
reversible 4-Bit binary counter with parallel
load. It has minimum complexity and quantum
cost considerably. The planned circuit is the
first attempt of designing a 4-Bit binary
counter with parallel load. Counter is
basically a register that goes through a
predetermined sequence of state. The
reversible gates in the counter are connected
in such a way as to produce the prescribed
sequence of binary states. Then this counter
receives a 4-Bit data from input and delivers
data to D Flip Flop in subsequently cycle.
Loading data from input is determined with
Load property. Then the important reversible
gates used for our reversible logic synthesis
are Feynman gate, Fredkin gate and Peres
gate. The planned circuit becomes a robust
design by our optimal method and using these
gates. The proposed circuit has minimum
number of the garbage outputs and constant
inputs in reversible circuit. The planned
circuit is the first attempt and efficient state
for a nanometric reversible 4-Bit binary
counter. Further complex systems could be
constructed using the proposed circuit.
1. INTRODUCTION
Reversible gates have applications in
quantum computing, low power CMOS
design, low power computing, optical
computing, optimal information processing,
nanotechnology and DNA computing.
Quantum computing theory is basis of
quantum gates. The reversible state of
Quantum mechanical system is foundation of
reversible quantum circuits. The 1×1 and 2×2
quantum gates are introduced in some
quantum techniques (Kaye, 2007). We use
from 1×1 and 2×2 quantum gates to implement
IJIT@2013
www.picopublications.org
the bigger gates like 3×3quantum gate.
Number of the 1×1 and 2×2 gates is quantum
cost (QC) of a reversible or quantum circuit.
Number of gates (NOG), number of constant
inputs (Gin), number of garbage outputs
(Gout), number of transistors and quantum
cost are major factors of complexity in
reversible logic design. The quantum cost is an
important factor for evaluating a circuit
design. One of the major problems of
reversible gates is that Fan-out is not allowed.
Traditional irreversible logic circuits
were more simplex circuits than quantum or
reversible logic circuits. Reversible logic has
efficient characteristic that constructs the
circuits as a optimal design. The Conventional
circuits if different with synthesis of a
reversible logic circuit. Some of the reversible
logic circuits are synthesized and optimized by
genetic algorithms. A reversible logic circuit
should use the below features:
 Minimum number of reversible gates.
 C Minimum number of garbage
outputs.
 C Minimum constant inputs.
 C Keep the length of cascading gates
minimum.
Garbage output is some of the inputs
that are not used for further computations.
Constant input is some of the inputs that are
added to an n x k function. It causes to make
the circuits as reversible state. A circuit with
flip-flops is considered a sequential circuit
even in the absence of combinational logic.
Circuits that consist of flip-flops are usually
classified by the function of them. Counter is
essentially a register that goes through a
predetermined sequence of states. Gates in the
288
INTERNATIONAL JOURNAL OF INNOVATIVE TECHNOLOGIES, VOL. 01, ISSUE 03, SEP 2013
counter are connected in such a way as to
produce the prescribed sequence of binary
states. These gates construct a counter circuit.
A counter with parallel load can be used to
create any desired count sequence. A 4-bit
counter with parallel load can be used to
generate a BCD count in two ways:
Using the load input: Overview of this design
is shown in Fig. 1.
Using the clear input: Overview of this design
is shown in Fig. 2.
Fig. 1: 4-Bit Counter Using The Load Input.
Fig. 2: 4-Bit Counter Using the Clear Input.
2. RELATED WORK
BINARY COUNTER
Before starting with counters there is
some vital information that needs to be
understood. The most important fact that since
the outputs of a digital chip can only be in one
of two states, it should use a different counting
IJIT@2013
www.picopublications.org
ISSN 2321 –8665
system than you are accustomed to. Generally
we use a decimal counting system; meaning
each digit in a number is represented by one of
10 characters (0-9). In a binary system, there
can only be two characters, 0 and 1.A
computer does not recognize 0 or 1. It just
works on voltage changes. What we call logic
0 to a computer is zero volts. What we call
logic 1 is +5 volts. When a logic state changes
from a zero to a one the voltage at the pin in
question goes from zero volts to +5 volts.
Likewise, when a logic state changes from a
one to a zero the voltage is changing from +5
volts to zero volts. While counting up in a
decimal system, we start with the initial digit.
When that digit ‘overflows’, i.e. gets above 9,
we set it to 0 and also add one to the next digit
over. The similar goes for a binary system.
While the count goes above 1 we add one to
the next digit over and set the first digit to 0.
Here, an example.
DECIMAL TO BINARY CONVERSION
Decimal Number (base 10) Binary Number (base 2)
0 0
1 1
2 10
3 11
4 100
5 101
6 110
7 111
8 1000
9 1001
10 1010
BINARY COUNTING
To convert a binary number to a
decimal, we use a simple system. Each digit,
or ‘bit’ of the binary number represents a
power of two. All you want to do to convert
from binary to decimal is add up the
applicable powers of 2. In the case below, we
find that the binary number 10110111 is equal
to 183. Then the diagram also shows that eight
bits make up what is called a byte. Nibbles are
the upper otherwise lower four bits of that
byte. Referring to bytes and nibbles are useful
when dealing with other number systems such
as hexadecimals, which is base 16.
289
INTERNATIONAL JOURNAL OF INNOVATIVE TECHNOLOGIES, VOL. 01, ISSUE 03, SEP 2013
Fig 3. Convert a binary number to a decimal
The counter you will use in lab is the
74XX161, the XX determines what
technology was implemented when the chip
was built. It may either not be there at all, i.e.,
74161 or it could have been made with Lower
Power Schottky characteristics and be
designated 74LS161. The data sheet is used
for an MC14161 counter from Motorola. The
MC14161 is no longer made, though, the data
specifications are identical.
Some very important things should be
noticed about this diagram. Initial, the pins on
the chip diagram are not presented in their
actual order. This is a general practice to keep
the schematic as neat as possible. Be sure to
hook up the pins properly on the actual circuit.
3. REVERSIBLE LOGIC
In this section, we describe the
structure and functionality of reversible gates
that are used in our design. Some of the
reversible gates are described to compare with
other studies. Finally, we will discuss about
quantum gates. There is a one-to-one
correspondence between the inputs and the
outputs. Thus an n-input n-output function F is
IJIT@2013
www.picopublications.org
ISSN 2321 –8665
reversible. In this sense, the input vector will
be determined from the output vector. Some of
the technologies such as CMOS, optical
circuits and nanotechnology can implement
primary reversible logic gates.
Reversible Logic Gates:
An n x n reversible gate can be shown as
below form:
Iv = (I1, I2, I3,…, In)
Ov = (O1, O2, O3,…, On)
Iv and Ov are input and output vectors
correspondingly. If there are n inputs in a
circuit then exists 2n reversible n n gates. A
set of joined gates Construct the reversible
circuit. These circuits contain the parallel lines
similar to the musical lines. In fact, the
inputs/outputs of the circuit are formed of
these lines. The gates are located on these
parallel lines. Work of the music pieces is a
basis form that design and implement a
reversible circuit. These gates have not same
functional complexity and quantum cost.
These efficient factors are variable and depend
on the structures.
4. 4-BIT BINARY COUNTER WITH
PARALLEL LOAD:
A 4-Bit binary counter with parallel
load can be used to create any desired count
sequence. It can be used to generate a BCD
count. The capability of its circuit is shown in
Fig. 4. When both of L and C inputs are "0"
then any changes do not happen in the circuit.
Count up characteristic is the main operation
in its circuit.
Fig. 4 D Flip Flop gate.
Nanometric Reversible 4-Bit Binary
Counter with Parallel Load
The construction and operations of a
4-Bit binary counter with parallel load is
shown in Fig. 5. The important reversible
gates used for our reversible logic synthesis
290
INTERNATIONAL JOURNAL OF INNOVATIVE TECHNOLOGIES, VOL. 01, ISSUE 03, SEP 2013 ISSN 2321 –8665

are Feynman gate, Fredkin gate AND Peres 5. RESULTS

gate.

This counter receives a 4-Bit data

from input and delivers data to D Flip Flop in
next cycle. Loading data starting input is
determined with L property. The planned
circuit is the first attempt of designing a 4-Bit
binary counter with parallel load. It has lowest
number of reversible gates, constant inputs and
garbage outputs. Our proposed circuit has
minimum value of the quantum cost. The
proposed reversible circuit has two sections.
Initial, the computing operations are Fig 6.Rtl Schematic
performed on inputs or feedback data. This
part is constructed of the Peres gates and the
Feynman gates. Second, D Flip Flop stores the
entered data and then feedback them to the
circuit inputs. We have implemented the
computing operations using Peres gate instead
of the other gates because it cause to our
proposed circuit be optimal. The Peres gate
has various of the computation features with
minimum quantum cost.
Fig. 7 Synthesis Report

SIMULATION RESULTS

Fig 5. 4-Bit binary counter with parallel load
We have performed XOR, AND, OR
operations using Peres gates. in the second
approach, we have used D Flip Flop to stores
the entered or incremented data. In addition, it
wants four Feynman gates to copy the outputs
data and feedback them to the circuit inputs.
IJIT@2013
www.picopublications.org
6. CONCLUSION
In this paper, we proposed a robust
reversible circuit for a 4-Bit binary counter
with parallel load. The proposed reversible
circuit is the first attempt of designing the
mentioned counter. It has minimum
complexity and quantum cost considerably.
Table 2 demonstrates the proposed reversible
circuit is a first attempt and efficient design in
term of hardware complexity, garbage outputs,
constant inputs, and number of gates.
However, restricts of the reversible circuits
were avoided excellent. More complex
systems could be also constructed using our
proposed circuit. Some of the techniques to
291
INTERNATIONAL JOURNAL OF INNOVATIVE TECHNOLOGIES, VOL. 01, ISSUE 03, SEP 2013 ISSN 2321 –8665

reduce the constant inputs and garbage outputs [9]. Kaye, P., R. Laflamme and M. Mosca,
might be possible. In addition, some other 2007. An Introduction to Quantum Computing
optimization techniques like genetic algorithm (Oxford University Press).
may be utilize to reduce the quantum cost of
the circuit. [10]. Gupta, P., A. Agrawal and K.J. Niraj,
2006. An algorithm for synthesis of reversible
7. REFERENCES logic circuits, IEEE TCAD of Integrated
Circuits and Systems, 25(11): 2317-2330.
[1]. Landauer, R., 1961. Irreversibility and
heat generation in the computing process, IBM [11]. Mohammadi, M. and M. Eshghi, 2009.
J. Research and Development, 5(3): 183-191. On figures of merit in reversible and quantum
logic designs, Quantum Information
[2]. Kerntopf, P., M.A. Perkowski and M.H.A. Processing, Published online.
Khan, 2004. On universality of general
reversible multiple valued logic gates, IEEE [12]. Maslov, D. and G.W. Dueck, 2003.
Proceeding of the 34th international Garbage in reversible design of multiple
symposium on multiple valued logic output functions, in 6th International
(ISMVL’04), pp: 68-73. Symposium on Representations and
Methodology of Future Computing
[3]. Perkowski, M., A. Al-Rabadi, P. Kerntopf, Technologies, pp: 162-170.
A. Buller, M. Chrzanowska-Jeske, A.
Mishchenko, M. Azad Khan, A. Coppola, S.
Yanushkevich, V. Shmerko and L. Jozwiak,
2001. A general decomposition for reversible
logic, Proc. RM’2001, Starkville, pp: 119-138.

[4]. Perkowski, M. and P. Kerntopf, 2001.

Reversible Logic. Invited tutorial, Proc.
EURO-MICRO, Sept 2001,

[5].Warsaw, Poland.Bennett C.H., 1973.

Logical reversibility of computation, IBM J.
Research and Development, 17: 525-532.

[6]. Thapliyal Himanshu, and M.B. Srinivas,

2005. Novel reversible TSG gate and its
application for designing reversible carry look
ahead adder and other adder architectures,
Proceedings of the 10th Asia-Pacific
Computer Systems Architecture Conference
(ACSAC 05). Lecture Notes of Computer
Science, Springer-Verlag, 3740: 775-786.

[7]. Saiful Islam, M.D. and M.D. Rafiqul

Islam, 2005. Minimization of reversible adder
circuits. Asian J. Inform. Tech., 4(12): 1146-
1151.

[8]. Vasudevan, D.P., P.K. Lala and J.P.

Parkerson, 2004. A novel approach for online
testable reversible logic circuit design,
Proceedings of the 13th Asian Test
Symposium (ATS 2004), pp: 325-330.

292
IJIT@2013
www.picopublications.org