A new method to implement a constant operand multiplier

In this paper we present a new method to implement constant operand multiplier. The structure is optimized in point of view of surface occupation and time execution. The principle of the new method based on a compression of four partial products into one row. The method proofs its availability for b...

Full description

Saved in:
Bibliographic Details
Main Authors: Kharrat, M.W., Ben Ayed, M.A., Loulou, M., Masmoudi, N., Kamoun, L.
Format: Conference Proceeding
Language:English
Subjects:
Availability
Design methodology
Design optimization
Field programmable gate arrays
Logic gates
Pulse inverters
Tree data structures
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper we present a new method to implement constant operand multiplier. The structure is optimized in point of view of surface occupation and time execution. The principle of the new method based on a compression of four partial products into one row. The method proofs its availability for both signed and unsigned multiplication. Simulation results using FPGA implementation technology show an improvement of proposed algorithm performances compared to DADDA multiplier.
DOI:10.1109/ICM-02.2002.1161497