| 摘要 |
<p>A practical definition for determining an upper bound on information content is provided and used to reduce the widths of operators and edges of data flow graphs (100). A top down procedure for systematically pruning data flow graph is described. The result is shown to enhance the mergeability of subgraphs (105 & 110) 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.</p> |
