SAT-based algorithms for internal cell routing in nanoelectronic circuits
This thesis presents the extension of a routing framework for the internal routing of standard cells. We extend the original Boolean formulation and modify a SAT-solver to take advantage of the new variables. Our aim is to make big and complex cells become more tractable.
| Autor: | |
|---|---|
| Tipo de documento: | dissertação |
| Data de publicação: | 2015 |
| País: | España |
| Recursos: | Universitat Politècnica de Catalunya (UPC) |
| Repositório: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglês |
| OAI Identifier: | oai:upcommons.upc.edu:2117/78267 |
| Acesso em linha: | https://hdl.handle.net/2117/78267 |
| Access Level: | Acceso aberto |
| Palavra-chave: | Electronic circuits Microelectronics Algorismia SAT VLSI Algorithmics Circuits electrònics Microelectrònica Àrees temàtiques de la UPC::Informàtica |
| Resumo: | This thesis presents the extension of a routing framework for the internal routing of standard cells. We extend the original Boolean formulation and modify a SAT-solver to take advantage of the new variables. Our aim is to make big and complex cells become more tractable. |
|---|