O Problema do Roteamento de Interligações Elétricas em Circuitos Integrados

10/18/2022
by   Tiago Matos Santos, et al.
0

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.

READ FULL TEXT
research
01/03/2023

Quantum Feasibility Labeling for NP-complete Vertex Coloring Problem

Many important science and engineering problems can be converted into NP...
research
03/13/2023

A Review of Bayesian Methods in Electronic Design Automation

The utilization of Bayesian methods has been widely acknowledged as a vi...
research
06/20/2019

A Deep Reinforcement Learning Approach for Global Routing

Global routing has been a historically challenging problem in electronic...
research
06/24/2020

Circuit Routing Using Monte Carlo Tree Search and Deep Neural Networks

Circuit routing is a fundamental problem in designing electronic systems...
research
02/21/2020

A Multi-Vocal Review of Security Orchestration

Organizations use diverse types of security solutions to prevent cyberat...
research
10/05/2021

Modelling of the Fender Bassman 5F6-A Tone Stack

This paper outlines the procedure for the effective modelling of a compl...
research
07/15/2020

A Survey of Aging Monitors and Reconfiguration Techniques

CMOS technology scaling makes aging effects an important concern for the...

Please sign up or login with your details

Forgot password? Click here to reset