CSE2341DigitalLogicCircuits.pptVIP

下载本文档

5
0
约3.03万字
约 100页
2016-01-05 发布于四川
举报
版权申诉

CSE2341DigitalLogicCircuits.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

CSE2341DigitalLogicCircuits.ppt

Chapter 2 Chapter 2Algebraic Methods for the Analysis and Synthesis of Logic Circuits Fundamentals of Boolean Algebra (1) Basic Postulates Postulate 1 (Definition): A Boolean algebra is a closed algebraic system containing a set K of two or more elements and the two operators · and +. Postulate 2 (Existence of 1 and 0 element): (a) a + 0 = a (identity for +), (b) a · 1 = a (identity for ·) Postulate 3 (Commutativity): (a) a + b = b + a, (b) a · b = b · a Postulate 4 (Associativity): (a) a + (b + c) = (a + b) + c (b) a· (b·c) = (a·b) ·c Postulate 5 (Distributivity): (a) a + (b·c) = (a + b) ·(a + c) (b) a· (b + c) = a·b + a·c Postulate 6 (Existence of complement): (a) (b) Normally · is omitted. Fundamentals of Boolean Algebra (2) Fundamental Theorems of Boolean Algebra Theorem 1 (Idempotency): (a) a + a = a (b) aa = a Theorem 2 (Null element): (a) a + 1 = 1 (b) a0 = 0 Theorem 3 (Involution) Properties of 0 and 1 elements (Table 2.1): OR AND Complement a + 0 = 0 a0 = 0 0 = 1 a + 1 = 1 a1 = a 1 = 0 Fundamentals of Boolean Algebra (3) Theorem 4 (Absorption) (a) a + ab = a (b) a(a + b) = a Examples: (X + Y) + (X + Y)Z = X + Y [T4(a)] AB(AB + BC) = AB [T4(b)] Theorem 5 (a) a + ab = a + b (b) a(a + b) = ab Examples: B + ABCD = B + ACD [T5(a)] (X + Y)((X + Y) + Z) = (X + Y)Z [T5(b)] Fundamentals of Boolean Algebra (4) Theorem 6 (a) ab + ab = a (b) (a + b)(a + b) = a Examples: ABC + ABC = AC [T6(a)] (W + X + Y + Z)(W + X + Y + Z)(W + X + Y + Z)(W + X + Y + Z) = (W + X + Y)(W + X + Y + Z)(W + X + Y + Z) [T6(b)] = (W + X + Y)(W + X + Y) [T6(b)] = (W + X) [T6(b)] Fundamentals of Boolean Algebra (5) Theorem 7 (a) ab + abc = ab + ac (b) (a + b)(a + b + c) = (a + b)(a + c) Examples: wy + wxy + wxyz + wxz = wy + wxy + wxy + wxz [T7(a)] = wy + wy + wxz [T7(a)] = w + wxz [T7(a)] = w [T7(a)] (xy + z)(w + xy + z) = (xy + z)(w + xy) [T7(b)] Fundamentals of Boolean Algebra (6) Theorem 8 (DeMorgans The