Improved merging of datapath operators using information content and required precision analysis

Abstract

We introduce the notions of required precision and information content of datapath signals and use them to define functionally safe transformations on data flow graphs. These transformations reduce widths of datapath operators and enhance their mergeability. Using efficient algorithms to compute required precision and information content of signals, we define a new algorithm for partitioning a data flow 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 significant improvement in the delay and area of the implementation.