Abstract

The new iterative construction approach presented in this paper consists of three algorithms, namely, channel expansion routing, track assignment, and module location refinement. These algorithms, contrary to the conventional methods implemented with a sequence of tools separately, are linked with a common data structure which guarantees a maximal compatibility. With an initial nonoverlapping placement as input, the iterative construction approach generates a final layout with more compacted area than the layout result from the one-dimensional compactor or some of two-dimensional compactors. Several layout examples in the literature are tested to show the effectiveness of our approach.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.