Scheduling using mixed arithmetic: an ILP formulation

Abstract

Summary form only given. We present a way to automatically select, within an architectural synthesis tool, the best operand and operator number systems, in order to find the best speed/area tradeoff. This implies the use of different number systems (redundant and non-redundant) for the same design: this is what we call mixed arithmetics. We present an integer linear programming (ILP) formulation to solve a scheduling problem.