z-logo
open-access-imgOpen Access
FPGA Implementation of a High Speed Multiplier Employing Carry Lookahead Adders in Reduction Phase
Author(s) -
Abhay Sharma
Publication year - 2015
Publication title -
international journal of computer applications
Language(s) - English
Resource type - Journals
ISSN - 0975-8887
DOI - 10.5120/20430-2760
Subject(s) - computer science , field programmable gate array , adder , carry (investment) , reduction (mathematics) , multiplier (economics) , speedup , arithmetic , phase (matter) , computer hardware , parallel computing , embedded system , telecommunications , mathematics , latency (audio) , geometry , finance , economics , macroeconomics , chemistry , organic chemistry
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. KeywordsMultiplier, Wallace, Dadda, Carry Lookahead Adders.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom