Table Of Content

lectrical engineer in^ an ~orn~~~tceiern ceS eries Harold Abelson and Gerald Jay Sussman with Julie Sussman, Structure and Znterpretation of Computer Programs,1 985. William McC. Siebert, Circuits, Signals, and Systems, 1986. Berthold Klaus Paul Horn, Robot Vision, 1986. Barbara Liskov and John Guttag, Abstraction and Spec~cationin Program Development, 1986. Thomas Cormen, CharlesE . Leiserson, and Ronald L. RivesZt,n troduction to Algorithms, H. 1990. Stephen A. Ward and Robert H. Halstead, Jr., Computation Structures,1 990. The MIT Press Cambridge, Massachusetts London, England McGraw-Hill Book Company NewY ork St.L ouisS anF rankiscoM ontrealT oronto Fifth printing, 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 MlT Press under a joint production"dist~butio~n angemenwt ith the McGraw-Hill Book Company. Ordering 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 Ameri~a All orders should be addressed to The MIT Press or its local distributor. 01990 by The Massa~husetts Institutoef Technology All rights reserved. No part of this book may be reproduced in any form or by any elec- tronic or mech~icaml eans (includlng phot~opyingr,e cording, or information stroage and retrieval) without permission in writing from the publisher. This book was printed and bound in the United States of America. Librw of Congress Catalog~g-in-~blicatioDna ta Ward, Stephen A. Computation structures / Stephen A. Ward, Robert H. Halstead, Jr. p.c m,-(The MIT electrical engineering and computer science series) ISBN 0-262-23139-5 (&UT Press).-ISBN 0-07-068147-3 (~~Graw-Hill) 1. Computers-Circuits. 2. Logic design. 3. Computer ~chitect~e.I. HalsteadR , obert W. Title. III. Series. II. TK7888.4.W193 879 1 1296 89- 621.39'2-dc20 CIP 1.1 Info~ationa nd the Digital Abstraction 2 1.2 Representation of Discrete Vtxiables 3 1.3 combination^ Devices 4 1.4 The Static Discipline: Logic Levels 5 1. S Rate of Information Row 7 1.6 Transitions and Validity 8 1.7 Logic Families 8 1.8 ~igital-CircuiItm plementation 9 1.9 $ u m m ~24 1.10 Context 24 1.11 oblems 25 2.1 Representation of Numbers 34 2.2 Floating-point Representations 39 2.3 Other Representations 39 2.4 Hexadecimal Notation 40 2.5 *~~epresentabVleal ues 41 2.6 Error Detection and Correction 42 2.7 Context 44 2.8 Problems 44 3.1 BooleanF unctionsa ndT ruthT ables 47 3.2 Elementary Gate Circuits 51 3.3 Synthesis of LogicC ircuits 54 3.4 TemporalC onsiderationsi nC ombinationalC ircuits 61 3.5 Context 65 3.6 Problems 66 4.1 Feedback and State 76 4.2 Latches, Flip-Flops, and Registers 78 4.3 Edge-Triggered Flip-Flops and Registers 83 4.4 Register Timing 85 4.5 Models of Sequential Circuits 86 4.6 Synchronization and State 93 4.7 Context 100 4.8 Problems 100 5.1 BuildingB locks for LogicD esign 105 5.2 RegulSa rt ructures 119 5.3 DesignE xample: A CombinationaMl ultiplier 130 5.4 Context 134 5.5 Problems 134 vi Contents 6.1 Synthesis of Finite-State Machines 144 6.2S ynchronousF SM Circuit Models 146 6.3 States and Bits 147 6.4 *Equivalence of FSMs 148 6.5 *Regular Expressions and ~ondete~inistFiScM s 151 6.6 Context 154 6.7 Problems 155 7T.1 i ming Disciplines 172 7.2 Degrees of Synchrony 173 7.3 Constraints on Control Structure 177 7.4S ynchronousG loballyT imed Control.. 187 7.5 SynchronousL ocallyT imed Control 190 7.6 Asynchronous Locally TimedC ontrol 191 C7. o7n text 196 P7r. 8o blems 196 8. l Pipelining 204 8.2 Systematic Pipeline Construction 210 8.3 Cost-Pe~o~anTcrea de-offs and Options 212 8.4 Implementations of Bubble Sort 213 8.5 More Efficient Sorting Algorithms 221 8.6 S u m m ~22 4 8.7 Context 225 8.8 Problems 226 Contents vii 9.1 Physical Limits and Constraints 237 9.C2 o mmunicatioBn u ses 245 9.3 Serial Communication 259 C9. o4n text 264 P9r. 5o blems 265 . 10.1T uringM achinesa ndC omputability 269 10U.2 n iversali2ty 7 2 10.3U ncomputablFe unctions 273 10.4 Interpretation versus Co~pilation2 75 10C.5 o ntext 277 10.6 Problems 277 11.1D ata Paths versusC ontrol 281 asic Data-Path Architecture 283 11.3 TypicalD ata-Path Subsystems andU ses 287 11.4 Control Subsystem 293 11.5T he Control Machinea sa n Interpreter 298 11.6 Context 299 11P.7 r oblems 299 viii 12.M1 icrocodSe emantics 303 12.2S ymbolicM icroprogramming 312 icrocoding Examples 319 12.4 Summary 325 12C.5 o ntext 325 12.6 Problems 325 13.1 Machine Language as an Abstraction 335 13.2 Cross Organization of the Single-Sequence Machine 336 13.3 Influences on Machine-Language Design 337 13.4 Implementation Considerations 353 13.5 The von ~e~maMnnac hine 356 13.6 Perspectives and Trends 362 13.7 Context 364 13.8 Problems 366 14.1 asic Instructions 368 14.2 S-Machine Instruction Coding 371 14.3 *MAYBE I~plementation3 72 14.4 Compilation Techniques for Stack Machines 381 14.5 Flow of Control on the S Machine 385 14.6 *Relative Addressing and Position-Independent Code 389 14.7 Stack Frames and Procedure Linkage 392 14.8 "Lexical-Scoping Support 400 14.9 Traps 408 14.10 Su~mary4 11 14.11 Context 41 2 14.12 Problems 41 2 Contents