Abstract
Algorithms for standard cell placement and routing and their implementation is presented in this paper. The placing algorithm uses a constructive clustering method to tackle the problem, including expert knowledge in the process. The total length of the connection lines and the total chip area is minimized. The algorithm for all practical applications performs almost linearly. The routing algorithms uses graph theory concepts and places the nets so that they do not hinder subsequent routing. It solves all well known channel routing problems as well as the ‘New and More Difficult’ ones [17], which have not been presented before. Both algorithms are implemented in Prolog and achieve very fast execution time.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
