Courses
Computer System Architecture
From Logic Gates to Memory and I/O
AI generated by Nikhil Kumar Rajput
In the reading list Computer architecture to silicon (book 1 of 3)
21 chapters
Contents¶
Front matter
Unit 1
Chapter 1: Logic Gates and Boolean Algebra
- 1.1 Binary logic and the truth table
- 1.2 The seven standard gates
- 1.3 Positive and negative logic
- 1.4 Universal gates
- 1.5 Boolean algebra
- 1.6 DeMorgan's theorems
- 1.7 Algebraic simplification
- 1.8 Boolean functions and canonical forms
- 1.9 Combinational circuits and the design procedure
- 1.10 Summary
- 1.11 Exercises
Chapter 2: Karnaugh Maps and Minimisation
- 2.1 Why a map instead of algebra
- 2.2 Building the map
- 2.3 Grouping rules and reading a minimal SOP
- 2.4 Prime implicants and essential prime implicants
- 2.5 Product-of-sums from the map
- 2.6 Don't-care conditions
- 2.7 Beyond four variables and the tabular method
- 2.8 When minimal is not safe: static hazards
- 2.9 Summary
- 2.10 Exercises
Chapter 3: Sequential Circuits and Flip-Flops
- 3.1 Combinational versus sequential circuits
- 3.2 Latches and flip-flops: level versus edge
- 3.3 Where the memory comes from: the SR latch
- 3.4 The gated D latch, race-around and the master-slave principle
- 3.5 The four flip-flops
- 3.6 Characteristic equations
- 3.7 Excitation tables
- 3.8 Flip-flop conversion
- 3.9 Timing: the clock pulse, setup and hold
- 3.10 Counters, registers and the road ahead
- 3.11 Summary
- 3.12 Exercises
Unit 2
Chapter 4: Adders, Subtractors and Code Converters
Chapter 5: Decoders, Encoders and Multiplexers
- 5.1 Decoders
- 5.2 Decoder expansion
- 5.3 Implementing functions with a decoder
- 5.4 Encoders
- 5.5 Priority encoders
- 5.6 Multiplexers
- 5.7 Implementing Boolean functions with a multiplexer
- 5.8 Multiplexer trees
- 5.9 Demultiplexers
- 5.10 A multiplexer-demultiplexer data link
- 5.11 Putting the four components side by side
- 5.12 Summary
- 5.13 Exercises
Unit 3
Chapter 8: Signed Numbers, Floating Point and Binary Codes
Unit 4
Chapter 9: The Basic Computer: Registers, Bus and Instruction Codes
- 9.1 The stored-program computer
- 9.2 The parameters of the basic computer
- 9.3 Registers and flip-flops
- 9.4 The common bus
- 9.5 From microoperations to control signals
- 9.6 Instruction codes and the 16-bit word
- 9.7 Direct and indirect addressing
- 9.8 The three instruction formats and the 25 instructions
- 9.9 Reading a hexadecimal instruction
- 9.10 Summary
- 9.11 Exercises
Chapter 10: Timing, Control and the Instruction Cycle
- 10.1 Programs, instructions and microoperations
- 10.2 The control unit's clock: SC, decoders and timing signals
- 10.3 The instruction cycle: fetch and decode
- 10.4 The fork at T3: four mutually exclusive cases
- 10.5 The seven memory-reference instructions
- 10.6 Full instruction traces
- 10.7 Summary
- 10.8 Exercises
Chapter 11: Register-Reference, Input-Output and Interrupts
- 11.1 Instructions that finish in one step
- 11.2 Clear, complement and increment
- 11.3 The circulate instructions
- 11.4 Skip instructions and halt
- 11.5 Talking to slow devices
- 11.6 Programmed input-output and its price
- 11.7 The idea of an interrupt
- 11.8 The interrupt cycle
- 11.9 The interrupt round trip, worked through
- 11.10 Summary
- 11.11 Exercises
Chapter 12: The Complete Computer and Control Unit Design
- 12.1 The whole machine on one page
- 12.2 What the hardware consists of
- 12.3 Designing the control gates, one register at a time
- 12.4 Where the Bus Selection Comes From
- 12.5 Hardwired control
- 12.6 Microprogrammed control
- 12.7 The microinstruction, bit by bit
- 12.8 Microoperation, microinstruction, microprogram
- 12.9 Hardwired against microprogrammed
- 12.10 Summary
- 12.11 Exercises
Unit 5
Chapter 14: General Register Organization and Stacks
- 14.1 From one accumulator to many registers
- 14.2 The register-bank datapath
- 14.3 The control word
- 14.4 From microoperation to control word
- 14.5 Stack organization
- 14.6 The register stack
- 14.7 The memory stack
- 14.8 Reverse Polish notation
- 14.9 Instruction formats: three, two, one and zero addresses
- 14.10 Summary
- 14.11 Exercises
Chapter 15: Addressing Modes and the Instruction Set
- 15.1 Why addressing modes exist
- 15.2 The ten addressing modes
- 15.3 One instruction under every mode
- 15.4 Calculating effective addresses: a method
- 15.5 Relative, indexed and base-register addressing in practice
- 15.6 The instruction set: three families
- 15.7 Program control and the status bits
- 15.8 The program interrupt
- 15.9 Summary
- 15.10 Exercises
Chapter 16: RISC and CISC
- 16.1 Two philosophies of instruction set
- 16.2 CISC: the complex instruction set computer
- 16.3 RISC: characteristics
- 16.4 Load/store architecture
- 16.5 Why RISC pipelines well
- 16.6 Overlapped register windows
- 16.7 A real RISC: the Berkeley RISC I
- 16.8 RISC-V: an open RISC
- 16.9 RISC against CISC
- 16.10 The CPU-time equation
- 16.11 Where the debate ended up
- 16.12 Summary
- 16.13 Exercises
Unit 6
Chapter 18: Memory Hierarchy, Main Memory and Auxiliary Memory
Chapter 19: Cache Memory and Virtual Memory
Chapter 20: Input-Output Interface and Modes of Transfer
Back matter
Quick Reference
- Q.1 Unit 1: Digital Logic Circuits
- Q.2 Unit 2: Digital Components
- Q.3 Unit 3: Data Representation and Arithmetic
- Q.4 Unit 4: Basic Computer Organization and Design
- Basic computer: parameters and registers
- Common bus and control signals
- Instruction formats and decoding
- Timing and the instruction cycle
- Memory-reference microoperations
- Trace checklist
- Register-reference instructions (7xxx)
- Input-output instructions (Fxxx)
- Interrupt
- Control-gate design (hardwired)
- Control unit styles
- Pipelining
- Q.5 Unit 5: Processors
- Q.6 Unit 6: Memory and Input-Output Organization
About this book¶
A complete textbook for the six units of Computer System Architecture: digital logic, combinational and sequential components, data representation and arithmetic, the basic computer, processors, and memory and input-output organization, with worked examples and exercises throughout.