PROJECT TITLE :
Fine-Grained Critical Path Analysis and Optimization for Area-Time Efficient Realization of Multiple Constant Multiplications
In this paper, crucial path of multiple constant multiplication (MCM) block is analyzed precisely and optimized for top-speed and low-complexity implementation. A delay model based on signal propagation path is proposed for additional precise estimation of important path delay of MCM blocks than the conventional adder depth and the quantity of cascaded full adders. A twin objective configuration optimization (DOCO) algorithm is developed to optimize the shift-add network configuration to derive high-speed and low-complexity implementation of the MCM block for a given elementary set along with a corresponding further basic set. A genetic algorithm (GA)-based mostly technique is more proposed to look for optimum further fundamentals. Within the evolution process of GA, the DOCO is applied to every searched additional elementary set to optimize the configuration of the corresponding shift-add network. Experimental results show that the proposed GA-primarily based technique reduces the vital path delay, space, power consumption, space delay product and power delay product by thirty two.eightp.c, 4.two%, five.8percent, 38.3percent, and forty one.0%, respectively, over different existing optimization ways.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here