注冊(cè) | 登錄讀書好,好讀書,讀好書!
讀書網(wǎng)-DuShu.com
當(dāng)前位置: 首頁(yè)出版圖書科學(xué)技術(shù)計(jì)算機(jī)/網(wǎng)絡(luò)計(jì)算機(jī)組織與體系結(jié)構(gòu)邏輯設(shè)計(jì)基礎(chǔ):英文版

邏輯設(shè)計(jì)基礎(chǔ):英文版

邏輯設(shè)計(jì)基礎(chǔ):英文版

定 價(jià):¥68.00

作 者: (美)Charles H.Roth,Jr.著
出版社: 機(jī)械工業(yè)出版社
叢編項(xiàng): 經(jīng)典原版書庫(kù)
標(biāo) 簽: 嵌入式計(jì)算機(jī)

ISBN: 9787111123514 出版時(shí)間: 2003-10-01 包裝: 平裝
開(kāi)本: 24cm+光盤1片 頁(yè)數(shù): 687 字?jǐn)?shù):  

內(nèi)容簡(jiǎn)介

  本書詳細(xì)地闡述了理解邏輯設(shè)計(jì)基本概念所必需的理論,同時(shí)又不過(guò)多地討論開(kāi)關(guān)理論的數(shù)學(xué)證明。全書共分20個(gè)單元,包括布爾代數(shù)。邏輯門設(shè)計(jì)、觸發(fā)器、狀態(tài)機(jī)等基本概念。通過(guò)將觸發(fā)器和邏輯門網(wǎng)絡(luò)相結(jié)合,學(xué)生將學(xué)會(huì)如何設(shè)計(jì)計(jì)數(shù)器、加法器、序列檢測(cè)器和簡(jiǎn)單的數(shù)字系統(tǒng)。在介紹完這些基礎(chǔ)概念之后,本書使用可編程邏輯設(shè)備和VHDL硬件描述語(yǔ)言介紹了現(xiàn)代的設(shè)計(jì)技術(shù)。本書全面介紹了數(shù)字系統(tǒng)邏輯設(shè)計(jì)的基本概念,在理論和實(shí)踐之間做到了很好的平衡??捎米鲭娮庸こ毯陀?jì)算機(jī)系學(xué)生學(xué)習(xí)數(shù)字系統(tǒng)邏輯設(shè)計(jì)的入門教材,并為學(xué)生進(jìn)一步學(xué)習(xí)數(shù)字系統(tǒng)設(shè)計(jì)和開(kāi)關(guān)理論的高級(jí)知識(shí)奠定了基礎(chǔ),同時(shí)本書也是理想的自學(xué)教材。特點(diǎn):●開(kāi)關(guān)電路的基本理論及其應(yīng)用?!衩空碌拈_(kāi)始都有學(xué)習(xí)指南,包括指定閱讀部分和需要學(xué)習(xí)的問(wèn)題。每章最開(kāi)始出現(xiàn)的學(xué)習(xí)目標(biāo)精確地指出學(xué)生將會(huì)從本學(xué)習(xí)單元學(xué)到什么知識(shí)?!癜M或?qū)嶒?yàn)室的練習(xí),為學(xué)生提供機(jī)會(huì)去設(shè)計(jì)邏輯電路并隨后在運(yùn)行中進(jìn)行測(cè)試?!耠S書附帶的光盤中有三個(gè)對(duì)于計(jì)算機(jī)輔助設(shè)計(jì)和數(shù)字邏輯模擬非常有用的程序:LogicAid、SimUaid和DirectVHDL-PE。作者簡(jiǎn)介:CharlesH.Roth,Jr.分別在明尼蘇達(dá)大學(xué)、麻省理工學(xué)院和斯坦福大學(xué)的電子工程系獲得學(xué)士、碩士和博士學(xué)位,并于1961年加入得克薩斯大學(xué)奧斯汀分校任教,目前他是該校電子和計(jì)算機(jī)工程系的教授。他在邏輯設(shè)計(jì)的教學(xué)中開(kāi)發(fā)了一種自定學(xué)習(xí)進(jìn)度的教程,因其杰出的工程教學(xué)效果而獲得GeneralDynamics獎(jiǎng)。他的教學(xué)和研究領(lǐng)域包括:數(shù)字系統(tǒng)理論和設(shè)計(jì)、微計(jì)算機(jī)系統(tǒng)、VHDL應(yīng)用等。

作者簡(jiǎn)介

  CharlesH.Roth,Jr.分別是明尼蘇達(dá)大學(xué)、麻省理工學(xué)院和斯坦福大學(xué)的電子工程系獲得學(xué)士、碩士和學(xué)位,并于1961年加入得克薩斯大學(xué)奧斯汀分校任教,目前他是該校電子和計(jì)算機(jī)工程系的教授。他在邏輯設(shè)計(jì)的教學(xué)中開(kāi)發(fā)了一種自定學(xué)習(xí)進(jìn)度的教程,因其杰出的工程教學(xué)效果而獲得GeneralDynamics獎(jiǎng)。他的教學(xué)和研究領(lǐng)域包括:數(shù)字系統(tǒng)理論和設(shè)計(jì)、微計(jì)算機(jī)系統(tǒng)、VHDL應(yīng)用等。

圖書目錄

Brief Contents
1 Introduction
  Number Systems and Conversion
2 Boolean Algebra
3 Boolean Algebra(Continued)
4 Applications of Boolean Algebra
  Minterm and Maxterm Expansions
5 Karnaugh Maps
6 Quine-McCluskey Methce
7 Multi-Level Gate Circuits
  NAND and NOR Gates
8 Combinational Circuit Design and Simulation Using Gates
9 Multiplexers,Declders,and Programmable
  Logic Devices
10 Introduction to VHDL
11 Latches and Flip-Flops
12 Registers and Counters
13 Analysis of Clocded Sequential Circuits
14 Derivation of State Graphs and Tables
15 Reduction of State Table
   State Assignment
16 Sequential Circuit Design
17 VHDL for Sequential Logic
18 Circrits for Arithmetic Operations
19 State Machine Desingn with SM Charts
20 VHDL for Digital System Design
A Appendices
Contents
Preface
How to Use This Book for Self-Study
1 Introduxtion
  Number Systems and Conversion
Objectives
Study Guide
1.1 Digital Systems and Switching Circuits
1.2 Number Systems and Conversion
1.3 Binary Arithmetic
1.4 Representation of Negative Numbers
    Addition of 2's Complement Numbers
    Addition fo 1's Complement Numbers    
1.5 Binary Codes
    Problems
2 Boolean Algebra
Objectives
Study Guide
2.1 Introduction
2.2 Basic Operations
2.3 Boolean Expressions and Truth Tables
2.4 Basic Theorems
2.5 Commutative,Associative,and Distributive Laws
2.6 Simplification Theouems
2.7 Multiplying Out and Factouing
2.8 DeMorgan's Laws
    Problems
    Laws and Theorems of Boolean Algebra
3 Boolean Algebra (Continued)
Objective
Study Guide
3.1 Multiplying Out and Factoring Expressions
3.2 Exclusive-OR and Factoring Expressions
3.3 The Consensus Theorem
3.4 Algebraic Simplification of Switching Wxpressions
3.5 Proving the Validity of an Equation
    Programmed Exercises
    Problems
4 Applications of Boolean Algebra
  Minterm and Maxterm Expansions
Objectives
Study Guide
4.1 Conversion of English Sentencse to Boolean Equations
4.2 Combinational Logic Design Using a Truth Table
4.3 Mimterm and Maxterm Expansions
4.4 General Minterm and Maxterm Expansions
4.5 Incompletely Specified Functions
4.6 Examples of Truth Table Construction
4.7 Design of Binary Adders and Subtracters
    Problems
5 Karnaugh Maps
Objectives
Study Guide
5.1 Minimum Forms of Switching Functions
5.2 Two-and Three-Variable Karnaugh Maps
5.3 Four-Variable Karanugh Maps
5.4 Determination of Minimum Expressions
    Using Essential Prime Implicants
5.5 Five-Varable Karnaugh Maps
5.6 Other Used of Karnaugh Maps
5.7 Other Forms of Karnaugh Maps
    Programmed Exercises
    Problems
6 Quine-McCluskey Method
Objectives
Study Guide
6.1 Determination of Prime Implicants
6.2 The Prime Implicant Chart
6.3 Petrick's Method
6.4 Simplification of Incompletely Specified Functions
6.5 Simplification Using Map-Entered Variableds
6.6 Conclusion
    Programmde Exercise
    Problems
7 Multi-Level Gate CirCuits
  NAND and NOR Gates
Objectives
Study Guide
7.1 Multi-Level Gate Circuits
7.2 NAND and NOR Gates
7.3 Design of Two-Level Circrits Using NAND and NOR Gates
7.4 Design of Multi-Level NAND and NOR Gate Circuits
7.5 Circuit Conversion Using Alternative Gate Symbols
7.6 Delign of Two-Level,Multiple-Ortput Circuits
    Determination of Essential Prime Implicants for
    Multiple-Output Realization
7.7 Multiple-Output NAND and NRO Circuits
8 Combinational Circuit Design
  and Simulation Using Gates
Objectives
Study Guide
8.1 Review of Combinational Circuit Design
8.2 Design of Corcuits with Limited Gate Fan-In
8.3 Gate Delays and Timing Diagrams
8.4 Hazards in Combinational Logic
8.5 Simultion and Testion of Logic Circuits
    Problems
    Design Problems
9 Multiplexers,Declders,and Programmable
  Logic Devices
Objectives
Study Guide
9.1 Introduction
9.2 Multiplexers
9.3 Three-State Buffers
9.4 Decoders and Encoders
9.5 Read-Only Memories
9.6 Programmable Logic Devices
    Programmable Logic Arrays
    Programmable Array Logic
9.7 Complex Programmable Logic Devices
9.8 Field Programmable Gate Arrays
    Decomposition of Switching Fumctions
    Problems
10  Introduction to VHDL
Objetives
Study Guide
10.1 VHDL Description of Combinational Circuits
10.2 VHDL Models for Multplexers
10.3 VHDL Modules
     Four-Bit Full Adder
10.4 Signals and Constants
10.5 Arrays
10.6 VHDL Operators
10.7 Packages and Libraries
10.8 IEEE Stanedard Logic
10.9 Compilation and Simulation  of VHDL Code
     Problems
11 Latches and Flip-Flops
Objectives
Study Guide
11.1 Introduction
11.2 Set-Reset Latch
11.3 Gated D Latch
11.4 Edge-Triggerde D Flip-Flop
11.5 S-R FLIP-Flop
11.6 J-K Flip-Flop
11.7 T Flip-Flop
11.8 Flip-Flops with Additional Inputs
11.9 Summary
     Prlblems
     Programmde Exercise
12 Registers and Counters
Objectives
Study Guide
12.1 Registers and Register Transfers
     Parallel Adder with Accumulator
12.2 Shift Registers
12.3 Design of Binary Counters
12.4 Counters for Other Sequences
     Counters Design Using D Flip-Flops
12.5 Counter Design Using S-R and J-K Filp-Flops
12.6 Derivation of Flip-Flop Input Equations-Summary
     Problems
13 Analysis of Clocked Sequential Circuits
Objectives
Study Guide
13.1 A Sequential Parety Checker
13.2 Analysis by Signal Tracing and Timing Charts
13.3 State Tables and Graphs
     Construction and Interpretation of Timing Charts
13.4 General Models for Sequential Circuits
     Programmed Exercise
     Problems
14 Derivation of State Graphs and Tables
Objebtives
Study Guide
14.1 Design of a Sequence Detector
14.2 More Complex Design Problems
14.3 Guidelines rlf Comstruction of State  Graphs
14.4 Serial Data Code Conversion
14.5 Alphanumeric State Graph Notation
     Programmed Exercises
     Probleml
15 Reduction of State Tables
   State Assignment
Objectives
Study Guide
15.1 Elimination of Redundant States
15.2 Equivalent States
15.3 Determination of State Equivalence Using an Implication Table
15.4 Equivalent Sequential Circuits
15.5 Incmpletely Specified State Tables
15.6 Derivation  of Flip-Folp Input Equations
15.7 Equivalent State Assignments
15.8 Guidelines for State Assignment
15.9 Using a One-Hot State Assignment
     Problems
16 Sequential Circuit Design
Objectives
Study Guide
16.1 Summary of Design Procedure for Sequential Circuits
16.2 Design Example-Code Converter
16.3 Design of Iterative Circuits
     Design of a  Comparator
16.4 Design of Sequential Circuits Using ROMs and PLAs
16.5 Sequential Circuit Design Using CPLDs
16.6 Sequential Circuit Design Using FPGAs
16.7 Simulation and Testing of Sequrential Circuits
16.8 Overview of Computer-Aided Design
     Design Problems
     Additional Problems
17 VHDL for Sequential Logic
Objectives
Study Guide
17.1 Modeling Flip-Flops Using VHDL Processes
17.2 Modeling Registers and Counters Using VHDL Processes
17.3 Modeling Combinational Logic Using VHDL Processes
17.4 Modeling a Sequential Machine
17.5 Synthesis of VHDL Code
17.6 More about Processes and Sequential Statements
     Problems
     Simulation Prlblems
18 Circuits for Arithmetic Operations
Objectives
Study Guide
18.1 Serial Adder with Accumulator
18.2 Design of a Parallel Multiplier
18.3 Design of a Binary Divider
     Programmed Exercises
     Prlblems
19 State Machine Design with SM Charts
Objectives
Study Guide
19.1 State Machine Charts
19.2 Derivation of SM Charts
19.3 Realization of SM Charts
     Problems
20 VHDL for Digital System Design
Objectives
Study  Guide
20.1 VHDL Code for a Serial Adder
20.2 VHDL Code for a Binary Multiplier
20.3 VHDL Code for a Binary Divider
20.4 VHDL Code for a Dice Game Simulator
20.5 Concluding Remarks
     Problems
     Lab Design Problems
A Appendices
A MOS and COMS Logic
B VHDL Language Summary
C Proofs of Theorems
References
Answers to Selected Study Guide
Questions and Problems
Index

本目錄推薦

掃描二維碼
Copyright ? 讀書網(wǎng) m.ranfinancial.com 2005-2020, All Rights Reserved.
鄂ICP備15019699號(hào) 鄂公網(wǎng)安備 42010302001612號(hào)