MIT Computation structures

【实例简介】
MIT 6.004配套教材。从门电路开始讲起，包括组合数字电路，时序数字电路，有限状态机，图灵机，指令集设计，虚拟内存，流水线，并行计算，FPGA等等内容。
The MilT Electrical Engineering and Computer Science Series Harold Abelson and Gerald Jay Sussman with Julie Sussman, Structure and Interpretation of Computer Programs, 198 William McC. Siebert, Circuits, Signals, and Systems, 1986 Berthold Klaus Paul Horm s robot vision, 1986. Barbara Liskov and John Guttag, Abstraction and Specification in Program Developinent 1986 Thomas H. Cormen, Charles e Leiserson, and ronald L Rivest, introduction to algorithm 1990 Stephen A. Ward and robert H. Halstead, Jr, Computation Structures, 1990 Stephen A. Ward Robert h halstead jr Computation Structures The mit press Cambridge, Massachusetts London, England McGraw-Hill Book Company New York St Louis san francisco Montreal Toronto Fift 1999 This book is one of a series of texts written by faculty of the Electrical Engineering and Computer Science Department at the Massachusetts Institute of Technology. It was edited and produced by The MIT Press under a joint production-distribution arrangement with the McGraw-Hill Book Company. dering Information: North america Text orders should be addressed to the McGraw-Hill Book Company. All other orders should be addressed to The mit press Outside North america All orders should be addressed to The MIT Press or its local distributor c1990 by The Massachusetts Institute of Technology All rights reserved. No part of this book may be reproduced in any form or by any elec conic or mechanical means (including photocopying, recording, or information stroage and retrieval)without permission in writing from the publisher. his book was printed and bound in the United States of Am Library of Congress Cataloging-in-Publication Data Ward, Stephen A. Computation structures /Stephen A. Ward, Robert H. Halstead, Jr p. cm(The MiT electrical engineering and computer science series) ISBN 0-262-23139-5(MIT Press)iSBN 0-07-068147-3(McGraw-Hill) I. Computers-Circuits. 2. Logic design, 3. Computer I. Halstead, robert h. II. Title. Ill, S rY78884,W371989 621392d20 89-12961 Contents PReface xv The Digital Abstraction I 1.1 Information and the Digital Abstraction 2 Representation of Discrete Variables 3 1. 3 Combinational Devices 4 1.4 The Static Discipline: Logic Levels 5 1.5 Rate of Information Flow 7 1.6 Transitions and validity 8 1.7 Logic Famil 1. 8 Digital-Circuit Implementation g 1.9 Summary 24 1. 10 Context 24 1.11 Problems 25 Binary Representations and Notation 33 2.1 Representation of Numbers 34 2.2 Floating-Point Representations 39 2.3 Other Representations 39 2.4 Hexadecimal Notation 40 2.5 *Unrepresentable Values 41 2.6 Error Detection and Correction 42 2. 7 Context 44 2.8 Problems 44 Combinational Devices and Circuits 4T 3.1 Boolean Functions and Truth Tables 47 3.2 Elementary Gate Circuits 5 3.3 Synthesis of Logic Circuits 54 3.4 Temporal Considerations in Combinational Circuits 61 3.5 Context 65 3.6 problems 66 Sequences and State 75 4.1 Feedback and State 76 4.2 Latches, Flip-Flops, and Registers 78 4.3 Edge-Triggered Flip-Flops and Registers 8.3 4.4 Register Timing 8.5 4.5 Models of Sequential circuits 86 4.6S Synchronization and State 93 4.7 Context 200 4.8 Problems 00 Synthesis of Digital Systems 105 5. 1 Building Blocks for Logic Design 105 5.2 Regular Structures 119 5.3 Design Example: A Combinational Multiplier 130 5.4 Context /34 5.5 Problems 734 Contents Finite-State Machines 143 I Synthesis of Finite-State Machines 144 6. 2 Synchronous FSM Circuit Models 146 3 States and Bits /47 64 quivalence of FSMs 48 6.5 * Regular Expressions and Nondeterministic FSMS 151 6.6 Context 154 6.7 Problems 155 Control Structures and Disciplines 17I 7.1 Timing Disciplines 172 . D 7.3 Constraints on Control Structure /77 7.4 Synchronous Globally Timed Control, 187 7.5 Synchronous Locally Timcd Control 190 7.6 Asynchronous Locally Timed Control 197 7.7 Context 1 7. 8 Problems 197 8 Performance Me s and Trade-offs 201 8.1P relining 204 8,2 Systematic Pipeline Construction 210 8.3 Cost-Performance Trade-offs and Options 212 8.4 Implementations of Bubble Sort 213 85 Efficient Sorting Algorithms 221 8.6Su 24 8. 7 Cor 8. 8 Problems 226 contents Communication: Issues and structures 237 9.1 Physical Limits and Constraints 237 9.2 Communication Buses 245 9.3 Serial Communication 259 9.4 Context 2 9 5 Problems 265 Interpretation 269 10.1 Turing Machines and Computability 269 10,2 Universality 272 10.3 Uncomputable Functions 273 10.4 Interpretation versus Compilation 275 10.5 Context 277 10.6 Probiems 277 Microinterpreter Architecture 281 11.1 Data Paths versus Control 281 11.2 A Basic Data Path Architecture 283 11.3 Typical Data-Path Subsystems and Uses 287 11.4 Control Subsystem 293 11.5 The Control Machine as an Interpreter 298 11.7 Problems 299 contents Microprogramming and microcode 303 2. 1 Microcode Semantics 30 12.2 Symbolic Microprogramming 312 12.3 Microcoding Examples 319 12. 4 Summary 325 12.5Co 325 12.6 Problems 325 13 Single-Sequence Machines 335 13.1 Machine Language as an Abstraction 33.5 13.2 Gross Organization of the Single-sequence machine 336 13.3 Influences on Machine-Language Design 337 13. 4 Implementation Considerations 353 13.5 The von Neumann Machine 356 13.6 Perspect d 'trends 362 13. 7 Context 364 13. 8 Problems 366 Stack Architectures: The s machine 367 14.1 Basic Instructions 368 14.2 S-Machine Instruction Coding 371 14.3 MAYBE Implementation 372 14.4 Compilation Te for Stack machines 38 F f control on the s machine 38 14.6 *Relative Addressing and Position-Independent Code 389 14.7 Stack frar d Procedure Linkage 392 14.8 Lexical-Scoping Support 400 149maps408 14.10Sum 411 14.11 Context 412 14.12 Problems 412 【实例截图】
【核心代码】