Enhancing mergeability of datapaths and reducing datapath widths responsively to required precision

摘要

A practical definition for determining a required precision is provided and used to reduce the widths of operators and edges of data flow graphs. A bottom-up procedure for systematically pruning data flow graphs is described. The result is shown to enhance the mergeability of subgraphs and provide reduced data path widths. This may result in lower area, power requirements and other benefits as readily understood in the field of circuit design.