About: Routing (electronic design automation)     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:WikicatElectronicCircuits, within Data Space : dbpedia.org associated with source document(s)
QRcode icon
http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FRouting_%28electronic_design_automation%29

In electronic design, wire routing, commonly called simply routing, is a step in the design of printed circuit boards (PCBs) and integrated circuits (ICs). It builds on a preceding step, called placement, which determines the location of each active element of an IC or component on a PCB. After placement, the routing step adds wires needed to properly connect the placed components while obeying all design rules for the IC. Together, the placement and routing steps of IC design are known as place and route.

AttributesValues
rdf:type
rdfs:label
  • Sbrogliatura (it)
  • Routing (electronic design automation) (en)
  • Трассировка печатных плат (ru)
  • Трасування друкованих плат (uk)
  • 布线 (集成电路) (zh)
rdfs:comment
  • Il termine sbrogliatura si riferisce ad una delle varie fasi di lavoro necessarie per la realizzazione di un circuito stampato destinato alla produzione di una scheda elettronica. (it)
  • 在电子设计自动化中，布线（英語：routing），是印刷电路板设计和集成电路设计中的一个步骤。在设计流程里，布线通常在布局完成之后进行，布局已经将各种电路组件安置在芯片上，布线则进行这些组件之间的互连线配置。布线的原则是保证不同组件之间的连接畅通，同时符合一定的设计规则检查。 (zh)
  • Трассиро́вка печатных плат — один из этапов проектирования радиоэлектронной аппаратуры (РЭА), заключающийся в определении мест расположения проводников на печатной плате вручную или с использованием одной из САПР, предназначенной для проектирования печатных плат. (ru)
  • Трасування друкованих плат — один з етапів проектування радіоелектронної апаратури, що полягає в покроковому проектуванні структури провідників друкованої плати вручну або з використанням однієї з САПР друкованих плат. (uk)
  • In electronic design, wire routing, commonly called simply routing, is a step in the design of printed circuit boards (PCBs) and integrated circuits (ICs). It builds on a preceding step, called placement, which determines the location of each active element of an IC or component on a PCB. After placement, the routing step adds wires needed to properly connect the placed components while obeying all design rules for the IC. Together, the placement and routing steps of IC design are known as place and route. (en)
foaf:depiction
  • http://commons.wikimedia.org/wiki/Special:FilePath/PCB_design_and_realisation_smt_and_through_hole.png
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
Link from a Wikipage to an external page
sameAs
dbp:wikiPageUsesTemplate
thumbnail
cs1-dates
  • y (en)
date
  • January 2022 (en)
has abstract
  • In electronic design, wire routing, commonly called simply routing, is a step in the design of printed circuit boards (PCBs) and integrated circuits (ICs). It builds on a preceding step, called placement, which determines the location of each active element of an IC or component on a PCB. After placement, the routing step adds wires needed to properly connect the placed components while obeying all design rules for the IC. Together, the placement and routing steps of IC design are known as place and route. The task of all routers is the same. They are given some pre-existing polygons consisting of pins (also called terminals) on cells, and optionally some pre-existing wiring called preroutes. Each of these polygons are associated with a net, usually by name or number. The primary task of the router is to create geometries such that all terminals assigned to the same net are connected, no terminals assigned to different nets are connected, and all design rules are obeyed. A router can fail by not connecting terminals that should be connected (an open), by mistakenly connecting two terminals that should not be connected (a short), or by creating a design rule violation. In addition, to correctly connect the nets, routers may also be expected to make sure the design meets timing, has no crosstalk problems, meets any metal density requirements, does not suffer from antenna effects, and so on. This long list of often conflicting objectives is what makes routing extremely difficult. Almost every problem associated with routing is known to be intractable. The simplest routing problem, called the Steiner tree problem, of finding the shortest route for one net in one layer with no obstacles and no design rules is NP-hard if all angles are allowed and NP-complete if only horizontal and vertical wires are allowed. Variants of channel routing have also been shown to be NP-complete, as well as routing which reduces crosstalk, number of vias, and so on.Routers therefore seldom attempt to find an optimum result. Instead, almost all routing is based on heuristics which try to find a solution that is good enough. Design rules sometimes vary considerably from layer to layer. For example, the allowed width and spacing on the lower layers may be four or more times smaller than the allowed widths and spacings on the upper layers. This introduces many additional complications not faced by routers for other applications such as printed circuit board or multi-chip module design. Particular difficulties ensue if the rules are not simple multiples of each other, and when vias must traverse between layers with different rules. (en)
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 60 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software