NDLI: On crossing minimization problem

Content Provider	IEEE Xplore Digital Library
Author	Chen, H.-F.S. Lee, D.T.
Copyright Year	1982
Abstract	In this paper, we consider a problem related to global routing postoptimization: the crossing minimization problem (CMP). Given a global routing representation, the CMP is to minimize redundant crossings between every pair of nets. In particular, there are two kinds of CMP: constrained CMP (CCMP) and unconstrained CMP (UCMP). These problems have been studied previously where an O(m/sup 2/n) algorithm was proposed for CCMP, and where an (mn/sup 2/+/spl xi//sup 2/) algorithm was proposed for UCMP where m is the total number of modules, n is the number of nets, and /spl xi/ is the number of crossings defined by an initial global routing topology. We present a simpler and faster O(mn) algorithm for CCMP and an O[n(m+/spl xi/)] time algorithm for UCMP. Both algorithms improve over the time bounds of the previously proposed algorithms. The novel part of our algorithm is that it uses the plane embedding information of globally routed nets in the routing area to construct a graph-based framework and obtain a good junction terminal assignment that minimizes the number of crossings.
Sponsorship	IEEE Council on Electronic Design Automation IEEE Circuits and Systems Society
Starting Page	406
Ending Page	418
Page Count	13
File Size	505203
File Format	PDF
ISSN	02780070
Volume Number	17
Issue Number	5
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1998-05-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Routing Circuits Minimization Topology Very large scale integration Wiring Manufacturing processes Data structures Multichip modules Wire
Content Type	Text
Resource Type	Article
Subject	Computer Graphics and Computer-Aided Design Electrical and Electronic Engineering Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Layer assignment for multichip modules

SEGRA: a very fast general area router for multichip modules

Hierarchical Wire Routing

Congestion minimization during placement

An H-V alternating router

Unconstrained via minimization for topological multilayer routing

Wiring space and length estimation in two-dimensional arrays

A new approach to wiring layouts

Multilayer pin assignment for macro cell circuits

On crossing minimization problem

Similar Documents

Layer assignment for multichip modules

SEGRA: a very fast general area router for multichip modules

Hierarchical Wire Routing

Congestion minimization during placement

An H-V alternating router

Unconstrained via minimization for topological multilayer routing

Wiring space and length estimation in two-dimensional arrays

A new approach to wiring layouts

Multilayer pin assignment for macro cell circuits

On crossing minimization problem