资 源 简 介
Automagically find optimal transistor sizes for an arbitrary digital circuit specified as a spice netlist. Converts the spice netlist into a graph of channel connected components which is then mechanically converted to a geometric program. Can be used to find Pareto optimal energy/delay tradeoffs for design space exploration.
