A New Approach to the VLSI Datapath Synthesis

We present a new formulation of the hardware allocation (or binding) problem in the VLSI datapath synthesis. We also present two algorithms to solve the problem: one algorithm is to allocate registers, and the other is to allocate function units and connections. Compared with other approaches and algorithms, our approach and algorithms produce better datapaths for examples appeared in literature. In addition, our approach has the virtue of being adaptive to different technologies, which cannot be found in other approaches.