Hardware Reference
In-Depth Information
Fig. 6.3
Pseudocode for the construction of the pin-assignment configuration using a greedy
algorithm
to improve the efficiency of the greedy algorithm, we propose a mapping from a
pin-assignment configuration to an undirected graph, and then we use the graph to
ascertain whether the pin-assignment configuration is a feasible solution. A lower
bound on the number of pins from the graph model is also described.
For simplicity, two operators will be defined. First, the pin-assignment configu-
ration is defined as the operator
C
, which is a mapping from the set of all electrodes
on the chip (E
) to the set of pins that are assigned to the electrodes (P ).
W
E
!
P
C
(6.4)
