Improved heuristics for finite word-length polynomial datapath optimization
Conventional high-level synthesis techniques are not able to manipulate polynomial expressions efficiently due to the lack of suitable optimization techniques for redundancy elimination over Z 2 n . This paper, in comparison with, presents 1) an improved partitioning heuristic based on single-variab...
Saved in:
| Published in: | 2009 IEEE/ACM International Conference on Computer-Aided Design - Digest of Technical Papers pp. 739 - 744 |
|---|---|
| Main Authors: | , |
| Format: | Conference Proceeding |
| Language: | English Japanese |
| Published: |
IEEE
02.11.2009
|
| Subjects: | |
| ISSN: | 1092-3152 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!