ACM Home Page
Please provide us with feedback. Feedback
Improved merging of datapath operators using information content and required precision analysis
Full text PdfPdf (218 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 38th annual Design Automation Conference table of contents
Las Vegas, Nevada, United States
Pages: 462 - 467  
Year of Publication: 2001
ISBN:1-58113-297-2
Authors
Anmol Mathur  Cadence Design Systems, 555 River Oaks Parkway, San Jose, CA
Sanjeev Saluja  Cadence Design Systems, 555 River Oaks Parkway, San Jose, CA
Sponsors
EDAC : Electronic Design Automation Consortium
IEEE-CAS : Circuits & Systems
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 24,   Citation Count: 6
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/378239.378562
What is a DOI?

ABSTRACT

We introduce the notions of required precision and information content of datapath signals and use them to define functionally safe transformations on data ow graphs. These transformations reduce widths of datapath operators and enhance their mergeability. Using efficient algorithms to compute required precision and information content of signals, we define a new algorithm for partitioning a data flow graph consisting of datapath operators into mergeable clusters. Experimental results indicate that use of our clustering algorithm for operator merging based synthesis of datapath intensive designs, can lead to significant improvement in the delay and area of the implementation.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
D. A. Huffman, A method for the construction of minimum-redundancy codes, Proceedings of the IRE, 40(9), 1952, pp. 1098-1101.
2
 
3
 
4
5
 
6
C. S. Wallace, "A suggestion for a fast multiplier" IEEE Trans. Electron. Comput., Feb. 1964, vol EC-13, pp.14-17.
 
7
8


Collaborative Colleagues:
Anmol Mathur: colleagues
Sanjeev Saluja: colleagues