ISBN-10:
052154565X
ISBN-13:
9780521545655
Pub. Date:
12/04/2003
Publisher:
Cambridge University Press
Theoretical Foundations of VLSI Design

Theoretical Foundations of VLSI Design

by K. McEvoy, J. V. TuckerK. McEvoy

Paperback

Current price is , Original price is $63.99. You

Temporarily Out of Stock Online

Please check back later for updated availability.

Overview

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.

Product Details

ISBN-13: 9780521545655
Publisher: Cambridge University Press
Publication date: 12/04/2003
Series: Cambridge Tracts in Theoretical Computer Science , #10
Pages: 452
Product dimensions: 7.44(w) x 9.69(h) x 0.67(d)

Table of Contents

Introduction; 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.

Customer Reviews