书籍详情
逻辑设计基础:英文本
作者:( )Alan B.Marcovitz著
出版社:清华大学出版社
出版时间:2002-01-01
ISBN:9787302057178
定价:¥50.00
购买这本书可以去
内容简介
(逻辑设计基础)Alan B.Marcovitz 编著本书系统地介绍了数字逻辑和数字电路的基础知识、电路的分析与设计方法以及典型应用。全书共分7章,内容涉及开关代数与逻辑电路、组合逻辑与时序逻辑电路的分析与设计方法,并结合了可编程器件PLA和PLA的实现技术。用专门章节引用大量的例题和综合练习是本书的一大特点。书后附录中还设计了多个实验,这些对于培养学生的独立工作能力和动手能力是非常有帮助的。
作者简介
暂缺《逻辑设计基础:英文本》作者简介
目录
Preface ix
Chapter 1
Introduction
1.1 A Brief Review of Number Systems
1.1.1 Octal and Hexadecimal
1.1.2 Binary Addition
1.1.3 Signed Numbers
1.1.4 Binary Subtraction
1.1.5 Binary Coded Decimal(BCD)
1.2 The Design Process for Combinational Systems
1.3 The Development of Truth Tables
1.4 Don't Care Conditions
1.5 The Laboratory
1.6 Solved Problems
1.7 Exercises
Chapter 2
Switching Algebra and Logic Circults
2.1 Definition of Switching Algebra
2.2 Basic Properties of Switching Algebra
2.3 Manipulation of Algebraic Functions
2.4 Implementation of Functions with AND,OR, and NOT Gates
2.5 From the Truth Table to Algebraic Expressions
2.6 Introduction to the Karnaugh Map
2.7 The Complement and Product of Sums
2.8 NAND,NOR,and Exclusive-OR Gates
2.9 Simplification of Algebraic Expressions
2.10 Manipulation of Algebraic Functions and NAND Gate Implementations
2.11 A More General Boolean Algebra
2.12 Solved Problems
2.13 Exersises
Chapter 3
More Algorithmic Simplification Techniques
3.1 The Karnaugh Map
3.1.1 Minimum Sum of Product Expressions Using the Karnaugh Map
3.1.2 Don't Cares
3.1.3 Product of Sums
3.1.4 Minimum Cost Gate Implementations
3.1.5 Five-and Six-Variable Maps
3.1.6 Multiple Output Problems
3.2 An Algorithmic Minimization Technique
3.2.1 Iterated Consensus for One Output
3.2.2 Prime Implicant Tables for One Output
3.2.3 Iterated Consensus for Multiple Output Problems
3.3 Solved Problems
3.4 Exercises
Chapter 4
Solving Larger Problems
4.1 Delay in Combinational Logic Circuits
4.2 Adders
4.3 Decoders
4.4 Encoders and Priority Encoders
4.5 Multiplexers
4.6 Three-State Gates
4.7 Gate Arrays-ROMs,PLAs,and PALs
4.7.1 Designing with Read-Only Memories
4.7.2 Designing with Programmable Logic Arrays
4.7.3 Designing with Programmable Array Logic
4.8 Larger Examples
4.8.1 Seven-Segment Displays(First Major Example)
4.8.2 An Error Coding and Decoding System(Second Major Example)
4.9 Solved Problems
4.10 Exercises
Chapter 5
Sequential Systems
5.1 Latches and Flip Flops
5.2 The Design Process for Synchronous Sequential Systems
5.3 Analysis of Sequential Systems
5.4 Flip Flop Design Techniques
5.5 The Design of Synchronous Counters
5.6 Design of Asynchronous Counters
5.7 Derivation of State Tables and State Diagrams
5.8 Solved Problems
5.9 Exercises
Chapter 6
Solving Larger Sequential Problems
6.1 Shift Registers
6.2 Counters
6.3 Programable Logic Devices(PLDs)
6.4 Design Using ASM Diagrams
6.5 Hardware Design Languages
6.6 More Complex Examples
6.7 Solved Problems
6.8 Exercises
Chapter 7
Simplification of Sequential Circuits
7.1 A Tabular Method for State Reduction
7.2 Partitions
7.2.1 Properties of Partitions
7.2.2 Finding SP Partitions
7.3 State Reduction Using Partitions
7.4 Choosing a State Assignment
7.5 Solved Problems
7.6 Exercises
Appendix A
Laboratory Experiments
A.1 Hardware Logic Lab
A.2 WinBreadboard TM and MacBreadboard TM
A.3 Introductio to LogicWorks 4
A.4 Introductin to Altera Max+plusII
A.5 A Set of Logic Design Experiments
A.5.1 Experiments Based on Chapter2 Material
A.5.2 Experiments Based on Chapter4 Material
A.5.3 Experiments Based on Chapter5 Material
A.5.4 Experiments Based on Chapter6 Material
A.6 Layout of Chips Referenced in the Text and Experiments
Index
Chapter 1
Introduction
1.1 A Brief Review of Number Systems
1.1.1 Octal and Hexadecimal
1.1.2 Binary Addition
1.1.3 Signed Numbers
1.1.4 Binary Subtraction
1.1.5 Binary Coded Decimal(BCD)
1.2 The Design Process for Combinational Systems
1.3 The Development of Truth Tables
1.4 Don't Care Conditions
1.5 The Laboratory
1.6 Solved Problems
1.7 Exercises
Chapter 2
Switching Algebra and Logic Circults
2.1 Definition of Switching Algebra
2.2 Basic Properties of Switching Algebra
2.3 Manipulation of Algebraic Functions
2.4 Implementation of Functions with AND,OR, and NOT Gates
2.5 From the Truth Table to Algebraic Expressions
2.6 Introduction to the Karnaugh Map
2.7 The Complement and Product of Sums
2.8 NAND,NOR,and Exclusive-OR Gates
2.9 Simplification of Algebraic Expressions
2.10 Manipulation of Algebraic Functions and NAND Gate Implementations
2.11 A More General Boolean Algebra
2.12 Solved Problems
2.13 Exersises
Chapter 3
More Algorithmic Simplification Techniques
3.1 The Karnaugh Map
3.1.1 Minimum Sum of Product Expressions Using the Karnaugh Map
3.1.2 Don't Cares
3.1.3 Product of Sums
3.1.4 Minimum Cost Gate Implementations
3.1.5 Five-and Six-Variable Maps
3.1.6 Multiple Output Problems
3.2 An Algorithmic Minimization Technique
3.2.1 Iterated Consensus for One Output
3.2.2 Prime Implicant Tables for One Output
3.2.3 Iterated Consensus for Multiple Output Problems
3.3 Solved Problems
3.4 Exercises
Chapter 4
Solving Larger Problems
4.1 Delay in Combinational Logic Circuits
4.2 Adders
4.3 Decoders
4.4 Encoders and Priority Encoders
4.5 Multiplexers
4.6 Three-State Gates
4.7 Gate Arrays-ROMs,PLAs,and PALs
4.7.1 Designing with Read-Only Memories
4.7.2 Designing with Programmable Logic Arrays
4.7.3 Designing with Programmable Array Logic
4.8 Larger Examples
4.8.1 Seven-Segment Displays(First Major Example)
4.8.2 An Error Coding and Decoding System(Second Major Example)
4.9 Solved Problems
4.10 Exercises
Chapter 5
Sequential Systems
5.1 Latches and Flip Flops
5.2 The Design Process for Synchronous Sequential Systems
5.3 Analysis of Sequential Systems
5.4 Flip Flop Design Techniques
5.5 The Design of Synchronous Counters
5.6 Design of Asynchronous Counters
5.7 Derivation of State Tables and State Diagrams
5.8 Solved Problems
5.9 Exercises
Chapter 6
Solving Larger Sequential Problems
6.1 Shift Registers
6.2 Counters
6.3 Programable Logic Devices(PLDs)
6.4 Design Using ASM Diagrams
6.5 Hardware Design Languages
6.6 More Complex Examples
6.7 Solved Problems
6.8 Exercises
Chapter 7
Simplification of Sequential Circuits
7.1 A Tabular Method for State Reduction
7.2 Partitions
7.2.1 Properties of Partitions
7.2.2 Finding SP Partitions
7.3 State Reduction Using Partitions
7.4 Choosing a State Assignment
7.5 Solved Problems
7.6 Exercises
Appendix A
Laboratory Experiments
A.1 Hardware Logic Lab
A.2 WinBreadboard TM and MacBreadboard TM
A.3 Introductio to LogicWorks 4
A.4 Introductin to Altera Max+plusII
A.5 A Set of Logic Design Experiments
A.5.1 Experiments Based on Chapter2 Material
A.5.2 Experiments Based on Chapter4 Material
A.5.3 Experiments Based on Chapter5 Material
A.5.4 Experiments Based on Chapter6 Material
A.6 Layout of Chips Referenced in the Text and Experiments
Index
猜您喜欢