This Book Presents The Basic Concepts Used In The Design And Analysis Of Digital Systems And Introduces The Principles Of Digital Computer Organization And Design. Cover Contents Preface 1. Binary Systems 1.1 Digital Computers and Digital Systems 1.2 Binary Numbers 1.3 Number Base Conversions 1.4 Octal and Hexadecimal Numbers 1.5 Complements 1.6 Binary Codes 1.7 Binary Storage and Registers 1.8 Binary Logic 1.9 Integrated Circuits 2. Boolean Algebra and Logic Gates 2.1 Basic Definitions 2.2 Axiomatic Definition of Boolean Algebra 2.3 Basic Theorems and Properties of Boolean Algebra 2.4 Boolean Functions 2.5 Canonical and Standard Forms 2.6 Other Logic Operations 2.7 Digital Logic Gates 2.8 IC Digital Logic Families 3. Simplification of Boolean Functions 3.1 The Map Method 3.2 Two- and Three-variable Maps 3.3 Four-variable Map 3.4 Five- and Six-Variable Maps 3.5 Product of Sums Simplification 3.6 NAND and NOR Implementation 3.7 Other Two-level Implementations 3.8 Don’t-care Conditions 3.9 The Tabulation Method 3.10 Determination of Prime-implicants 3.11 Selection Of Prime-implicants 3.12 Concluding Remarks 4. Combinational Logic 4.1 Introduction 4.2 Design Procedure 4.3 Adders 4.4 Subtractors 4.5 Code Conversion 4.6 Analysis Procedure 4.7 Multilevel Nand Circuits 4.8 Multilevel NOR Circuits 4.9 Exclusive-OR and Equivalence Functions 5. Combinational Logic with MSI and LSI 5.1 Introduction 5.2 Binary Parallel Adder 5.3 Decimal Adder 5.4 Magnitude Comparator 5.5 Decoders 5.6 Multiplexers 5.7 Read-Only Memory (ROM) 5.8 Programmable Logic Array (PLA) 5.9 Concluding Remarks 6. Sequential Logic 6.1 Introduction 6.2 Flip-Flops 6.3 Triggering of Flip-flops 6.4 Analysis of Clocked Sequential Circuits 6.5 State Reduction and Assignment 6.6 Flip-flop Excitation Tables 6.7 Design Procedure 6.8 Design of Counters 6.9 Design with State Equations 7. Registers, Counters, and the Memory Unit 7.1 Introduction 7.2 Registers 7.3 Shift Registers 7.4 Ripple Counters 7.5 Synchronous-counters 7.6 Timing Sequences 7.7 The Memory Unit 7.8 Examples of Random-access Memories 8. Register-Transfer Logic 8.1 Introduction 8.3 Arithmetic, Logic, and Shift Microoperations 8.4 Conditional Control Statements 8.5 Fixed-point Binary Data 8.6 Overflow 8.7 Arithmetic Shifts 8.8 Decimal Data 8.9 Floating-point Data 8.7 Arithmetic Shifts 8.8 Decimal Data 8.9 Floating-point Data 8.10 Nonnumeric Data 8.11 Instruction Codes 8.12 Design of a Simple Computer 9. Processor Logic Design 9.1 Introduction 9.2 Processor Organization 9.3 Arithmetic Logic Unit 9.4 Design of Arithmetic Circuit 9.5 Design of Logic Circuit 9.6 Design of Arithmetic Logic Unit 9.7 Status Register 9.8 Design of Shifter 9.9 Processor Unit 9.10 Design of Accumulator 10. Control Logic Design 10.1 Introduction 10.2 Control Organization 10.3 Hard-wired Control—Example 1 10.4 Microprogram Control 10.5 Control of Processor Unit 10.6 Hard-wired Control—Example 2 10.7 PLA Control 10.8 Microprogram Sequencer 11. Computer Design 11.1 Introduction 11.2 System Configuration 11.3 Computer Instructions 11.4 Timing and Control 11.5 Execution of Instructions 11.6 Design of Computer Registers 11.7 Design of Control 11.8 Computer Console 12. Microcomputer System Design 12.1 Introduction 12.2 Microcomputer Organization 12.3 Microprocessor Organization 12.4 Instructions and Addressing Modes 12.5 Stack, Subroutines, and Interrupt 12.6 Memory Organization 12.7 Input-output Interface 12.8 Direct Memory Access 13. Digital Integrated Circuits 13.1 Introduction 13.2 Bipolar Transistor Characteristics 13.3 RTL and DTL Circuits 13.4 Integrated-injection Logic (I2L) 13.5 Transistor-Transistor Logic (TTL) 13.6 Emitter-coupled Logic (ECL) 13.7 Metal-Oxide Semiconductor (MOS) 13.8 Complementary MOS (CMOS) Appendix Index