ACM Home Page
Please provide us with feedback. Feedback
Switching activity analysis and pre-layout activity prediction for FPGAs
Full text PdfPdf (237 KB)
Source International Workshop on System-Level Interconnect Prediction archive
Proceedings of the 2003 international workshop on System-level interconnect prediction table of contents
Monterey, CA, USA
SESSION: Session 1: Noise and Timing Issues in Interconnect Prediction table of contents
Pages: 15 - 21  
Year of Publication: 2003
ISBN:1-58113-627-7
Authors
Jason H. Anderson  University of Toronto, Toronto, Ontario, Canada
Farid N. Najm  University of Toronto, Toronto, Ontario, 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): 8,   Downloads (12 Months): 36,   Citation Count: 5
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/639929.639934
What is a DOI?

ABSTRACT

It is well-known that dynamic power dissipation in digital CMOS circuits depends linearly on switching activity. In this paper, we study switching activity in a commercial FPGA and propose a novel approach to pre-layout activity prediction. We examine how switching activity on a net changes when delays are zero (zero delay activity) versus when logic delays are considered (logic delay activity) versus when both logic and routing delays are considered (routed delay activity). Low-power synthesis and early power estimation are typically done on the basis of zero delay activity values, with the assumption that such values correlate well with routed delay activity values. We investigate whether this assumption is valid for FPGA technologies, where critical path delay is often dominated by interconnect delay. We then present an approach for early prediction of routed delay activity values. Our approach is novel in that it estimates each net's routed delay activity using only zero or logic delay activity values along with structural and functional properties of a circuit. Results show that in comparison with zero or logic delay activity values, the predicted activity values are substantially more representative of routed delay activity values.


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
Virtex II Platform FPGA Data Sheet. Xilinx, Inc., San Jose, CA, 2002.
 
2
J. Cong and Y. Ding. Flowmap: An optimal technology mapping algorithm for delay optimization in lookup-table based FPGA designs. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, pages 1--12, January 1994.
 
3
 
4
R. J. Francis, J. Rose, and Z. Vranesic. Technology mapping for lookup table-based FPGAs for performance. In IEEE Int. Conf. on Computer-Aided Design, pages 568--571, 1991.
 
5
6
 
7
 
8
F. Najm. Transition density: A new measure of activity in digital circuits. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, 12:310--323, February 1993.
 
9
 
10
 
11
12
 
13
 
14
 
15


Collaborative Colleagues:
Jason H. Anderson: colleagues
Farid N. Najm: colleagues