International Journal of Engineering and Techniques - Volume 3 Issue 6, Nov - Dec 2017

RESEARCH ARTICLE OPEN ACCESS

VLSI Design of Non-Redundant Radix-4 Signed-Digit

Encoding for Pre-Encoded Multipliers
1
Kalpana Kparaboina, 2Pabbaraju Padmaja ,3N.Chandrashekhar
1
M-Tech, Dept. of ECE Khammam Institute of Technology and Science,Khammam,TS.
2
M-Tech, Dept. of ECE Khammam Institute of Technology and Science,Khammam,TS.
3
Associate Professor& HOD Dept. of ECE Khammam Institute of Technology and Science,Khammam,TS.

Abstract:
In this paper, we show an outline of pre-encoded multipliers for cutting edge hail dealing with
applications in perspective of separated encoding of coefficients. To this extend, the Non-Redundant radix-4
Signed-Digit (NR4SD) encoding system, which uses the digit regards f1; 0; þ1; þ2g or f2; 1; 0; þ1g, is
proposed provoking a multiplier plot with less personality boggling fragmentary things execution. Wide
exploratory examination affirms that the proposed pre-encoded NR4SD multipliers, including the
coefficients memory, are more zone and power profitable than the consistent Modified Booth plot

Keywords — Modified booth Algorithm, Pre-Encoded Multiplier,Conventional MBMultiplier,Pre

Encoded MB Multiplier,VLSI Design.

1. INTRODUCTION multipliers are hard-wired to specific

coefficients. In [3], a CSD-based
Blended media and propelled signal getting
programmable multiplier setup was
ready (DSP) applications (e.g., snappy
proposed for social occasions of pre-chosen
Fourier change (FFT), sound/video CoDecs)
coefficients that offer certain features. The
finish a far reaching number of duplications
measure of ROM used to store the social
with coefficients that don't change in the
affairs of coefficients is basically decreased
midst of the execution of the application.
and likewise the locale and power use of the
Since the multiplier is a basic section for
circuit. In any case, this multiplier
executing computationally heightened
arrangement needs versatility since the
applications, its designing truly impacts their
inadequate things age unit is delineated
execution. Consistent coefficients can be
especially for a social affair of coefficients
encoded to contain the base nonzero digits
and can't be reused for another get-together.
using the canonic stamped digit (CSD)
Moreover, this system can't be easily
depiction [1]. CSD multipliers include the
extended to huge social affairs of fated
minimum non-zero partial things, which
coefficients achieving meanwhile high
along these lines decreases their trading
profitability. Balanced Booth (MB)
activity. In any case, the CSD encoding
encoding [4], [5], [6], [7] handles the
incorporates veritable hindrances.
beforehand said imperatives and abatements
Crumbling methodology [2], which
to a huge bit of the amount of fragmentary
diminishes silicon extend by time-
things coming to fruition to lessened locale,
multiplexing various operations into single
essential deferral and power use.
utilitarian units, e.g., adders, multipliers,
Nevertheless, a submitted encoding circuit is
isn't conceivable as the CSD-based

ISSN: 2395-1303 http://www.ijetjournal.org Page 445

 International Journal of Engineering and Techniques - Volume 3 Issue 6, Nov - Dec 2017
required and the midway things age is more
mind boggling. In [8], Kim et al. proposed a
strategy like [3], for arranging capable MB
multipliers for get-togethers of pre-chosen
coefficients with comparable controls
depicted in the past segment. 2.Non-
Redundant Radix-4 Signed-Digit
Algorithm
In this portion, we show the Non-Redundant
radix-4 Signed-Digit (NR4SD) encoding
methodology. As in MB outline, the amount
of fragmentary things is diminished to half.
When encoding the 2's supplement number
B, digits bNR j take one of four regards: f2;
1; 0; þ1g or bNRþ j 2 f1; 0; þ1; þ2g at the
NR4SD or NR4SDþ computation,
independently. Only four interesting regards
are used and not five as in MB estimation,
which prompts 0 j k 2. As we need to cover
the dynamic extent of the 2's supplement
outline, the most basic digit is MB encoded
(i.e., bMB k1 2 f2; 1; 0; þ1; þ2g). The
NR4SD and NR4SDþ encoding
computations are outlined in detail in Figs. 1
and 2, independently. NR4SD Algorithm
Stage 1. Consider the fundamental regards j
¼ 0 and c0 ¼ 0.
Stage 2. Register the pass on c2jþ1 and the
total nþ 2j of a half snake (HA) with inputs
b2j and c2j (Fig. 1a).
Stage 3. Determine the unequivocally
stamped pass on c2jþ2 (+) and the
antagonistically checked aggregate n 2jþ1 (-
ISSN: 2395-1303 http://www.ijetjournal.org
) of a HA* with inputs b2jþ1 (+) and c2jþ1
(+) (Fig. 1a). The yields c2jþ2 and n 2jþ1 of
the HA* relate to its data sources
3.Pre-Encoded Mb Multiplier Design
In the pre-encoded MB multiplier plot, the
coefficient B is encoded separated by the
normal MB shape (Table 1). The ensuing
encoding indications of B are secured in a
ROM. The drifted some segment of Fig. 3,
which contains the ROM with coefficients in
2's supplement outline and the MB encoding
circuit, is right now totally supplanted by the
ROM of Fig. 5. The MB encoding squares
of Fig. 3 are prohibited. The new ROM of
Fig. 5 is used to store the encoding
indications of B and sustain them into the
partial thing generators (PPj Generators
PPG) on each clock cycle. Centering to
lessen trading activity, the regard '1' of sj in
the last area of Table 1 is supplanted by '0'.
The sign sj is by and by given by the
association: hence, the PPG of Fig. 4a is
supplanted by the one of Fig. 4b. Appeared
differently in relation to (4), (12) prompts a
more personality boggling layout. In any
case, due to the pre-encoding procedure,
there is no zone/concede overhead at the
circuit. The fragmented things, truly
weighted, and the COR of (11) are fed into a
CSA tree. The data pass on cin;j of (11) is
figured as cin;j ¼ sj in perspective of (12)
and Table 1. The CS yield of the tree is
Page 446
 International Journal of Engineering and Techniques - Volume 3 Issue 6, Nov - Dec 2017

finally united by a fast CLA wind. In any

case, the ROM width is extended. Each di digit
requests three encoding bits (i.e., s, two and
one (Table 1)) to be secured in the ROM.
Since the n-bit
bit coefficient B needs three bits
for every digit when encoded fit as a fiddle,
the ROM width essential is 3n/2 bits for
every coefficient. Thus, the width
idth and the
general size of the ROM are extended by 50
percent diverged from the ROM of the
common arrangement (Fig. 3).

Block Diagram

4.SIMULATION RESULTS

RTL Schematic

5.CONCLUSION
In this paper, new blueprints of pre-
pre
SCHEMATIC encoded multipliers are researched by
detached encoding the standard coefficients
and securing them in system memory. We
propose encoding these coefficients in the
Non-Redundant radix-4
4 Signed-Digit
Signed
(NR4SD) outline. The proposed pre encoded
NR4SD multiplier designs are more area and
power capable stood out from the normal
and pre-encoded
encoded MB plots. Expansive trial
examination checks the increments of the

ISSN: 2395-1303 http://www.ijetjournal.org Page 447

 International Journal of Engineering and Techniques - Volume 3 Issue 6, Nov - Dec 2017

proposed pre-encoded NR4SD multipliers to Authors Profiles

the extent domain diserse quality and power
usage stood out from the customary MB
multiplier.

6.REFERENCE
[1] G. W. Reitwiesner, “Binary arithmetic,”
Adv. Comput., vol. 1, pp. 231–308, 1960.
[2] K. K. Parhi, VLSI Digital Signal
Processing Systems: Design and
Implementation, Hoboken, NJ, USA: Wiley, KALPANA KPARABOINApursuing M-
2007.
[3] Y.-E. Kim, K.-J.Cho, J.-G.Chung, and X. Tech (VLSI system design)Degree from
Huang, “CSD-based programmable Khammam Institute of Technology and
multiplier design for predetermined
coefficient groups,” IEICE Trans. Science(JNTU HYDERABAD), Ponnekal,
Fundam.Electron.Commun.Comput.Sci., Khammam, in (2015-2017) 2017, and B-
vol. 93, no. 1, pp. 324–326, 2010.
[4] O. Macsorley, “High-speed arithmetic in Tech Degree from SwarnaBharathi College
binary computers,” Proc. IRE, vol. 49, no. 1, Of Engineering (JNTU HYDERABAD),
pp. 67–91, Jan. 1961.
[5] W.-C. Yeh and C.-W. Jen, “High-speed Thanikella , Khammam,in( 2008-2012)
booth encoded parallel multiplier design,” 2012, all in Electronics and Communication
IEEE Trans. Comput., vol. 49, no. 7, pp.
692–701, Jul. 2000. Engineering.
[6] Z. Huang, “High-level optimization
techniques for low-power multiplier
design,” Ph.D. dissertation, Dept. Comput.
Sci., Univ. California, Los Angeles, CA,
USA, 2003.
[7] Z. Huang and M. Ercegovac, “High-
performance low-power left-to-right array
multiplier design,” IEEE Trans. Comput.,
vol. 54, no. 3, pp. 272–283, Mar. 2005.
[8] Y.-E. Kim, K.-J.Cho, and J.-G. Chung, PABBARAJU PADMAJApursuing M-
“Low power small area modified booth Tech (ES)Degree from MITS(JNTU
multiplier design for predetermined
coefficients,” IEICE Trans. Fundam. HYDERABAD), Kodada, Nalgonda, in
Electron.Commun.Comput. Sci., vol. E90- (2009-2011) 2011, and AMIE in ECE from
A, no. 3, pp. 694–697, Mar. 2007.
Institution of Engineers(India) in 2002.

ISSN: 2395-1303 http://www.ijetjournal.org Page 448

 International Journal of Engineering and Techniques - Volume 3 Issue 6, Nov - Dec 2017

N.CHANDRASHEKHARcompleted his M-Tech with electronics and communication

engineering. He has published more than five international journals. Currently he is a research
Scholar in JNTU, Hyderabad and working as Associate Professor & Head of the department for
ECE in Khammam Institute of Technology and Science

ISSN: 2395-1303 http://www.ijetjournal.org Page 449