Single layer differential group routing for flip-chip designs
暂无分享,去创建一个
This work proposed an entry (merge point) finder for differential group pattern match RDL routing. The entry finder includes a quick routability checker, which can filter out the unroutable merge points to reduce the turnaround time. Besides, this work also proposed a controllable cost function to measure the routing quality of each routing result using different merge points. Thus, the best merge point and routing solution can be easily identified.
[1] Yao-Wen Chang,et al. An Integer Linear Programming Based Routing Algorithm for Flip-Chip Design , 2007, 2007 44th ACM/IEEE Design Automation Conference.
[2] Yao-Wen Chang,et al. An Efficient Pre-Assignment Routing Algorithm for Flip-Chip Designs , 2009, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.