ACM Home Page
Please provide us with feedback. Feedback
FPGA interconnect design using logical effort
Source
International Symposium on Field Programmable Gate Arrays archive
Proceedings of the 16th international ACM/SIGDA symposium on Field programmable gate arrays table of contents
Monterey, California, USA
POSTER SESSION: Poster session 1: architecture and CAD table of contents
Pages 257-257  
Year of Publication: 2008
ISBN:978-1-59593-934-0
Authors
Haile Yu  The Chinese University of Hong Kong, Shatin, Hong Kong
Yuk Hei Chan  The Chinese University of Hong Kong, Shatin, Hong Kong
Philip H.W. Leong  The Chinese University of Hong Kong, Shatin, Hong Kong
Sponsors
ACM: Association for Computing Machinery
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 0
Additional Information:

abstract   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1344671.1344710
What is a DOI?

ABSTRACT

Logical effort (LE) is a linear technique for modeling the delay of a circuit in a technology independent manner. It offers the potential to simplify delay models for FPGAs and gain more insight into how the parameters affect the result. In this paper, the LE model will be introduced and an application to FPGA interconnect driver sizing described. Simple closed form equations are given for delay, sensitivity of delay to driver size and optimal delay. The results are shown to closely agree with Spice simulation


Collaborative Colleagues:
Haile Yu: colleagues
Yuk Hei Chan: colleagues
Philip H.W. Leong: colleagues