基本信息
- 原书名:Introduction to Logic Design
- 原出版社: Mcgraw-Hill
- 作者: Alan B.Marcovitz
- 丛书名: 大学计算机教育国外著名教材、教参系列(影印版)
- 出版社:清华大学出版社
- ISBN:7302057176
- 上架时间:2002-9-3
- 出版日期:2002 年8月
- 页码:584
- 版次:1-1
- 所属分类:数学 > 数理逻辑
教材 > 研究生/本科/专科教材 > 理学 > 数学
内容简介
目录
chapter 1 introduction
1.1 a brief review of number systems
1.1.1 octal and hexadecimal
l.1.2 binaryaddition
1.l.3 signednumbers
1.1.4 binary subtraction
1.1 .5 binary codeddecimal (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 circuits
2.l definition of switching algebra
2.2 basic properties of switching algebra
23 manipulation of algebraic functions
2.4 implementation of functions with and, or. and not gates
前言
The book sUesses fundamenMls. It teaches through a large number of examples. The philosophy of the author is that the only way to leam logic design is to do a large number of design pmblems. Thus. in addition to the numerous examples in the body of tke text, each chapter has a set of Solved Problems, that is, problems and their solutions. as well as a large set of Exercises. In addition, there are a set of laboratory experiments that tie the theory to the real world. The Appendix provides the background to do these experiments with a standard hardware laboratory (chips, switches, lights, and wires). a breadboard simulator (for the PC or Macintosh). and two schematic capture tools. The course can be taught without the laboratory, but the student will benefit significantly from the addition of 8-IO selected experiments.
Although computer-aided tools are widely used for tke design of large systems, the student mast first understand the basics. The basics provide more than enough material for a first course. Tbe schematic capture laboratory e)cercises and a section on Hardware Design Languages in Chapter 6 provide some material for a transition to a second course based on one of the computer-aided tool seB.
Chapter l gives a brief overview of number systems as it applies to the material of this book. (Those students who have studied this in an earlier coarse can skip to Section l.2.) It then discusses the steps in the design process for combinational systems and the development of truth tables.
Chapter 2 introduces switching algebra and the implementation of switching functions using common gates-AND, OR, NOT, NAND, NOR, and Exclusive-OR. We are only concemed with the logic behavior of the gates, not the electronic implementation.
Chapter 3 deals with two simplification techniques, the Kamaughmap and Iterated Consensus. It provides methods fQr solving problems(up to six variables with the map) with both single and nlaltiple outputs.
Chapter 4 is concemed with the design of larger combinational systems. It introduces a number of commercially available larger devices.inclnding adders, decoders, encoders and priority encoders, and multiplexers. That is followed by a discnssion of the use of logic aITaysROMs, PLAs, and PALs for the implementation of medium-scale combinational systems. Finally, two larger systems are designed.
Chapter 5 introduces sequential systems. It starts by examining thebehavior of latches and Hip Hops. The design process for sefluential systems is then presented. Before designing sequential systems, several systems are analyzed. The special case of counters is studied next. Finally.the solution of word problems, developing the state table or state diagram from a verbal description of the problem is presented in detail.
Chapter 6 looks at larger sequential systems. It sMrts by examiningthe design of shiR registers and counters. Then. PLDs ale presented. Twotechniques that are useful in the design of more complex systems, ASMdiagrams and HDLs. ale discussed next. Finally, two examples of lalger systems are presented.
Chapter 7 deals wiht state reduction and state assignment issues. First, a tabular approach for state reduction is presented. Then panitionsare atilized both for state reduction and for achieving a state assigllmentUtat will utilize less combinational logic.
A feature ofthis text is the Solved Problems. Each chapter has a largenumber of problems, illusuating the techniques developed in ale body ofthe text, followed by a detailed solution of each problem. StudenB areurged to solve each problem (without looking at dle answer) and thencompare their solution with the one shown.
Each chapter concludes with a large set of exercises. Solution toalese will be made available dlrough the Web.
Another unique feature of tke book is ale laboratory exercises, included in the Appendix. Four plaffmms ale presented.---a hardware based Logic Lab (using chips. wires, etc.); a haldware lab simulator that allows dte student to "connect" wiles on dle computer screen; and No circuit capture programs, LogicWorks IV and Altera Max+plus II. Enough information is provided about each to allow the student to perform a variety of experiments. A set of 25 laboratory exercises are presented. Several of these have options, to aHow the insuuctor to change the details bom one term to ale next.
We teach this material as a 4-credit course that includes an average of 3 l/2 hours per week of lecture, plus, typically, eight laboratory exercises. (The lab is unscheduled; it is manned by Graduate Assistants 40 hours per week; they grade the labs.) In that course we cover
Chapter I: all ofit
Chapter 2: all but 2.II
Chapter 3: all of 3.l
Chapter 4: all but 4.8. However, alere is a graded design pmblem based on that material (IO percent of the grade; students usually working in gmups of 2 or 3).
Chapter 5: all, though sometimes we skip 5.6
Chapter 6: 6.I, 6.2, and 6.3. We sometimes have a second project based on 6.6.