Gate size optimization for row-based layouts

A transistor sizing algorithm for row-based layouts is presented under an improved area model. This algorithm uses convex programming to find a minimal area circuit for a given delay specification. The new area model uses a concept of row heights as opposed to the conventional metric of sum of gate sizes. Results over a number of circuits indicate a significant reduction both in the minimum delay achievable and area as compared to TILOS-like optimizer.