Appendix b digital logic
This presentation is the property of its rightful owner.
Sponsored Links
1 / 17

Appendix B: Digital Logic PowerPoint PPT Presentation


  • 111 Views
  • Uploaded on
  • Presentation posted in: General

Appendix B: Digital Logic. http://www.play-hookey.com/digital/. Boolean Algebra. Boolean Algebra Algebra of logic Devised by the English mathematician George Boole . Everything in the digital world is based on the binary number system. 0 = false = no  1 = true  = yes Digital Logic

Download Presentation

Appendix B: Digital Logic

An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript


Appendix b digital logic

Appendix B:Digital Logic

http://www.play-hookey.com/digital/


Boolean algebra

Boolean Algebra

  • Boolean Algebra

    • Algebra of logic

    • Devised by the English mathematician George Boole.

  • Everything in the digital world is based on the binary number system.

    0 = false = no 1 = true  = yes

  • Digital Logic

    • Using this two-valued logic system, every statement or condition must be either "true" or "false;"


Boolean algebra1

Boolean Algebra

  • Variables and Operations

    • Variables

      • A variable can take on the value 1(True) or 0(False).

    • Operations

      • Basic logical operations:

        • AND

        • OR

        • NOT

A AND B = A‧B

A OR B = A + B

NOT A = A

D = A +(B‧C)


Boolean operators

Boolean Operators

NOT AND OR

XOR NAND NOR


Key identities of boolean algebra

Key Identities of Boolean Algebra


Gates

Gates

See Page 704 (Figure B.1)

  • Functional Complete Sets:

    • AND, OR, NOT

    • AND, NOT

    • OR, NOT

    • NAND

    • NOR


The use of nand gates

The Use of NAND Gates


Implementation of boolean functions

Implementation of Boolean Functions

  • Sum-of-Products

    • Figure B.4 (page 688)

  • Product-of-Sums

    • Figure B.5 (page 689)


Simplified implementation

Simplified Implementation

Figure B.6 (Page 690)


Multiplexer

Multiplexer

4-to-1

MUX

D0

D1

D2

D3

F

S2 S1

Figure B.13 (Page 699)


Appendix b digital logic

S1

S2

D0

D1

F

D2

D3

4-to-1 Multiplexer


Decoder

B

A

00

01

10

11

2-to-4

Decoder

D0

D1

D2

D3

A

B

Decoder

N-to-2N

Decoder

N-bit

Inputs

2N

Outputs

Figure B.15 (Page 700)


Appendix b digital logic

2-to-4

Decoder/Demultiplexer


Half adder

Half Adder


Full adder

Full Adder

See Figure B.22


4 bit adder

4-bit Adder


  • Login