A timing-driven data path layout synthesis with integer programming
Jae-Won Kim, Sung‐Mo Kang · 1995
We propose an ecient data path synthesis algorithm which generates bit-sliced layouts. Since data path circuits have spe-cial characteristics which are dierent from those of random logic circuits, the dedicated synthesis system is required for ef-cient layouts. Our main goal in the data path synthesis is to satisfy the timing constraints of circuits as well as to re-duce layout areas. Timing-driven placement and over-the-cell routing techniques are developed to generate data path modules. Also, signal interfaces between bit-slices are carefully considered to further reduce layout areas. Our synthesis techniques take advantage of the common characteristics of data path structures under timing constraints and applies mixed integer linear pro-gramming approach to solve the problem. The superior results from our data path synthesis system are demonstrated through comparison with the layout results with the simulated annealing technique.