No abstract

No abstract

No abstract

This paper presents a jfloorplanner for datapath with the capability of re-allocating data storage for minimizing the interconnect area and critical path delay without altering the number of Functional units and the schedule. The tool has combined two novel approaches: 1 -A placement & Routing model to handle different architectural topologies (mux. and/ or bus based) suitable for FPGA's. 2 -An efJicient formulation for the biruling of register/lnterconnect & combined Floorplanning. The complexity of the architectural and jloorplanning model, and of the cost finction, have led us to the use of a stochastic optimization process. The running time of the whole process indicates the viability of the method. We show through various examples how the jloorplmner improves the area and critical path delay of the datapath compared to a plainjloorplannel: The improvement is about 20% for the critical path delay when this objective is a stringent constraint.