McEvoy K., Tucker J.V. Theoretical Foundations of VLSI Design



McEvoy K., Tucker J.V. Theoretical Foundations of VLSI Design
02.02.2012 в 23:52 3.02 Мб djvu 9 раз
Издательство Cambridge University Press, 1990, -443 pp.
The development of VLSI fabrication technology has resulted in a wide range of new ideas for application specific hardware and computer architectures, and in an extensive set of significant new theoretical problems for the design of hardware. The design of hardware is a process of creating a device that realises an algorithm, and many of the problems are concerned with the nature of algorithms that may be realised. Thus fundamental research on the design of algorithms, programming and programming languages is directly relevant to research on the design of hardware. And conversely, research on hardware raises many new questions for research on software. These points are discussed at some length in the introductory chapter. .
The papers that make up this volume are concerned with the theoretical foundations of the design of hardware, as viewed from computer science. The topics addressed are the complexity of computation; the methodology of design; and the specification, derivation and verification of designs. Most of the papers are based on lectures delivered at our workshop on Theoretical aspects of VLSI design held at the Centre for Theoretical Computer Science, University of Leeds in September 1986. We wish to express our thanks to the contributors and referees for their cooperation in producing this work.

Introduction.
Theoretical foundations of hardware design.
Part 1 Formal methods and verification.
A mechanized proof of correctness of a simple counter.
A formal model for the hierarchical design of synchronous and systolic algorithms.
Verification of a systolic algorithm in process algebra.
Part 2 Theory and methodology of design.
Formal specification of a digital correlator.
Describing and reasoning about circuits using relations.
The synthesis of VLSI signal processors: theory and example.
Part 3 Methods of circuits and complexity theory.
The prioritiser experiment: estimation and measurement of computation time in VLSI.
Superpolynomial lower bounds on monotone network complexity.
Скачать / Download

Комментарии


Смотрите также


Steinbach B., Posthoff C. Logic Functions and Equations: Examples and Exercises

Steinbach B., Posthoff C. Logic Functions and Equations: Examples and Exercises

разное
Springer, 2009. - 234 Pages.

The field of binary Logics has two main areas of application, the Digital Design of Circuits (related to Electrical Engineering) and Propositional Logics (related to Mathematics, Artificial Intelligence, Complexity etc. ). In both cases it is quite possible to teach the theoretical foundatio...
28.12.2010 в 02:15 2.84 Мб 15 раз
Lam W.K.C., Brayton B.K. Timed Boolean Functions. A Unified Formalism for Exact Timing Analysis

Lam W.K.C., Brayton B.K. Timed Boolean Functions. A Unified Formalism for Exact Timing Analysis

разное
Издательство Kluwer, 1994, -297 pp.

Timing research in high performance VLSI systems has advanced at a steady pace over the last few years, while tools, especially theoretical mechanisms, lag behind. Much present timing research relies heavily on timing diagrams, which, although intuitive, are inadequate for analysis of...
28.10.2011 в 01:28 3.64 Мб 6 раз
Fragouli C., Soljanin E. Network Coding Fundamentals

Fragouli C., Soljanin E. Network Coding Fundamentals

разное
Из серии Foundations and Trends in Networking издательства NOWPress, 2007, -149 pp.
Network coding is an elegant and novel technique introduced at the turn of the millennium to improve network throughput and performance. It is expected to be a critical technology for networks of the future. This tutorial addresses the first ...
31.01.2012 в 01:20 958.71 Кб 8 раз
Hachtel G.D., Somenzi F. Logic Synthesis and Verification Algorithms

Hachtel G.D., Somenzi F. Logic Synthesis and Verification Algorithms

разное
Издательство Kluwer, 2002, -568 pp.

This book grew from courses taught at the University of Colorado (Boulder) and at the Universidad Politecnica de Madrid, Spain. As the title suggests, we were motivated by two disparate objectives. First, the VLSI CAD group at Boulder was given the responsibility for teaching a course...
24.10.2011 в 23:09 39.81 Мб 22 раза
McNaughton R. Elementary Computability, Formal Languages, and Automata

McNaughton R. Elementary Computability, Formal Languages, and Automata

разное
Prentice Hall, 1982. - 417 Pages.

This book is an introduction to theoretical computer science emphasizing two interrelated areas: the theory of computability (how to tell whether problems are algorithmically solvable) and the theory of formal languages (how to design and use special languages, as for algorithms). Autom...
24.08.2011 в 22:44 3.4 Мб 11 раз
Savage J.E. Models of Computation. Exploring the Power of Computing

Savage J.E. Models of Computation. Exploring the Power of Computing

разное
Издательство Addison-Wesley, 1998, -699 pp.

Theoretical computer science treats any computational subject for which a good model can be
created. Research on formal models of computation was initiated in the 1930s and 1940s by
Turing, Post, Kleene, Church, and others. In the 1950s and 1960s programming languages,...
28.10.2011 в 09:46 4.2 Мб 24 раза
Luccio F., Pagli L., Steel G. Mathematical and Algorithmic Foundations of the Internet

Luccio F., Pagli L., Steel G. Mathematical and Algorithmic Foundations of the Internet

разное
Chapman & Hall/CRC, 2011. - 221 pages.

To truly understand how the Internet and Web are organized and function requires knowledge of mathematics and computation theory. Mathematical and Algorithmic Foundations of the Internet introduces the concepts and methods upon which computer networks rely and explores their a...
17.08.2011 в 00:00 1.68 Мб 6 раз
Hromkovi? J. Theoretical Computer Science. Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography

Hromkovi? J. Theoretical Computer Science. Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography

разное
Издательство Springer, 2004, -318 pp.

This textbook is an introduction to theoretical computer science with a focus on the development of its algorithmic concepts. It is based on a substantially extended translation of the German textbook "Algorithmische Konzepte der Informatik" written for the first introductory course...
31.01.2012 в 01:11 5.94 Мб 10 раз
Oggier F., Viterbo E. Algebraic Number Theory and Code Design for Rayleigh Fading Channels

Oggier F., Viterbo E. Algebraic Number Theory and Code Design for Rayleigh Fading Channels

разное
Из серии Foundations and Trends in Communications and Information Theory издательства NOWPress, 2004, -97 pp.

Elementary number theory was the basis of the development of error correcting codes in the early years of coding theory. Finite fields were the key tool in the design of powerful binary codes and gradually enter...
28.10.2011 в 01:38 1.06 Мб 3 раза
Bender E.A., Williamson S.G. Foundations of Combinatorics with Applications

Bender E.A., Williamson S.G. Foundations of Combinatorics with Applications

разное
Издательство Dover Publications, 2005, -469 pp.

Combinatorics, the mathematics of the discrete, has blossomed in this generation. On the theoretical side, a variety of tools, concepts and insights have been developed that allow us to solve previously intractable problems, formulate new problems and connect previously un...
04.10.2011 в 01:21 4.03 Мб 10 раз