Method and apparatus for improving PIP coverage in programmable logic devices
AssigneeXilinx, Inc.
InventorsRichard Yachyang Sun, Sandor S. Kalman, Sudip K. Nag
Life of this patent
Estimating the term…
Abstract
Routing algorithms can be modified to increase the number of programmable interconnect points (PIPs) used in a routing pattern. A file is set up to store information on whether a PIP has been covered. The cost of a node can be decreased by a predetermined value if two nodes are connected by an uncovered PIP. In another embodiment, a file is set up to store a count for each PIP. The count is increased each time the PIP is used in a routing. The cost of a node can be increased by multiplying a predetermined value and the count of a PIP associated with the node.
Claims9
A method for increasing the number of covered programmable interconnect points in a routing, comprising:
- setting up a file that stores information indicating whether a programmable interconnect point has been covered;
- accepting a value;
- and
- routing a plurality of nodes, including a step of expanding from a first node to a second node, comprising:
- determining whether the first and the second nodes are connected through an uncovered programmable interconnect point;
- applying a modified cost to the second node if the first node and a second node are connected through an uncovered programmable interconnect point, the modified cost is related to the value;
- and
- performing routing using the modified cost.
A method for increasing the number of covered programmable interconnect points in a routing, comprising:
- setting up a file that stores information indicating whether a programmable interconnect point has been covered;
- accepting a value;
- accepting a routed pattern;
- ripping up one signal from the routed pattern;
- and
- routing a plurality of nodes associated with the signal, including a step of expanding from a first node to a second node, comprising:
- determining whether the first and the second nodes are connected through an uncovered programmable interconnect point;
- applying a modified cost to the second node if the first node and a second node are connected through an uncovered programmable interconnect point, the modified cost is related to the value;
- and
- performing routing using the modified cost.
A method for increasing the number of covered programmable interconnect points in a routing, comprising:
- setting up a file that stores a count for each the programmable interconnect points;
- accepting a value;
- performing a routing run of the design, comprising:
- for each of the nodes reached in the routing run, calculating a new cost by adding to a base cost a term equal to a product of the value and the count for one of the programmable interconnect points associated with the node;
- and
- routing using the new cost;
- and
- updating the file at the end of the routing run.
Dependencies are inferred from the claim text.