Computer circuit logic

  • 6,213 views
Uploaded on

Computer circuit logic and Boolean logic include basic logic gate (AND,OR,NOT,NAND,NOR) and some examples.

Computer circuit logic and Boolean logic include basic logic gate (AND,OR,NOT,NAND,NOR) and some examples.

More in: Technology
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Be the first to comment
No Downloads

Views

Total Views
6,213
On Slideshare
0
From Embeds
0
Number of Embeds
1

Actions

Shares
Downloads
0
Comments
0
Likes
10

Embeds 0

No embeds

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
    No notes for slide

Transcript

  • 1. Computer Circuit Logic GateWith Boolean Logic
    Yinong Wang
    Youngik Song
    April 18th 2011
  • 2. Table of Contents
    Introduction
    History of Logic Gate and Boolean Logic
    Basic Logic Gate
    Inverting Logic Gate
    Application of Logic Gate
    Boolean Algebra Rules
    Boolean Example
    Actual Products of Logic Gates
    Summary and Conclusion
    References
  • 3. Introduction
    All digital equipment is constructed using a few basic circuit.
    The basic logic element is called a gate.
    All logic gate has input and output.
    High - ON – 1 Low - OFF – 0
    The gate looks at its input and based on their state and its operation.
    The gate generates the appropriate output reflecting the decision it has made.
    Boolean logic or Boolean algebra is a logical calculus which has only two value, ‘true’ or ‘false’.
  • 4. History of Logic Gate and Boolean Logic
    1847 – George Boole (1815-1864) published, ‘The Mathematical Analysis of Logic’.
    1898 – Nikola Tesla filed for patents of devices containing logic gate circuits. Vacuum tubes replaced relays for logic operations.
    1907 – Lee De Forest’s modification of the Fleming valve can be used as AND logic gate.
    1924 – Walther Bothe invented the first modern electronic AND gate.
    1937 – Claude E. Shannon introduced the use of Boolean algebra in the analysis and design of switching circuit.
  • 5. Basic Logic Gates
    • AND GATE
    It has two or more input and a single output.
    Boolean Logic
    Y = AB or Y = A·B
    Logic Symbol
    Series Circuit
    Truth Table
    Electronic Circuit
  • 6. Basic logic gates
    • OR GATE
    It has two or more input and a single output.
    Boolean Logic
    Y = A + B
    Logic Symbol
    Parallel Circuit
    Truth Table
    Electronic Circuit
  • 7. Inverting logic gates
    • NOT GATE
    It is the simplest logic gate. It has only one
    input and one output.
    Logic Symbol
    Boolean Logic
    A = Ā
    Truth Table
    Electronic Circuit
  • 8. Inverting logic gates
    • NAND GATE
    It is a combination of NOT gate and AND gate
    Y
    Boolean Logic
    Y = AB or Y = A·B
    Truth Table
    Logic Symbol
  • 9. Inverting logic gates
    • NOR GATE
    It is a combination of NOT gate and OR gate
    Y
    Boolean Logic
    Y = A + B
    Y
    Truth Table
    Logic Symbol
  • 10. Application of Logic Gate
    • XOR (Exclusive OR) GATE
    When the inputs are opposite, the output is a HIGH.
    Y
    Boolean Logic
    Y = AB + AB
    Truth Table
    Y
    Boolean Logic
    Y = A + B
    Logic Symbol
  • 11. Application of Logic Gate
    • XNOR (Exclusive NOR) GATE
    When the inputs are opposite, the output is a LOW.
    Y
    Boolean Logic
    Y = AB + AB
    Truth Table
    Y
    Boolean Logic
    Y = A + B
    Logic Symbol
  • 12. Application of Logic Gate
    • DECODER
    A decoder is a circuit that looks at its inputs and determines which binary number is represented by this input
    Truth Table
  • 13. Application of Logic Gate
    • ENCODER
    Encoders are opposite of decoder. An encoder takes one input and generates a multi-bit output code.
    Truth Table
  • 14. Application of Logic Gate
    • Flip Flop
    The flip-flop is the basic element for a memory circuit.
    It is comprised of an assembly of logic gates to permit information to be stored.
  • 15. Boolean Algebra Rules
    • Commutative law
    A+B=B+A
    A·B=B·A
    • Associative law
    A+(B+C)=(A+B)+C
    • Distributive law
    A·(B+C)=(A·B)+(A·C)
    • Double-Inversion Rule
    A = A
  • 16. Boolean Algebra Rules
    • OR Gate Rules
    A+0=A A+A=A
    A+1=1 A+Ā=1
    • AND Gate Rules
    A·0=0 A·1= A
    A·A=A A·Ā=0
    • DeMorgan’s Theorems
    A·B= A+B A + B = A·B
  • 17. Boolean Example
  • 18. Boolean Example
  • 19. Boolean Example
  • 20. Actual Products of Logic Gate
  • 21. Summary and Conclusion
    • All digital equipment is constructed using a few logic gate.
    • 22. The basic logic gates are AND, OR, NOT gate.
    • 23. Combination logic gates are NAND, NOR, XOR, XNOR gate.
    • 24. Using logic gate can be made an affordable circuits such as an encoder, a decoder, memory circuits.
    • 25. Boolean algebra can be determined logic gates and simplified them, so this logic is an important tool used in many of digital circuit.
  • References
    • History of logic gate.
    http://en.wikipedia.org/wiki/Logic_gate#History_and_development
    • History of Boolean logic and rules
    http://www.buzzle.com/articles/boolean-origination-history-and-origin-of-boolean-logic.html
    • Logic gates introduction and examples
    The website of Mario Ulcar -> Tutorials-> Digital
    http://faculty.georgebrown.ca/~mulcar/
  • 26. Thank you for watching our presentationAny questions ?