Theoretical Foundations of VLSI Design
$64.00 ( ) USD
Adobe eBook Reader
Other available formats:
Looking for an examination copy?
If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact firstname.lastname@example.org providing details of the course you are teaching.
This book discusses recent research in the theoretical foundations of several subjects of importance for the design of hardware, and for computer science in general. The physical technologies of very large scale integration (VLSI) are having major effects on the electronic industry. The potential diversity and complexity of digital systems have begun a revolution in the technologies of digital design, involving the application of concepts and methods to do with algorithms and programming. In return, the problems of VLSI design have led to new subjects becoming of importance in computer science. Topics covered in this volume include: models of VLSI complexity; complexity theory; systolic algorithm design; specification theory; verification theory; design by stepwise refinement and transformations. A thorough literature survey with an exhaustive bibliography is also included. The book has grown from a workshop held at the Centre for Theoretical Computer Science at Leeds University and organised by the editors.
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Date Published: February 2011
- format: Adobe eBook Reader
- isbn: 9780511875663
- availability: This ISBN is for an eBook version which is distributed on our behalf by a third party.
Table of Contents
Part I. Formal Methods and Verification:
1. A mechanised proof of correctness of a simple counter
2. A formal model for the hierarchical design of synchronous and systolic algorithms
3. Correctness proofs for systolic algorithms
4. A palindrome recogniser
Part II. Theory and Methodology of Design:
5. Formal specification of a digital correlator
6. Describing and reasoning about circuits using relations
Part III. Models of Circuits and Complexity Theory:
7. Superpolynomial bounds on monotone network complexity
8. The prioritiser experiment
9. Estimation and measurement of computation time in VLSI.
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email email@example.comRegister Sign in
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.Continue ×