Transcription of CHAPTER 3 Boolean Algebra and Digital Logic
{{id}} {{{paragraph}}}
Example: marketing
CHAPTER 3 Boolean Algebra and Digital Logic
CMPS375 Class Notes (Chap03) Page 1 / 28 Dr. Kuo-pao Yang CHAPTER 3 Boolean Algebra and Digital Logic Introduction 137 Boolean Algebra 138 Boolean Expressions 139 Boolean Identities 140 Simplification of Boolean Expressions 142 Complements 144 Representing Boolean Functions 145 Logic Gates 147 Symbols for Logic Gates 147 Universal Gates 148 Multiple Input Gates 149 Digital Components 150 Digital Circuits and Their Relationship to Boolean Algebra 150 Integrated Circuits 151 Putting It All Together: From Problem Description to Circuit 153 Combinational Circuits 155 Basic Concepts 155 Examples of Typical Combinational Circuits 155 Sequential Circuits 162 Basic Concepts 163 Clocks 163 Flip-Flops 163 Finite State Machines 167 Examples of Sequential Circuits 173 An Application of Sequential Logic : Convolutional Coding and Viterbi Detection 178 Designing Circuits 184 CHAPTER Summary 185 Focus on Karnaugh Maps 199 Introduction 199 Description of Kmaps and Terminology 199
A Boolean operator can be completely described using a table that list inputs, all possible values for these inputs, and the resulting values of the operation. A truth table shows the relationship, in tabular form, between the input values and the result of a specific Boolean operator or function on the input variables.
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: