9780132129374

Digital Design

by
  • ISBN13:

    9780132129374

  • ISBN10:

    013212937X

  • Edition: 2nd
  • Format: Hardcover
  • Copyright: 1/1/1991
  • Publisher: Prentice Hall
  • View Upgraded Edition
  • Purchase Benefits
  • Free Shipping On Orders Over $59!
    Your order must be $59 or more to qualify for free economy shipping. Bulk sales, PO's, Marketplace items, eBooks and apparel do not qualify for this offer.
  • Get Rewarded for Ordering Your Textbooks! Enroll Now
List Price: $102.00

Summary

For sophomore courses on digital design in an Electrical Engineering, Computer Engineering, or Computer Science department. & Digital Design, fourth edition is a modern update of the classic authoritative text on digital design.& This book teaches the basic concepts of digital design in a clear, accessible manner. The book presents the basic tools for the design of digital circuits and provides procedures suitable for a variety of digital applications.

Table of Contents

PREFACE ix
1 BINARY SYSTEMS
1(35)
1-1 Digital Computers and Digital Systems
1(3)
1-2 Binary Numbers
4(2)
1-3 Number Base Conversions
6(3)
1-4 Octal and Hexadecimal Numbers
9(1)
1-5 Complements
10(4)
1-6 Signed Binary Numbers
14(3)
1-7 Binary Codes
17(8)
1-8 Binary Storage and Registers
25(3)
1-9 Binary Logic
28(4)
References
32(1)
Problems
33(3)
2 BOOLEAN ALGEBRA AND LOGIC GATES
36(36)
2-1 Basic Definitions
36(2)
2-2 Axiomatic Definition of Boolean Algebra
38(3)
2-3 Basic Theorems and Properties of Boolean Algebra
41(4)
2-4 Boolean Functions
45(4)
2-5 Canonical and Standard Forms
49(7)
2-6 Other Logic Operations
56(2)
2-7 Digital Logic Gates
58(4)
2-8 Integrated Circuits
62(7)
References
69(1)
Problems
69(3)
3 SIMPLIFICATION OF BOOLEAN FUNCTIONS
72(42)
3-1 The Map Method
72(1)
3-2 Two- and Three-Variable Maps
73(5)
3-3 Four-Variable Map
78(4)
3-4 Five-Variable Map
82(2)
3-5 Product of Sums Simplification
84(4)
3-6 NAND and NOR Implementation
88(6)
3-7 Other Two-Level Implementations
94(4)
3-8 Don't-Care Conditions
98(3)
3-9 The Tabulation Method
101(1)
3-10 Determination of Prime Implicants
101(5)
3-11 Selection of Prime Implicants
106(2)
3-12 Concluding Remarks
108(2)
References
110(1)
Problems
111(3)
4 COMBINATIONAL LOGIC
114(38)
4-1 Introduction
114(1)
4-2 Design Procedure
115(1)
4-3 Adders
116(5)
4-4 Subtractors
121(3)
4-5 Code Conversion
124(2)
4-6 Analysis Procedure
126(4)
4-7 Multilevel NAND Circuits
130(8)
4-8 Multilevel NOR Circuits
138(4)
4-9 Exclusive-OR Functions
142(6)
References
148(1)
Problems
149(3)
5 MSI AND PLD COMPONENTS
152(50)
5-1 Introduction
152(2)
5-2 Binary Adder and Subtractor
154(6)
5-3 Decimal Adder
160(3)
5-4 Magnitude Comparator
163(3)
5-5 Decoders and Encoders
166(7)
5-6 Multiplexers
173(7)
5-7 Read-Only Memory (ROM)
180(7)
5-8 Programmable Logic Array (PLA)
187(5)
5-9 Programmable Array Logic (PAL)
192(5)
References
197(1)
Problems
197(5)
6 SYNCHRONOUS SEQUENTIAL LOGIC
202(55)
6-1 Introduction
202(2)
6-2 Flip-Flops
204(6)
6-3 Triggering of Flip-Flops
210(8)
6-4 Analysis of Clocked Sequential Circuits
218(10)
6-5 State Reduction and Assignment
228(3)
6-6 Flip-Flop Excitation Tables
231(5)
6-7 Design Procedure
236(11)
6-8 Design of Counters
247(4)
References
251(1)
Problems
251(6)
7 REGISTERS, COUNTERS, AND THE MEMORY UNIT
257(50)
7-1 Introduction
257(1)
7-2 Registers
258(6)
7-3 Shift Registers
264(8)
7-4 Ripple Counters
272(5)
7-5 Synchronous Counters
277(8)
7-6 Timing Sequences
285(4)
7-7 Random-Access Memory (RAM)
289(4)
7-8 Memory Decoding
293(6)
7-9 Error-Correcting Codes
299(3)
References
302(1)
Problems
303(4)
8 ALGORITHMIC STATE MACHINES (ASM)
307(34)
8-1 Introduction
307(2)
8-2 ASM Chart
309(3)
8-3 Timing Considerations
312(5)
8-4 Control Implementation
317(6)
8-5 Design with Multiplexers
323(7)
8-6 PLA Control
330(6)
References
336(1)
Problems
337(4)
9 ASYNCHRONOUS SEQUENTIAL LOGIC
341(58)
9-1 Introduction
341(2)
9-2 Analysis Procedure
343(9)
9-3 Circuits with Latches
352(7)
9-4 Design Procedure
359(7)
9-5 Reduction of State and Flow Tables
366(8)
9-6 Race-Free State Assignment
374(5)
9-7 Hazards
379(6)
9-8 Design Example
385(6)
References
391(1)
Problems
392(7)
10 DIGITAL INTEGRATED CIRCUITS
399(37)
10-1 Introduction
399(2)
10-2 Special Characteristics
401(5)
10-3 Bipolar-Transistor Characteristics
406(3)
10-4 RTL and DTL Circuits
409(3)
10-5 Transistor-Transistor Logic (TTL)
412(10)
10-6 Emmitter-Coupled Logic (ECL)
422(2)
10-7 Metal-Oxide Semiconductor (MOS)
424(3)
10-8 Complementary MOS (CMOS)
427(3)
10-9 CMOS Transmission Gate Circuits
430(3)
References
433(1)
Problems
434(2)
11 LABORATORY EXPERIMENTS
436(43)
11-0 Introduction to Experiments
436(5)
11-1 Binary and Decimal Numbers
441(3)
11-2 Digital Logic Gates
444(2)
11-3 Simplification of Boolean Functions
446(1)
11-4 Combinational Circuits
447(2)
11-5 Code Converters
449(2)
11-6 Design with Multiplexers
451(1)
11-7 Adders and Subtractors
452(3)
11-8 Flip-Flops
455(3)
11-9 Sequential Circuits
458(1)
11-10 Counters
459(2)
11-11 Shift Registers
461(3)
11-12 Serial Addition
464(1)
11-13 Memory Unit
465(2)
11-14 Lamp Handball
467(4)
11-15 Clock-Pulse Generator
471(2)
11-16 Parallel Adder
473(2)
11-17 Binary Multiplier
475(2)
11-18 Asynchronous Sequential Circuits
477(2)
12 STANDARD GRAPHIC SYMBOLS
479(20)
12-1 Rectangular-Shape Symbols
479(3)
12-2 Qualifying Symbols
482(2)
12-3 Dependency Notation
484(2)
12-4 Symbols for Combinational Elements
486(3)
12-5 Symbols for Flip-Flops
489(2)
12-6 Symbols for Registers
491(3)
12-7 Symbols for Counters
494(2)
12-8 Symbol for RAM
496(1)
References
497(1)
Problems
497(2)
APPENDIX: ANSWERS TO SELECTED PROBLEMS 499(13)
INDEX 512

Rewards Program

Write a Review