Introduction to Logic Design with CD / Edition 1

Introduction to Logic Design with CD / Edition 1

1.0 1
by Alan B. Marcovitz
     
 

Introduction to Logic Design is intended for a first course in logic design, taken by computer science, computer engineering, and electrical engineering students (most commonly in the sophomore year).Its special strengths are a clear presentation of fundamentals with an exceptional collection of examples, solved problems, and exercises. The text integrates laboratory… See more details below

Overview

Introduction to Logic Design is intended for a first course in logic design, taken by computer science, computer engineering, and electrical engineering students (most commonly in the sophomore year).Its special strengths are a clear presentation of fundamentals with an exceptional collection of examples, solved problems, and exercises. The text integrates laboratory experiences, both hardware and computer simulation, while not making them mandatory for following the main flow of the chapters. Design is emphasized throughout the text. Switching algebra is developed as a tool for analyzing and implementing digital systems. The book contains an excellent presentation of minimization of combinational circuits, including multiple output ones, using the Karnaugh map and iterated consensus. There are a number of examples of the design of larger systems, both combinational and sequential, using medium scale integrated circuits and programmable logic devices. Introduction to Logic Design will provide students with the sort of grounding that will give them a solid foundation for further study, whether it be in a computer science, computer engineering, or electrical engineering program.

Read More

Product Details

ISBN-13:
9780072504996
Publisher:
McGraw-Hill Companies, The
Publication date:
07/28/2001
Edition description:
Older Edition
Pages:
640
Product dimensions:
7.40(w) x 9.44(h) x 1.22(d)

Meet the Author

Table of Contents

Prefaceix
Chapter 1Introduction1
1.1A Brief Review of Number Systems3
1.1.1Octal and Hexadecimal6
1.1.2Binary Addition8
1.1.3Signed Numbers10
1.1.4Binary Subtraction13
1.1.5Binary Coded Decimal (BCD)15
1.2The Design Process for Combinational Systems16
1.3The Development of Truth Tables19
1.4Don't Care Conditions21
1.5The Laboratory23
1.6Solved Problems24
1.7Exercises33
Chapter 2Switching Algebra and Logic Circuits37
2.1Definition of Switching Algebra38
2.2Basic Properties of Switching Algebra41
2.3Manipulation of Algebraic Functions43
2.4Implementation of Functions with AND, OR, and NOT Gates48
2.5From the Truth Table to Algebraic Expressions51
2.6Introduction to the Karnaugh Map55
2.7The Complement and Product of Sums62
2.8NAND, NOR, and Exclusive-OR Gates65
2.9Simplification of Algebraic Expressions71
2.10Manipulation of Algebraic Functions and NAND Gate Implementations79
2.11A More General Boolean Algebra87
2.12Solved Problems89
2.13Exercises108
Chapter 3More Algorithmic Simplification Techniques115
3.1The Karnaugh Map116
3.1.1Minimum Sum of Product Expressions Using the Karnaugh Map119
3.1.2Don't Cares132
3.1.3Product of Sums136
3.1.4Minimum Cost Gate Implementations140
3.1.5Five- and Six-Variable Maps142
3.1.6Multiple Output Problems149
3.2An Algorithmic Minimization Technique160
3.2.1Iterated Consensus for One Output161
3.2.2Prime Implicant Tables for One Output164
3.2.3Iterated Consensus for Multiple Output Problems171
3.3Solved Problems178
3.4Exercises225
Chapter 4Solving Larger Problems231
4.1Delay in Combinational Logic Circuits232
4.2Adders233
4.3Decoders237
4.4Encoders and Priority Encoders243
4.5Multiplexers245
4.6Three-State Gates247
4.7Gate Arrays--ROMs, PLAs, and PALs248
4.7.1Designing with Read-Only Memories253
4.7.2Designing with Programmable Logic Arrays254
4.7.3Designing with Programmable Array Logic257
4.8Larger Examples260
4.8.1Seven-Segment Displays (First Major Example)261
4.8.2An Error Coding and Decoding System (Second Major Example)268
4.9Solved Problems275
4.10Exercises307
Chapter 5Sequential Systems323
5.1Latches and Flip Flops327
5.2The Design Process for Synchronous Sequential Systems336
5.3Analysis of Sequential Systems342
5.4Flip Flop Design Techniques350
5.5The Design of Synchronous Counters366
5.6Design of Asynchronous Counters376
5.7Derivation of State Tables and State Diagrams378
5.8Solved Problems393
5.9Exercises423
Chapter 6Solving Larger Sequential Problems439
6.1Shift Registers439
6.2Counters445
6.3Programmable Logic Devices (PLDs)453
6.4Design Using ASM Diagrams458
6.5Hardware Design Languages461
6.6More Complex Examples465
6.7Solved Problems471
6.8Exercises481
Chapter 7Simplification of Sequential Circuits487
7.1A Tabular Method for State Reduction489
7.2Partitions496
7.2.1Properties of Partitions499
7.2.2Finding SP Partitions500
7.3State Reduction Using Partitions503
7.4Choosing a State Assignment508
7.5Solved Problems514
7.6Exercises530
Appendix ALaboratory Experiments535
A.1Hardware Logic Lab535
A.2WinBreadboard and MacBreadboard539
A.3Introduction to Logic Works 4541
A.4Introduction to Altera Max+plusII546
A.5A Set of Logic Design Experiments550
A.5.1Experiments Based on Chapter 2 Material550
A.5.2Experiments Based on Chapter 4 Material551
A.5.3Experiments Based on Chapter 5 Material553
A.5.4Experiments Based on Chapter 6 Material557
A.6Layout of Chips Referenced in the Text and Experiments559
Index563

Read More

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >