O Problema do Roteamento de Interliga\c{c}\~oes El\'etricas em Circuitos Integrados

TL;DR

This paper discusses the complex NP-Complete problem of routing interconnections in integrated circuits, reviews existing solutions, and proposes a new methodology for developing potentially more effective heuristic algorithms.

Contribution

It introduces a new methodology for creating heuristic algorithms tailored to the interconnection routing problem in integrated circuit design.

Findings

Review of existing routing algorithms

Proposal of a new development methodology

Potential for improved routing solutions

Abstract

Integrated circuit design automation tools are essential for the feasibility of complex designs with millions of transistors. One of the steps performed within the process is the routing of interconnections between components of a circuit. This problem, which also aims to optimize the utilization of connection resources, has been shown to be NP-Complete and requires heuristic algorithms to look for the best achievable solutions. In this work, we present a definition of this problem in context with a brief review of existing solutions in the literature. Then, we propose a methodology for the development of an original algorithm, which aims to differentiate itself, in certain domains, from the solutions already proposed.