Required precision and information content of datapath signals are used to
define functionally safe transformations on data flow graphs. These
transformations reduce widths of datapath operators and edges and enhance
the mergeability of operators. An algorithm for optimally balancing data
flow graph topology to further reduce the data path widths and further
enhance mergeability is combined with the above in an iterative algorithm
for optimizing DFGs.
