Improved merging of datapath operators using information content and required precision analysis
Anmol Mathur, Sanjeev Saluja · 2001
Abstract: We introduce the notions of required precision and information content of datapath signals and use them to de ne functionally safe transformations on data ow graphs. These transformations reduce widths of datapath operators and enhance their mergeability. Using e cient algorithms to compute required precision and information content of signals, we de ne a new algorithm for partitioning a data ow graph consisting of datapath operators into mergeable clusters. Experimental results indicate that use of our clustering algorithm for operator merging based synthesis of datapath intensive designs, can lead to signi cant improvement in the delay and area of the implementation. 1.