Table Values in Constraints

Tables are used for constraints whose values are dependent on one, two, or three variables.

1-D tables are represented by a list of ordered pairs. Each pair includes a header value and a constraint value. The header entries, also referred to as row values, typically represent width. To find a constraint value in a 1-D table, Space-based Router and Chip Optimizer performs a table lookup with your row key value or row index. If the row key value does not match a header entry, Space-based Router and Chip Optimizer extrapolates the value if the key lies outside the range of header values or interpolates the value if the key lies between a pair of header values in the table.

For example, a 1-D table list of {4 2.2 8 3.3 16 4.4} represents three pairs of values:

2-D tables are represented by a list of ordered sets and have a related list of header column values that typically represent parallel run lengths. Each ordered set includes a header (row) value followed by one constraint value for each column value. To find a constraint value in a 2-D table, Space-based Router and Chip Optimizer performs a table lookup with your row and column key values or indexes. If key values do not match header entries, Space-based Router and Chip Optimizer extrapolates the value if the key lies outside the range of header values or interpolates if the key lies between a pair of header values in the table.

For example, a 2-D table list of {0 0.18 0.18 0.3 0.18 .22 10.05 0.6 0.6} with a column list of {0 2} represents the following:

Related Topics

Range Values

Constraint Value Types

Interpolation and Extrapolation Techniques