Enhancing mergeability of datapaths and reducing datapath widths responsively to required precision
US6772399B2 · kind B2 · utility
9Cited by
20References
25Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Jun 17, 2002 |
| Grant date | Aug 3, 2004 |
| Priority date | — |
| Expiry date | Jun 17, 2022 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F30/30
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.