ScholarQuill logoScholarQuillUniversity Notes
  • Notes
  • Past Papers
  • Blogs
  • Todo
Login
ScholarQuill logoScholarQuillUniversity Notes
Login
NotesPast PapersBlogsTodo
More
SubjectsDiscussionCGPA CalculatorGPA CalculatorStudent PortalCourse Outline
About
About usPrivacy PolicyReportContact
Notes
Past Papers
Blogs
Todo
Analytics
    Current Subject
    🧩
    Digital Logic Design
    CC-110
    Progress0 / 63 topics
    Topics
    1. Introduction to Digital Systems2. Number Systems3. Introduction to Boolean Algebra4. Basic theorems and properties of Boolean Algebra5. Boolean Functions6. Logic Gates7. NAND and NOR Implementation8. Representation of Function in Sum of Minterms or Product of Maxterms9. Simplification of Boolean function using Karnaugh Map10. Don't care Conditions11. The Tabulation Method12. Introduction to Combinational Logic13. Design of Adders14. Design of Subtractors15. Code Convertors16. Analysis Procedure of Combinational Circuits17. Binary Parallel Adders18. Decimal Adders19. Magnitude Comparator20. Decoders and its applications21. Multiplexers22. Demultiplexers23. Encoders24. ROM25. Programmable Logic Array (PLA)26. Introduction to Sequential Circuits27. Basic Flip Flop28. Clocked RS Flip Flop29. Clocked D Flip Flop30. Clocked JK Flip Flop31. Clocked T Flip Flop32. Analysis of Clocked Sequential Circuits33. State Reduction and Assignment34. Flip Flop Excitation tables35. Design Procedure36. Design of Counters37. Design with State Equations38. Introduction to Registers39. Shift Registers40. Ripple Counters41. Synchronous Counters42. Timing Sequences43. Memory Unit44. Random Access Memory45. Introduction to Programmable Logic Devices (CPLD, FPGA)46. Lab Assignments using tools such as Verilog HDL/VHDL, MultiSim47. Familiarization with Digital Electronic Trainer48. Logic gates operations49. Half Adder Operation50. Full Adder Operation51. Half Subtractor Operation52. Full Subtractor Operation53. 7-Segment Display Operation54. Decoder Operation55. BCD To 7-Segment Display56. Multiplexer Operation57. Using Multiplexer and Demultiplexer/Decoder58. Multiplexing 7-Segment Displays59. Comparator Operations60. D Latch and Flip-Flop Operation61. Latching BCD Data for Displaying On 7-Segment Display62. JK Flip-Flop Operation63. Random Access Memories
    CC-110›Logic Gates
    Digital Logic DesignTopic 6 of 63

    Logic Gates

    6 minread
    937words
    Intermediatelevel

    Logic Gates

    Logic gates are the fundamental building blocks of digital circuits and digital systems. They are devices that perform basic logical operations on one or more binary inputs to produce a single binary output. The operations performed by these gates are based on Boolean algebra, and they are implemented using electronic components like transistors.

    Types of Logic Gates:

    1. AND Gate ( ∧ ):

      • The AND gate outputs 1 only if both of its inputs are 1. If either or both inputs are 0, the output is 0.
      • Symbol: A flat-ended shape with two inputs and one output.
      • Truth Table:
      A B A ∧ B
      0 0 0
      0 1 0
      1 0 0
      1 1 1
      • Example:
        • If A = 1 and B = 1, the output is 1 (A ∧ B = 1).
        • If A = 0 and B = 1, the output is 0 (A ∧ B = 0).
    2. OR Gate ( ∨ ):

      • The OR gate outputs 1 if at least one of its inputs is 1. It only outputs 0 if both inputs are 0.
      • Symbol: A curved-ended shape with two inputs and one output.
      • Truth Table:
      A B A ∨ B
      0 0 0
      0 1 1
      1 0 1
      1 1 1
      • Example:
        • If A = 0 and B = 1, the output is 1 (A ∨ B = 1).
        • If A = 1 and B = 1, the output is 1 (A ∨ B = 1).
    3. NOT Gate ( ¬ ):

      • The NOT gate, also called an inverter, outputs the inverse of the input. If the input is 1, the output is 0, and if the input is 0, the output is 1.
      • Symbol: A triangle with a small circle at the output end.
      • Truth Table:
      A ¬A
      0 1
      1 0
      • Example:
        • If A = 1, the output is 0 (¬A = 0).
        • If A = 0, the output is 1 (¬A = 1).
    4. NAND Gate ( ⊼ ):

      • The NAND gate is the negation of the AND gate. It outputs 0 only if both inputs are 1, and it outputs 1 for all other combinations of inputs.
      • Symbol: An AND gate symbol with a small circle (inversion) at the output.
      • Truth Table:
      A B A ⊼ B
      0 0 1
      0 1 1
      1 0 1
      1 1 0
      • Example:
        • If A = 1 and B = 1, the output is 0 (A ⊼ B = 0).
        • If A = 0 and B = 1, the output is 1 (A ⊼ B = 1).
    5. NOR Gate ( ⊽ ):

      • The NOR gate is the negation of the OR gate. It outputs 1 only when both inputs are 0, and outputs 0 for all other combinations of inputs.
      • Symbol: An OR gate symbol with a small circle (inversion) at the output.
      • Truth Table:
      A B A ⊽ B
      0 0 1
      0 1 0
      1 0 0
      1 1 0
      • Example:
        • If A = 0 and B = 0, the output is 1 (A ⊽ B = 1).
        • If A = 1 and B = 1, the output is 0 (A ⊽ B = 0).
    6. XOR Gate ( Exclusive OR ) ( ⊕ ):

      • The XOR gate outputs 1 when the inputs are different (i.e., one is 0 and the other is 1). It outputs 0 when both inputs are the same (both 0 or both 1).
      • Symbol: Similar to the OR gate, but with an additional curved line on the input side.
      • Truth Table:
      A B A ⊕ B
      0 0 0
      0 1 1
      1 0 1
      1 1 0
      • Example:
        • If A = 1 and B = 0, the output is 1 (A ⊕ B = 1).
        • If A = 1 and B = 1, the output is 0 (A ⊕ B = 0).
    7. XNOR Gate ( Exclusive NOR ) ( ⊙ ):

      • The XNOR gate is the negation of the XOR gate. It outputs 1 when the inputs are the same, and 0 when the inputs are different.
      • Symbol: Similar to the XOR gate but with a small circle (inversion) at the output.
      • Truth Table:
      A B A ⊙ B
      0 0 1
      0 1 0
      1 0 0
      1 1 1
      • Example:
        • If A = 0 and B = 0, the output is 1 (A ⊙ B = 1).
        • If A = 1 and B = 0, the output is 0 (A ⊙ B = 0).

    Summary of Logic Gate Functions:

    • AND Gate: Output is 1 only if both inputs are 1.
    • OR Gate: Output is 1 if at least one input is 1.
    • NOT Gate: Output is the complement of the input.
    • NAND Gate: Output is the complement of the AND gate (0 only when both inputs are 1).
    • NOR Gate: Output is the complement of the OR gate (1 only when both inputs are 0).
    • XOR Gate: Output is 1 if the inputs are different.
    • XNOR Gate: Output is 1 if the inputs are the same.

    Importance in Digital Systems:

    • These gates are used to build combinational circuits like adders, multiplexers, and encoders.
    • Sequential circuits like flip-flops and registers use logic gates in conjunction with memory elements to process information.
    • Logic gates enable the design of arithmetic operations, data storage, and signal processing in digital computers and electronic systems.
    Previous topic 5
    Boolean Functions
    Next topic 7
    NAND and NOR Implementation

    Past Papers

    Open this section to load past papers

    Click on Show Past Papers to see past papers.
    On This Page
      Reading Stats
      Est. reading time6 min
      Word count937
      Code examples0
      DifficultyIntermediate