ACM Home Page
Please provide us with feedback. Feedback
An analytical approach for dynamic range estimation
Full text PdfPdf (237 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 41st annual Design Automation Conference table of contents
San Diego, CA, USA
SESSION: High-level techniques for signal processing table of contents
Pages: 472 - 477  
Year of Publication: 2004
ISBN:1-58113-828-8
Authors
Bin Wu  University of Toronto, Toronto, ON, Canada
Jianwen Zhu  University of Toronto, Toronto, ON, Canada
Farid N. Najm  University of Toronto, Toronto, ON, Canada
Sponsors
ACM: Association for Computing Machinery
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 22,   Citation Count: 1
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/996566.996699
What is a DOI?

ABSTRACT

It has been widely recognized that the dynamic range information of an application can be exploited to reduce the datapath bitwidth of either processors or ASICs, and therefore the overall circuit area, delay and power consumption. While recent proposals of analytical dynamic range estimation methods have shown significant advantages over the traditional profiling-based method in terms of runtime, we argue that the rather simplistic treatment of input correlation may lead to significant error. We instead introduce a new analytical method based on a mathematical tool called Karhunen-Loeve Expansion (KLE), which enables the orthogonal decomposition of random processes. We show that when applied to linear systems, this method can not only lead to much more accurate result than previously possible, thanks to its capability to capture and propagate both spatial and temporal correlation, but also richer information than the value bounds previously produced, which enables the exploration of interesting trade-off between circuit performance and signal-to-noise ratio.


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
 
2
K. Kum and W. Sung. Combined word-length optimization and high-level synthesis of digital signal processing systems. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 20(8):921--930, August 2001.
3
 
4
 
5
S. Mahlke, R. Ravindran, M. Schlansker, R. Schreiber, and T. Sherwood. Bitwidth cognizant architecture synthesis of custom hardware accelerators. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 20(11):1355--1371, November 2001.
6
 
7
A. Papoulis. Probability, Random Variables, and Stochastic Processes. McGraw-Hill, New York, 1984.
 
8
I. T. Jolliffe. Principal Component Analysis. Springer-Verlag, New York, 2002.
 
9
J. E. Kolassa. Series Approximation Methods in Statistics. Springer-Verlag, New York, 1994.
 
10
 
11


Collaborative Colleagues:
Bin Wu: colleagues
Jianwen Zhu: colleagues
Farid N. Najm: colleagues