Maze routing algorithms with exact matching constraints for analog and mixed signal designs

Design automation for analog and mixed signal designs has become more important, as analog and digital components are integrated on the same system-on-chips (SOCs). Exact route matching is an important constraint for analog and mixed signal designs with non-uniform metal stacks. In this paper, we pr...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2012 IEEE/ACM International Conference on Computer-Aided Design (ICCAD) s. 130 - 136
Hlavní autoři: Ozdal, Muhammet Mustafa, Hentschke, Renato Fernandes
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: New York, NY, USA ACM 05.11.2012
IEEE
Edice:ACM Conferences
Témata:
Algorithm design and analysis
Applied computing > Arts and humanities > Architecture (buildings) > Computer-aided design
Applied computing > Physical sciences and engineering > Engineering > Computer-aided design
Complexity theory
DH-HEMTs
Networks > Network components > Intermediate nodes > Routers
Networks > Network protocols > Network layer protocols > Routing protocols
Receivers
Routing
Runtime
System-on-a-chip
ISBN:9781450315739, 1450315739
ISSN:1092-3152
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Design automation for analog and mixed signal designs has become more important, as analog and digital components are integrated on the same system-on-chips (SOCs). Exact route matching is an important constraint for analog and mixed signal designs with non-uniform metal stacks. In this paper, we propose a constrained-path based maze routing algorithm that can handle exact matching constraints for multiple nets. We also propose a scalable framework that utilizes the proposed maze routing algorithm for realistic problem sizes. Compared to the pattern routing algorithms proposed recently [8], our algorithms allow a more thorough exploration of the solution space by allowing bends to be inserted to avoid congested regions. The experimental study demonstrates that the proposed algorithm leads to significant reductions in congestion costs compared to the previous algorithm.
ISBN:9781450315739
1450315739
ISSN:1092-3152
DOI:10.1145/2429384.2429409