Reducing datapath widths by rebalancing data flow topology
US6832357B2 · kind B2 · utility
10Cited by
20References
23Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Jun 17, 2002 |
| Grant date | Dec 14, 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 Huffman algorithm is applied to revise the topology of a data flow graph. The result of the application of the algorithm is an increase in the sizes of at least some clusters (i.e., enhanced mergeability). The Huffman rebalancing of the topology may also result in the benefit of allowing further pruning of the bitwidths of data flow paths, which may further enhance mergeability. Thus, the algorithm may be applied with a maximum information content analysis.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.