Details
| Originalsprache | Englisch |
|---|---|
| Titel des Sammelwerks | 2006 IEEE International Conference on Integrated Circuit Design and Technology, ICICDT'06 |
| Herausgeber (Verlag) | IEEE Computer Society |
| ISBN (Print) | 1424400988, 9781424400980 |
| Publikationsstatus | Veröffentlicht - 2006 |
| Veranstaltung | Integrated Circuit Design and Technology, 2006. ICICDT '06. 2006 IEEE International Conference - Padova, Italien Dauer: 24 Mai 2006 → 26 Mai 2006 |
Abstract
The number of circuit malfunctions due to opens increases with shrinking technologies. This requires to reconsider traditional tree based routing approaches for signal wiring. In this paper, we apply global loops to generate robust net topologies which are fully immune against single open faults. We show that the solution of the travelling salesperson problem yields a nearly optimal solution to the two edge connected subgraph problem. Additionally, we introduce a heuristic for finding additional segments which significantly reduce the delay. As result the critical area reduction is better than in previous published approaches which augment minimum Steiner trees.
ASJC Scopus Sachgebiete
- Ingenieurwesen (insg.)
- Elektrotechnik und Elektronik
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
2006 IEEE International Conference on Integrated Circuit Design and Technology, ICICDT'06. IEEE Computer Society, 2006. 1669409.
Publikation: Beitrag in Buch/Bericht/Sammelwerk/Konferenzband › Aufsatz in Konferenzband › Forschung › Peer-Review
}
TY - GEN
T1 - Application of global loops on ULSI routing for DfY
AU - Panitz, P.
AU - Olbrich, M.
AU - Koehl, J.
AU - Barke, E.
PY - 2006
Y1 - 2006
N2 - The number of circuit malfunctions due to opens increases with shrinking technologies. This requires to reconsider traditional tree based routing approaches for signal wiring. In this paper, we apply global loops to generate robust net topologies which are fully immune against single open faults. We show that the solution of the travelling salesperson problem yields a nearly optimal solution to the two edge connected subgraph problem. Additionally, we introduce a heuristic for finding additional segments which significantly reduce the delay. As result the critical area reduction is better than in previous published approaches which augment minimum Steiner trees.
AB - The number of circuit malfunctions due to opens increases with shrinking technologies. This requires to reconsider traditional tree based routing approaches for signal wiring. In this paper, we apply global loops to generate robust net topologies which are fully immune against single open faults. We show that the solution of the travelling salesperson problem yields a nearly optimal solution to the two edge connected subgraph problem. Additionally, we introduce a heuristic for finding additional segments which significantly reduce the delay. As result the critical area reduction is better than in previous published approaches which augment minimum Steiner trees.
UR - http://www.scopus.com/inward/record.url?scp=37649026512&partnerID=8YFLogxK
U2 - 10.1109/icicdt.2006.220822
DO - 10.1109/icicdt.2006.220822
M3 - Conference contribution
AN - SCOPUS:37649026512
SN - 1424400988
SN - 9781424400980
BT - 2006 IEEE International Conference on Integrated Circuit Design and Technology, ICICDT'06
PB - IEEE Computer Society
T2 - Integrated Circuit Design and Technology, 2006. ICICDT '06. 2006 IEEE International Conference
Y2 - 24 May 2006 through 26 May 2006
ER -