Estimations can be very useful in the multitude of synthesis phase, such as algorithm and architecture selection, design space search, scheduling, module selection and transformation.
Lower bound delimit the search space, thus speeding up the design search process, and estimation of optimal design is very helpful in algorithm selection.
In this thesis, a tighter lower bound estimation method is presented. Also, new technique called mobility split is presented. To guarantee lower bound property, lower bound estimation is generally apart from the optimal. Proposed technique leads to a more accurate results, although does not guarantee lower bound.
The performance of new technique is quite encouraging, compared with the lower bound's.
