Netlist

related topics
{math, number, function}
{system, computer, user}
{@card@, make, design}
{ship, engine, design}

The word netlist can be used in several different contexts, but perhaps the most popular is in the field of electronic design. In this context, a "netlist" describes the connectivity of an electronic design.

Netlists usually convey connectivity information and provide nothing more than instances, nets, and perhaps some attributes. If they express much more than this, they are usually considered to be a hardware description language such as Verilog, VHDL, or any one of several specific languages designed for input to simulators.

Netlists can be either physical or logical; either instance-based or net-based; and flat or hierarchical. The latter can be either folded or unfolded.

Contents

Contents and structure of a netlist

Most netlists either contain or refer to descriptions of the parts or devices used. Each time a part is used in a netlist, this is called an "instance." Thus, each instance has a "master", or "definition". These definitions will usually list the connections that can be made to that kind of device, and some basic properties of that device. These connection points are called "ports" or "pins", among several other names.

An "instance" could be anything from a MOSFET transistor or a bipolar transistor, to a resistor, capacitor, or integrated circuit chip.

Instances have "ports". In the case of a vacuum cleaner, these ports would be the three metal prongs in the plug. Each port has a name, and in continuing the vacuum cleaner example, they might be "Neutral", "Live" and "Ground". Usually, each instance will have a unique name, so that if you have two instances of vacuum cleaners, one might be "vac1" and the other "vac2". Besides their names, they might otherwise be identical.

Nets are the "wires" that connect things together in the circuit. There may or may not be any special attributes associated with the nets in a design, depending on the particular language the netlist is written in, and that language's features.

Instance based netlists usually provide a list of the instances used in a design. Along with each instance, either an ordered list of net names are provided, or a list of pairs provided, of an instance port name, along with the net name to which that port is connected. In this kind of description, the list of nets can be gathered from the connection lists, and there is no place to associate particular attributes with the nets themselves. SPICE is perhaps the most famous of instance-based netlists.

Net-based netlists usually describe all the instances and their attributes, then describe each net, and say which port they are connected on each instance. This allows for attributes to be associated with nets. EDIF is probably the most famous of the net-based netlists.

Hierarchy

In large designs, it is a common practice to split the design into pieces, each piece becoming a "definition" which can be used as instances in the design. In the case of the vacuum cleaner analogy, one might have a vacuum cleaner definition with its ports, but now this definition would also include a full electrical description of the internals of the vacuum cleaner, including the motors, switches, et cetera, inside it. A definition which includes no instances would be referred to as "primitive", or "leaf", among other names, whereas a definition which includes instances would be "hierarchical".

A "folded" hierarchy allows a single definition to be represented several times by instances. An "unfolded" hierarchy will not allow a definition to be used more than once in the hierarchy. Folded Hierarchies can be extremely compact. A small netlist (for example, just a few hundred instances) could describe connections with tens or hundreds of thousands of instances this way. How? Let us suppose definition "A" is a simple primitive memory cell. Then, suppose that definition "B" contains 32 instances of "A"; "C" contains 32 instances of "B"; "D" contains 32 instances of "C"; and "E" contains 32 instances of "D". At this point, the design contains a total of 5 definitions (A through E) and 128 total instances. Yet, E describes a circuit that contains 1,048,576 instances of "A."

Full article ▸

related documents
ANSI escape code
Universal Turing machine
Simula
P-code machine
HyperTalk
PL/I
Ada (programming language)
Queueing theory
Basic Encoding Rules
Enterprise Objects Framework
Maple (software)
Defensive programming
Lotus Improv
Wikipedia:Free On-line Dictionary of Computing/O - Q
Compiler optimization
One instruction set computer
Dhrystone
Unified Modeling Language
Universal Product Code
Turing completeness
Wikipedia:Free On-line Dictionary of Computing/E - H
CPAN
Event-driven programming
Key (cryptography)
QuakeC
Passphrase
Modula-2
COMMAND.COM
Code refactoring
Reverse Polish notation