International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 116 - Number 17 |
Year of Publication: 2015 |
Authors: Abhay Sharma |
10.5120/20430-2760 |
Abhay Sharma . FPGA Implementation of a High Speed Multiplier Employing Carry Lookahead Adders in Reduction Phase. International Journal of Computer Applications. 116, 17 ( April 2015), 27-31. DOI=10.5120/20430-2760
Tree Multipliers are frequently used to reduce the delay of array multipliers. The objective of tree multipliers is to utilize the concept of carry save adders in reducing the partial product. Two well known tree multipliers Wallace and Dadda uses full adders and half adders for the aforesaid purpose. This paper implements a multiplier which will perform reduction of partial products using 4 bit Carry Lookahead Adders primarily instead of Full adders. This will result in fewer reduction stages as Full adders reduces 3 partial products bits to 2 giving a 1. 5 to 1 ratio whereas 4 bit CLA will reduce 9 partial products bits to 5 giving 1. 8 to 1 ratio. Xilinx Spartan 3E FPGA board is used for implementation of structural verilog code for the multiplier design.