Muutke küpsiste eelistusi

Digital Logic for Computing 1st ed. 2017 [Kõva köide]

5.00/5 (2 hinnangut Goodreads-ist)
  • Formaat: Hardback, 319 pages, kõrgus x laius: 235x155 mm, kaal: 6269 g, 254 Illustrations, black and white; XVI, 319 p. 254 illus., 1 Hardback
  • Ilmumisaeg: 09-Jun-2017
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 331956837X
  • ISBN-13: 9783319568379
Teised raamatud teemal:
  • Kõva köide
  • Hind: 71,86 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 84,54 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
Digital Logic for Computing 1st ed. 2017Suurem pilt
  • Formaat: Hardback, 319 pages, kõrgus x laius: 235x155 mm, kaal: 6269 g, 254 Illustrations, black and white; XVI, 319 p. 254 illus., 1 Hardback
  • Ilmumisaeg: 09-Jun-2017
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 331956837X
  • ISBN-13: 9783319568379
Teised raamatud teemal:
Püsilink: https://www.kriso.ee/db/9783319568379.html
Märksõnad:
The book provides a bottom-up approach to understanding how a computer works and how to use computing to solve real-world problems. It covers the basics of digital logic through the lens of computer organization and programming. The reader should be able to design his or her own computer from the ground up at the end of the book. Logic simulation with Verilog is used throughout, assembly languages are introduced and discussed, and the fundamentals of computer architecture and embedded systems are touched upon, all in a cohesive design-driven framework suitable for class or self-study.

1 The Digital Electronic Computer.- 2 Boolean Algebra.- 3 Logic Function Synthesis.- 4 Basic Logic Function Minimization.- 5 Advanced Logic Function Minimization.- 6 Logic Gates.- 7 Unsigned Arithmetic.- 8 Signed Numbers.- 9 Other Digital Representations.- 10 Encoding Code.- 11 Sequential Logic Elements.- 12 Multiplexers and Comparators.- 13 Decoders and Register Files.- 14 Counters.- 15 Datapaths.- 16 Basic Computer Datapath.- 17 State Machines.- 18 Datapath Controllers.- 19 State Machine Theory and Optimization.- 20 Instruction Processor Design.
1 The Digital Electronic Computer
1(10)
Digital
2(3)
Electronic
5(2)
Computer
7(1)
Exercises
8(3)
2 Boolean Algebra
11(14)
Digital Logic Design Process
12(4)
The Mathematics of Boolean Algebra
16(3)
Exercises
19(6)
3 Logic Function Synthesis
25(12)
Normal Forms
26(1)
Minterms and Maxterms
27(1)
Don't Cares
28(1)
Day of the Week Detector
29(1)
Building a Normal Form
30(2)
Exercises
32(5)
4 Basic Logic Function Minimization
37(16)
Factoring the Sum of Products
37(2)
A Visual Aid to Factoring
39(5)
5- and 6-variable K-maps
44(2)
Working with the Product of Sums
46(2)
Exercises
48(5)
5 Advanced Logic Function Minimization
53(18)
Variable Entry K-maps
53(6)
Implicants and Implicates
59(2)
The Quine-McCluskey Algorithm
61(3)
Exercises
64(7)
6 Logic Gates
71(16)
Programmable Logic Arrays
71(2)
XOR, NAND, and NOR
73(2)
Bitwise Logic
75(1)
CMOS
76(3)
Electronic Properties of Gates
79(1)
Exercises
80(7)
7 Unsigned Arithmetic
87(18)
Unsigned Binary
87(3)
Full Adder
90(2)
High-Speed Adders
92(2)
Subtraction
94(1)
Multiplication
95(2)
Division
97(2)
Fractions
99(1)
Hexadecimal
99(2)
Exercises
101(4)
8 Signed Numbers
105(18)
Sign-Magnitude
105(2)
Two's Complement
107(4)
Building an Adder/Subtractor
111(1)
Sign Extension
112(2)
Signed Multiplication
114(2)
Ten's Complement
116(1)
Exercises
117(6)
9 Other Digital Representations
123(12)
Binary Coded Decimal
123(2)
Decimal Codes
125(1)
Gray Code
126(1)
Alphanumeric Codes
126(1)
Fixed Point Numbers
127(1)
Floating-Point Representations
128(3)
Designing an Encoding: Days of the Year
131(1)
Exercises
132(3)
10 Encoding Code
135(14)
Instructions and Datapaths
135(2)
Variables and Assignment
137(3)
Conditionals
140(2)
Loops
142(1)
Digital Representation of Instructions
143(1)
Hex Code
144(1)
Exercises
144(5)
11 Sequential Logic Elements
149(20)
The SR Latch
149(2)
Timing
151(3)
Building a Register
154(1)
Other Flip Flops: D, JK, and T
155(1)
The State Machine Design Process
156(4)
Exercises
160(9)
12 Multiplexers and Comparators
169(12)
Exercises
176(5)
13 Decoders and Register Files
181(14)
Register File Design
181(1)
Multi-port Register File
182(3)
Decoder Design
185(2)
Implementing Logic Functions with Decoders
187(2)
Encoders
189(3)
Exercises
192(3)
14 Counters
195(14)
Binary Counters
195(5)
Mod n Counters
200(1)
Unit-Distance Counter
201(2)
Ring Counters
203(2)
Exercises
205(4)
15 Datapaths
209(18)
Example: Guessing Game
209(3)
Example: Minimum Values
212(1)
Example: Detection Unit
213(2)
Algorithms
215(1)
Example: GCD Calculator
215(4)
Example: Fibonacci Sequence
219(1)
Exercises
220(7)
16 Basic Computer Datapath
227(18)
The Instruction Cycle
227(2)
The Fetch Stage
229(1)
The Decode Stage
230(1)
Register
231(1)
Immediate Addressing
232(1)
Direct Addressing
233(1)
Indirect Addressing
234(2)
Displacement Addressing
236(1)
The Execute Stage
237(2)
Exercises
239(6)
17 State Machines
245(20)
Sequence Detector
246(5)
Detecting Two Sequences
251(4)
Other Flip Flops for State Memory
255(1)
Exercises
255(10)
18 Datapath Controllers
265(24)
States and Algorithms
265(1)
Example: Greatest Common Divisor
266(5)
Example: Compute Factorial
271(3)
Example: Fibonacci Sequence
274(2)
Exercises
276(13)
19 State Machine Theory and Optimization
289(14)
Formal Languages
290(3)
State Reduction
293(4)
State Assignment
297(3)
Exercises
300(3)
20 Instruction Processor Design
303
What Is a Computer?
303(1)
Design an Instruction Set
304(6)
Data Movement Instructions
305(1)
Arithmetic and Logic Operations
306(1)
Program Control Instructions
307(2)
Instruction Format
309(1)
The Instruction Cycle
310(5)
Datapath Design
315(1)
Control Unit Design
316(1)
Exercises
317
John Seiffertt is an Assistant Professor of Computer Science at Truman State University in Kirksville, MO.  He previously taught in the Electrical and Computer Engineering department at the Missouri University of Science and Technology after receiving his PhD in Computer Engineering from that institution.  His research is in the areas of computational intelligence and agent-based modeling.  He has published work in IEEE Transactions journals, presented papers at international conferences, and is the author of "Unified Computational Intelligence for Complex Systems" (Springer, 2010).  With interests across the field, from embedded systems to Turing machines, he is an award-winning teacher committed to helping undergraduates grow in their understanding of advanced technology.