Stats

Replies 0
Subscribers 65
Views 12146
Members are here 0

SiP Layout 16.5 Algorithm for efficient routing

For N number of pins of a die and M number of pads on the package available, a pin can be connected to a pad in many different ways. Is there a tool or an algorithm that traverses and make the connections in the best possible ways with minimum conflicts and the need to jump back and forth between layers to make the connections? What if I am in the capacity to wiggle the positions of the pads in the BGA (for example) to move some of the pads around to make the routing efficient? Help appreciated!

Cadence Guidelines

Community Guidelines

The Cadence Design Communities support Cadence users and technologists interacting to exchange ideas, news, technical information, and best practices to solve problems and get the most from Cadence technology. The community is open to everyone, and to provide the most value, we require participants to follow our Community Guidelines that facilitate a quality exchange of ideas and information. By accessing, contributing, using or downloading any materials from the site, you agree to be bound by the full Community Guidelines.