This HTML5 document contains 37 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

Prefix	IRI
dcterms	http://purl.org/dc/terms/
dbo	http://dbpedia.org/ontology/
foaf	http://xmlns.com/foaf/0.1/
n8	https://global.dbpedia.org/id/
dbt	http://dbpedia.org/resource/Template:
rdfs	http://www.w3.org/2000/01/rdf-schema#
freebase	http://rdf.freebase.com/ns/
rdf	http://www.w3.org/1999/02/22-rdf-syntax-ns#
owl	http://www.w3.org/2002/07/owl#
wikipedia-en	http://en.wikipedia.org/wiki/
prov	http://www.w3.org/ns/prov#
dbc	http://dbpedia.org/resource/Category:
dbp	http://dbpedia.org/property/
xsdh	http://www.w3.org/2001/XMLSchema#
wikidata	http://www.wikidata.org/entity/
gold	http://purl.org/linguistics/gold/
dbr	http://dbpedia.org/resource/

Statements

Subject Item

dbr:Delay_calculation

rdf:type

owl:Thing

rdfs:label

Delay calculation

rdfs:comment

Delay calculation is the term used in integrated circuit design for the calculation of the gate delay of a single logic gate and the wires attached to it. By contrast, static timing analysis computes the delays of entire paths, using delay calculation to determine the delay of each gate and wire. There are many methods used for delay calculation for the gate itself. The choice depends primarily on the speed and accuracy required: Often, it makes sense to combine the calculation of a gate and all the wires connected to its output. This combination is often called the stage delay.

rdfs:seeAlso

dbr:Statistical_static_timing_analysis

dcterms:subject

dbc:Timing_in_electronic_circuits

dbo:wikiPageID

3768420

dbo:wikiPageRevisionID

1116226430

dbo:wikiPageWikiLink

dbr:Routing_(EDA) dbr:Padé_approximant dbr:SPICE dbr:Statistical_static_timing_analysis dbr:Static_timing_analysis dbr:Krylov_subspace dbr:Placement_(EDA) dbr:Integrated_circuit_design dbr:Logic_gate dbr:Elmore_delay dbr:Logic_synthesis dbr:Laplace_transform dbr:Signal_integrity dbr:Propagation_delay dbr:Logical_effort dbc:Timing_in_electronic_circuits dbr:Standard_Parasitic_Exchange_Format dbr:Gate_delay dbr:Electronic_design_automation

owl:sameAs

n8:4j5Kf wikidata:Q5253471 freebase:m.09zz_v

dbp:wikiPageUsesTemplate

dbt:See_also dbt:Use_American_English dbt:Short_description

dbo:abstract

Delay calculation is the term used in integrated circuit design for the calculation of the gate delay of a single logic gate and the wires attached to it. By contrast, static timing analysis computes the delays of entire paths, using delay calculation to determine the delay of each gate and wire. There are many methods used for delay calculation for the gate itself. The choice depends primarily on the speed and accuracy required: * Circuit simulators such as SPICE may be used. This is the most accurate, but slowest, method. * Two dimensional tables are commonly used in applications such as logic synthesis, placement and routing. These tables take an output load and input slope and generate a circuit delay and output slope. * A very simple model called the K-factor model is sometimes used. This approximates the delay as a constant plus k times the load capacitance. * A more complex model called Delay Calculation Language, or DCL, calls a user-defined program whenever a delay value is required. This allows arbitrarily complex models to be represented, but raises significant software engineering issues. * Logical effort provides a simple delay calculation that accounts for gate sizing and is analytically tractable. Similarly, there are many ways to calculate the delay of a wire. The delay of a wire will normally be different for each destination. In order to increase accuracy (and decrease speed), the most common methods are: * Lumped C. The entire wire capacitance is applied to the gate output, and the delay through the wire itself is ignored. * Elmore delay is a simple approximation, often used where speed of calculation is important but the delay through the wire itself cannot be ignored. It uses the R and C values of the wire segments in a simple calculation. The delay of each wire segment is the R of that segment times the downstream C. Then all delays are summed from the root. (This assumes the network is tree-structured, true of most nets in chips. In this case, the Elmore delay can be calculated in time O(N) with two tree traversals. If the network is not tree-structured the Elmore delay can still be computed, but involves matrix calculations.) * Moment matching is a more sophisticated analytical method. It can be thought of as either matching multiple moments in the time domain or finding a good rational approximation (a Padé approximation) in the frequency domain. (These are very closely related - see Laplace transform.) It can also be considered a generalization of Elmore delay, which matches the first moment in the time domain (or computes a one-pole approximation in the frequency domain - they are equivalent). The first use of this technique, AWE, used explicit moment matching. Newer methods such as PRIMA and PVL use implicit moment matching, based on Krylov subspaces. These methods are slower than Elmore but more accurate. Compared to circuit simulation they are faster but less accurate. * Circuit simulators such as SPICE may be used. This is usually the most accurate, but slowest, method. * DCL, as defined above, can be used for interconnecting as well as gate delay. Often, it makes sense to combine the calculation of a gate and all the wires connected to its output. This combination is often called the stage delay. The delay of a wire or gate may also depend on the behaviour of the nearby components. This is one of the main effects that is analyzed during signal integrity checks.

gold:hypernym

dbr:Term

prov:wasDerivedFrom

wikipedia-en:Delay_calculation?oldid=1116226430&ns=0

dbo:wikiPageLength

6980

foaf:isPrimaryTopicOf

wikipedia-en:Delay_calculation