S. C. Prasad

Learn More
DISCLAIMER: This publication is based on sources and information believed to be reliable, but the AAPM and the editors disclaim any warranty or liability based on or relating to the contents of this publication. The AAPM does not endorse any products, manufacturers, or suppliers. Nothing in this publication should be interpreted as implying such endorsement.
In this article we address the problem of optimization of VLSI circuits to minimize power consumption while meeting performance goals. We present a method of estimating power consumption of a basic or complex CMOS gate which takes the internal capacitances of the gate into account. This method is used to select an ordering of series-connected transistors(More)
We address the problem of long cycle time associated with the basic method of optimizing VLSI circuits. We are developing a system which makes it possible to carry out arbitrary changes to Register Transfer Level (RTL) source description of the circuit after a gate-level implementation has been synthesized. The system incrementally updates the gate-level(More)
In this paper, a novel unconstrained convex minimization problem formulation for the Lagrangian dual of the recently introduced twin support vector machine (TWSVM) in simpler form is proposed for constructing binary classifiers. Since the objective functions of the modified minimization problems contain non-smooth ‘plus’ function, we solve them by Newton(More)
  • 1