FPGA Implementation of An Efficient High Speed Wallace Tree Multiplier
Mani Kunnathettu, Tessly Thomas, Alphy Manuel, Anju Rachel Thomas and Riboy Cheriyan. Article: FPGA Implementation of An Efficient High Speed Wallace Tree Multiplier. IJCA Proceedings on International Conference on Emerging Trends in Technology and Applied Sciences ICETTAS 2015(1):9-14, September 2015. Full text available. BibTeX
@article{key:article,
author = {Mani Kunnathettu and Tessly Thomas and Alphy Manuel and Anju Rachel Thomas and Riboy Cheriyan},
title = {Article: FPGA Implementation of An Efficient High Speed Wallace Tree Multiplier},
journal = {IJCA Proceedings on International Conference on Emerging Trends in Technology and Applied Sciences},
year = {2015},
volume = {ICETTAS 2015},
number = {1},
pages = {9-14},
month = {September},
note = {Full text available}
}
Abstract
High speed multiplication is one of the critical function in a range of very large scale integration (VLSI) applications. Multipliers find their importance in performing operations such as convolution, filtering and correlation in digital signal processing systems, microprocessors and graphic engines. Multiplication is an expensive and slow operation. Designing multipliers that are of low power, regular in layout and with high-speed are of substantial research interest. The speed of the multiplier can be improved by reducing the generated partial products. Of the many attempts that have been made to reduce the number of partial products generated in a multiplication process, one of the notable one is the Wallace tree multiplier. Wallace Tree CSA structures have been used to sum the partial products in reduced time. The existing Wallace tree architecture has considerable speed but due to various limitations faced, there arises the need for further improvement. In this project, the proposed system is a modified Wallace tree multiplier. In this paper Wallace tree multiplication is investigated and evaluated. Speed of traditional Wallace tree multiplier can be improved by using compressor techniques. Here the Wallace tree is constructed by conventional method with the help of compressors such as 3:2 compressor. Therefore, minimizing the number of adders used in a multiplier reduction will reduce the delay, thereby improving the speed of multiplication.
References
- S. Karthick , S. Karthika , S. Valarmathy,Design and analysis of low powercompressors' , International Journal Of Advanced Research In Electrical, Electronics And Instrumentation Engineering, Vol. 1, Issue 6, December 2012.
- K. Gopi Krishna, B. Santhosh , V. Sridhar, Design of Wallace Tree Multiplier using Compressors ,International Journal Of Engineering Sciences & Research Technology
- Samir Palnitkar ,'VerilogHDL:A guide to Digital Design and Synthesis', 2ndedition , Prentice Hall , USA.
- Oscar Gustafsson , Andrew G. Dempster ,Lars Wanhammar . Multiplier Blocks Using carry Save Adders. Department of Electrical Engineering, Linkoping University, Sweden and University of Westminster, UK
- Moises E Robinson and Earl Swartzlander ,jr . . A Reduction Scheme To Optimize The Wallace Multiplier, Department of Electrical and Computer Engineering, University of Texas, USA.
- Michael D. Ciletti, Advanced Digital Design with Verilog HDL, Prentice Hall of India.
- Neil H. E. Weste, David Money Harris, CMOS VLSI Design: A Circuits and Systems Perspective, Pearson Education India
- V. Carl Hamacher, Zvonko G. Vranesic, Safwat G. Zaky,ComputerOrganisation , McGraw-Hill, 2002.
- V G KiranKumar ,H. RNagesh, Introduction to VLSI Design ,Pearson. Education
- xilingallprogrammable http://www. xilinx. com/training/fpga