TINA: analog placement using enumerative techniques capable of optimizing both area and net length

In this paper a new enumerative algorithm called TINA is introduced that generates slicing placements optimal in both area and overall net length. It is designed to automate the task of placement for analog circuits given a set of modules with multiple realizations, a corresponding net list, and neighborhood relations. TINA reduces the overall net length to nearly one fifth compared to a net length unaware enumeration algorithm while using only 1.6% more area and twice the CPU-time. TINA is based on enhanced shape functions that are capable of carrying net length information. TINA can be used either as a fully automatic analog placement tool, or as an interactive tool for creating extremely dense placements from a loose placement provided by the designer to establish neighborhood relations. In the first case, another tool, e.g. PLACEBO, is used to compute neighborhood relations. TINA is able to handle all major analog constraints like clustering, framing, fixed orientations, fixed realizations, and symmetries.