Theoretical Foundations of VLSI Design (Cambridge Tracts in Theoretical Computer Science, 10)

個数:

Theoretical Foundations of VLSI Design (Cambridge Tracts in Theoretical Computer Science, 10)

  • 提携先の海外書籍取次会社に在庫がございます。通常2週間で発送いたします。
    重要ご説明事項
    1. 納期遅延や、ご入手不能となる場合が若干ございます。
    2. 複数冊ご注文の場合、分割発送となる場合がございます。
    3. 美品のご指定は承りかねます。
  • 製本 Paperback:紙装版/ペーパーバック版/ページ数 448 p.
  • 言語 ENG,ENG
  • 商品コード 9780521545655
  • DDC分類 005

基本説明

New in paperback. Hardcover was publishrd in 1990 is out of print.

Full Description


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.

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.