Professional Documents
Culture Documents
Signed Multiplier Aaditya Kumar 201010201
Signed Multiplier Aaditya Kumar 201010201
Signed Multiplier Aaditya Kumar 201010201
Abhishek Kerketta
201010203
Department of Electronics and
Communication Engineering
International Institute of Information
Technology, Naya Raipur, India
abhishek20101@iiitnr.edu.in
Abstract—This report presents the design and encoding that takes advantage of the complement
implementation of a signed multiplier circuit. The signed representation of negative numbers.
multiplier is an essential component of many digital signal In this report, we present the design and implementation of a
processing applications, including filtering, convolution, and signed multiplier circuit using Verilog hardware description
modulation. The proposed multiplier design is based on
Booth's algorithm, which is a well-known technique for signed
language. The proposed design is optimized for speed, area,
multiplication. The circuit was implemented using Verilog and power consumption, making it suitable for a wide range
hardware description language and synthesized on a Xilinx of signal processing applications. We also provide
FPGA. The design was optimized for speed and area, and the functional simulations to verify the correctness of the
results were verified using functional simulations. The designed multiplier.
implemented signed multiplier achieved a maximum operating
frequency of 100 MHz and a latency of 15 clock cycles. The
design also showed a low area overhead and power
consumption, making it suitable for low-power applications.
Overall, the designed signed multiplier provides an efficient
and reliable solution for performing signed multiplication in
digital signal processing systems.
B. Functional Verification
The RTL design is verified using simulation and testing
tools. The goal of functional verification is to ensure that the
design meets the specification and that it operates correctly
in all possible scenarios. Fig. Signed Multiplier
The verification process includes
1. Test case generation
2. Testbench creation
3. Coverage analysis.
Fig. NClaunch setting design director
Fig.Area Analysis
D. Physical Design
The source pin is the clock pin and all the red pins are the
destination pins.We can observe that the total real time is
reduced from 2 seconds to 0 seconds. We also check the
timing report of the hold mode and find that the real hold
time is 7ns.
F. Conclusion
To summarize, the design process of a VLSI circuit for a
Signed Multiplier involves a sequence of vital stages,
including RTL design, functional verification, synthesis,
physical design, and GDS file generation. All the stages are
Fig. Spaces between standard cells are unfilled equally significant for achieving a successful
implementation of the circuit. The functional verification
stage plays a critical role in verifying if the design meets all
the functional requirements. Clock tree synthesis and
routing are also important for ensuring the circuit meets the
timing and power constraints. The GDS file is the ultimate
outcome of the design process and is essential for the
successful fabrication and functionality of the integrated
circuit..
G. References
[1] G. Wang and A. T. Multiplier, “A Unified Unsigned /
Signed Binary Multiplier,” pp. 513–516, 2004.
[2] S. Venkatachalam, S. Ko, and S. Member, “Design of
Fig. Filling Spaces between Standard Cells with dummy Power and Area Efficient Approximate Multipliers,” pp.
cells 1–5, 2017.
[3] G. C. Ram, “Area Efficient Modified Vedic Multiplier,”
2016.
[4] D. Das and H. Rahaman, “A novel signed array
multiplier,” ACE 2010 - 2010 Int. Conf. Adv. Comput. Eng.,
pp. 19–23, 2010.
[5] N. S. Kumar, S. D. Shravan, N. G. Sudhanva, S. V.
Hande, Y. G. Praveen Kumar, and B. S. Kariyappa, “Design
of an Area-Efficient Multiplier,” Proc. - 2017 Int. Conf.
Recent Adv. Electron. Commun. Technol. ICRAECT 2017,
pp. 329–332, 2017.
[6] Q. Wang, Y. R. Shayan, and S. Member, “Signed array
multiplier,” pp. 199–202, 2003.
[7] S. Srikanth, I. T. Banu, G. V. Priya, and G. Usha, “Low
power array multiplier using modified full adder,” Proc. 2nd
IEEE Int. Conf. Eng. Technol. ICETECH 2016, no. March,
pp. 1041–1044, 2016.
Fig. Status Complete Global Routing
[8] K. S. Gurumurthy and M. S. Prahalad, “Fast and power
efficient 16x16 array of array multiplier using vedic
multiplication,” Int. Microsystems Packag. Assem. Circuits
Technol. Conf. IMPACT 2010 Int. 3D IC Conf. Proc., vol.
110, pp. 1–4, 2010.
[9] S. D. Jagadeshwar Rao M, “Wallace Tree Multiplier for
fast Arithmetic Circuits,” Asia Pacific Conf. Postgrad. Res.,
no. December, pp. 220–223, 2012.
[10] J. Sousa, J. Galvao, J. Machado, J. Mendonca, T.
Machado, and P. Silva, “Modelling and Simulation of a
Straight Line Motion Mechanism for Industrial
Application,” 2018 5th Int. Conf. Control. Decis. Inf.
Technol. CoDIT 2018, pp. 1104–1109, 2018.
[11] L. Yin and J. Han, “Synthesis of Four-bar Straightline
Linkage Based On Solution Regions and Its Software
Development,” pp. 1–5, 2009.
[12] K. R. Gavali and P. Kadam, “VLSI Design of High
Speed Vedic Multiplier for FPGA Implementation,” vol. 1,
no. March, pp. 18–21, 2016.