FPGA routing and routability estimation via Boolean satisfiability

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: R. Glenn Wood Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA
Rob A. Rutenbar Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA
Published in:
Cover Image
 
· Proceeding
FPGA '97 Proceedings of the 1997 ACM fifth international symposium on Field-programmable gate arrays
Pages 119-125
ACM New York, NY, USA ©1997
table of contents ISBN:0-89791-801-0 doi>10.1145/258305.258322
FPGA routing and routability estimation via Boolean satisfiability Published by ACM 1997 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 8
· Downloads (cumulative): 348
· Citation Count: 15


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder