Abstract
In this thesis, we present an approach to discrete wire sizing subject to current density constraints. The approach contains two steps. The first step is to derive a continuous wire shape function in which every location of the wire has the same current density and satisfies the given current density constraint. The second step is to convert the continuous shape function into a discrete one without violating the given current density constraint, for which three linear-time methods are presented. The first one is a simple heuristic method, and the second one is near optimal. Both methods have the property that the wire width at any location is no less than the wire width of the given continuous wire sizing solution at the same location. The last method can be proved to obtain a discrete wire sizing solution of minimum area for the case without considering wire resistance. We conduct extensive experiments, and the results show that three methods are all very efficient, and among them, the simple heuristic method is the fastest one while the optimal method is the slowest one. Besides, the near optimal method is always able to generate a solution of smaller wire area than the simple heuristic method while it is slightly worse than the optimal method.