CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
Reseach Article

High Speed Area Efficient 32 Bit Wallace Tree Multiplier

by Keshaveni N.
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 124 - Number 13
Year of Publication: 2015
Authors: Keshaveni N.
10.5120/ijca2015905742

Keshaveni N. . High Speed Area Efficient 32 Bit Wallace Tree Multiplier. International Journal of Computer Applications. 124, 13 ( August 2015), 25-28. DOI=10.5120/ijca2015905742

@article{ 10.5120/ijca2015905742,
author = { Keshaveni N. },
title = { High Speed Area Efficient 32 Bit Wallace Tree Multiplier },
journal = { International Journal of Computer Applications },
issue_date = { August 2015 },
volume = { 124 },
number = { 13 },
month = { August },
year = { 2015 },
issn = { 0975-8887 },
pages = { 25-28 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume124/number13/22165-2015905742/ },
doi = { 10.5120/ijca2015905742 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:14:19.533959+05:30
%A Keshaveni N.
%T High Speed Area Efficient 32 Bit Wallace Tree Multiplier
%J International Journal of Computer Applications
%@ 0975-8887
%V 124
%N 13
%P 25-28
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

A 32 bit high speed area efficient Wallace tree multiplier is designed using verilog HDL and implemented in FPGA. The circuit is designed using carry save adder architecture and finally with one look ahead carry adder. The design is an improved version of tree based Wallace tree multiplier architecture. This paper aims at high speed multiplication and an area efficient 32 bit Wallace tree multiplier. The entire design is coded in Verilog HDL, simulated with Modelsim and synthesized using Xilinx FPGA device. The result shows that the proposed architecture takes very less time for computing the multiplication of two 32 bit numbers. In terms of area also, the proposed multiplier is much efficient than the existing methods. The frequency of operation of the circuit is 200 MHz.

References
  1. King Fai Pang, IEEE 1990, Architecture for pipelined Wallace tree multiplier- accumulators.
  2. Akther S, European conference oncircuit theory and design, August 2007, VHDL implementation of fast NxN multiplier based on vedic mathematics.
  3. C Vinoth, V S Kanchana Bhaskaran, IEEE 2011, A novel low power and high speed wallace tree multiplier for RISC Processor.
  4. N Surekha, R Porselvi, K K Kumuthapriya, 2012, An efficient high speed wallace tree multiplier.
  5. Monika Vaishnav, October 2012, Volume 1, No.1, IJISCS, Design of multi-precision reconfigurable Wallace Tree Multiplier for high performance applications.
  6. Jagadeshwar Rao M, Sanjay Dubey, Asia Pacific conference 2012, A high speed and area efficient booth encoded Wallace tree multiplier for fast arithmetic circuits.
  7. Rahul D Kshirasagar, Aishwarya.E.V, Ahire Shashank Vishwanath, P Jayakrishnan, IEEE 2013, Implementation of pipelined booth encoded Wallace tree multiplier architecture.
  8. Damarla Paradhasaradhi, N Prashanti, N Vivek, IEEE 2013, Modified Wallace tree multiplier using efficient square root carry select adder.
  9. M Ravindra Kumar, August 2013, International journal of innovative research and studies, ISSN 2319-9725, Design and implementation of 32*32 bit high level Wallace tree multiplier.
  10. Kartikeya Bhardwaj, Praveen S, IEEE 2014, Power and area efficient approximate wallace tree multiplier for error resilient systems.
Index Terms

Computer Science
Information Sciences

Keywords

Carry save adder FPGA Modelsim simulator Wallace tree multiplier