• Skip to main content
  • Skip to search
  • Skip to footer
Cadence Home
  • This search text may be transcribed, used, stored, or accessed by our third-party service providers per our Cookie Policy and Privacy Policy.

  1. Community Forums
  2. RAVEL DRC Programming for IC Packaging and…
  3. Best way to determine pad pitch

Stats

  • Locked Locked
  • Replies 4
  • Subscribers 24
  • Views 21962
  • Members are here 0
This discussion has been locked.
You can no longer post new replies to this discussion. If you have a question you can start a new discussion

Best way to determine pad pitch

GMaggy
GMaggy over 9 years ago

What is the best way to find the pad pitch when the design has 27000+ pads?  Using the (combine relation1 relation2) operator crashes my session as Ravel attempts to store 729 million+ combinations.  Even if I break the design into quadrants to reduce the number of pads being looked at, Ravel still has to deal with 48 million+ combinations.  Also, looking only at the pads nearest the design edge doesn't give me the result I'm looking for.  I need to find the minimum pad pitch in the design.

Do you have any suggestions?

  • Cancel
Parents
  • GMaggy
    GMaggy over 9 years ago

    Hi Björn,

    I have attempted to implement your suggestion and got as close as I could to a working solution by subdividing the design into smaller "regions" to work with.  Simply combining 27K+ pads in order to do a selection of pad pairs below the cutoff distance crashes my session.  Subdividing the design into regions allowed me to combine a smaller subset of pads that met the cutoff distance.  However, because the design has 27K+ pads, I still run into a memory issue because even though the regions make pad pairs much more manageable, Ravel must still keep track of 70+ of these "region" tuples.

    How would you implement your suggestion?  How do I create an initial tuple of pad pairs to even look at whether or not they meet a certain cutoff distance?  I understand your theory and what you are suggesting.  I just don't know how to implement it.  I can't do (combine bumppad bumppad) or the session will run out of memory.  So how do I begin?

    Thanks for your help!!

    • Cancel
    • Vote Up 0 Vote Down
    • Cancel
Reply
  • GMaggy
    GMaggy over 9 years ago

    Hi Björn,

    I have attempted to implement your suggestion and got as close as I could to a working solution by subdividing the design into smaller "regions" to work with.  Simply combining 27K+ pads in order to do a selection of pad pairs below the cutoff distance crashes my session.  Subdividing the design into regions allowed me to combine a smaller subset of pads that met the cutoff distance.  However, because the design has 27K+ pads, I still run into a memory issue because even though the regions make pad pairs much more manageable, Ravel must still keep track of 70+ of these "region" tuples.

    How would you implement your suggestion?  How do I create an initial tuple of pad pairs to even look at whether or not they meet a certain cutoff distance?  I understand your theory and what you are suggesting.  I just don't know how to implement it.  I can't do (combine bumppad bumppad) or the session will run out of memory.  So how do I begin?

    Thanks for your help!!

    • Cancel
    • Vote Up 0 Vote Down
    • Cancel
Children
No Data

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.

© 2025 Cadence Design Systems, Inc. All Rights Reserved.

  • Terms of Use
  • Privacy
  • Cookie Policy
  • US Trademarks
  • Do Not Sell or Share My Personal Information