Back to 课程

Computer-science_A-level_Cie

0% Complete
0/0 Steps
  1. computers-and-components
    6 主题
  2. logic-gates-and-logic-circuits
    2 主题
  3. central-processing-unit-cpu-architecture
    6 主题
  4. assembly-language-
    4 主题
  5. bit-manipulation
    1 主题
  6. operating-systems
    3 主题
  7. language-translators
    2 主题
  8. data-security
    3 主题
  9. data-integrity
    1 主题
  10. ethics-and-ownership
    3 主题
  11. database-concepts
    3 主题
  12. database-management-systems-dbms-
    1 主题
  13. data-definition-language-ddl-and-data-manipulation-language-dml
    1 主题
  14. computational-thinking-skills
    1 主题
  15. algorithms
    14 主题
  16. data-types-and-records
    2 主题
  17. arrays
    2 主题
  18. files
    1 主题
  19. introduction-to-abstract-data-types-adt
    1 主题
  20. programming-basics
    1 主题
  21. constructs
    2 主题
  22. structured-programming
    1 主题
  23. program-development-life-cycle
    2 主题
  24. program-design-
    2 主题
  25. program-testing-and-maintenance
    3 主题
  26. user-defined-data-types
    1 主题
  27. file-organisation-and-access-
    3 主题
  28. floating-point-numbers-representation-and-manipulation
    3 主题
  29. protocols
    2 主题
  30. circuit-switching-packet-switching
    1 主题
  31. processors-parallel-processing-and-virtual-machines
    5 主题
  32. boolean-algebra-and-logic-circuits
    4 主题
  33. purposes-of-an-operating-system-os
    3 主题
  34. translation-software
    3 主题
  35. encryption-encryption-protocols-and-digital-certificates
    3 主题
  36. artificial-intelligence-ai
    4 主题
  37. recursion
    1 主题
  38. programming-paradigms
    4 主题
  39. object-oriented-programming
    7 主题
  40. file-processing-and-exception-handling
    2 主题
  41. data-representation
    5 主题
  42. multimedia
    3 主题
  43. compression
    2 主题
  44. networks-and-the-internet
    11 主题
课 Progress
0% Complete

Half adders

What is a half adder circuit?

  • A half adder circuit is a basic digital circuit used in computation to perform the addition of two single bit numbers

  • Has two inputs, usually labelled as A and B

  • Produces two outputs labelled Carry out (Cout) and Sum(s)

A

B

Cout

S

0

0

0

0

0

1

0

1

1

0

0

1

1

1

1

0

A AND B

A XOR B

  • Remember that you are adding together the binary numbers represented by A and B

  • Create the Cout column first then for each row you can just add A and B together and write the answer in 2 bits in the Cout and S columns 

    • For example in row 2:

      • A is 0 and B is 1 and 0+1=1

      • 1 = 01 in 2 bits (Cout 0 and Sum 1)

    • In the last row:

      • A is 1 and B is 1 and 1+1 = 2

      • 2 = 10 in 2 bit binary (Cout 1 and Sum 0)

Drawing a half adder circuit

  • A half adder circuit has two inputs, typically labelled as A and B, and two outputs: the Sum (S) and Carry (Cout)

  • This circuit can be created using an XOR gate for the Sum output and an AND gate for the Carry output

  • Label Inputs:

    • Begin by drawing two lines on the left side of your paper or drawing space

    • Label the top line as ‘A‘ and the bottom line as ‘B

    • These represent your inputs

  • XOR Gate (Sum):

    • Draw an XOR gate (often a shape like a curved ‘D’ or a shape similar to an OR gate but with an additional curved line on the input side) in the middle of the paper or drawing space

    • Connect the A and B lines to the two inputs of the XOR gate 

    • The output from the XOR gate is the ‘Sum

    • Draw a line from the output of the XOR gate to the right side of your paper and label it as ‘S

  • AND Gate (Carry):

    • Draw an AND gate (typically a D-shaped symbol) above the XOR gate

    • Again, connect the A and B lines to the two inputs of the AND gate

    • The output from the AND gate is the ‘Carry

    • Draw a line from the output of the AND gate to the right side of your paper and label it as ‘Cout

      half-adder-v2

Half Adder Logic Gates

Full adders

What is a full adder circuit?

  • A full adder circuit extends the half adder to handle the addition of three bits

  • Has three inputs: A, B, and an input carry (Cin)

  • Produces two outputs: carry (Cout) and sum (S)

A

B

Cin

Cout

S

0

0

0

0

0

0

0

1

0

1

0

1

0

0

1

0

1

1

1

0

1

0

0

0

1

1

0

1

1

0

1

1

0

1

0

1

1

1

1

1

  • To easily reproduce this Truth Table, remember:

    • The full adder adds up three binary inputs A,B and C

    • So the answer can be 0,1,2 or 3

    • For each row, add up A, B and C and the write the answer as a 2 bit binary number in the last 2 columns (Cout and Sum)

    • For example in row 4, A=0, B=1 and C=1 – 0+1+1=2 which is 10 in binary, so Cout is 0 and Sum is 1

    • In the last row, A=1, B=1 and C=1, 1+1+1=3 which is 11 in binary so Cout is 1 and Sum is 1

Operation

  • The “Sum” output provides the XOR of the inputs A, B, and Cin

  • The “Carry” output is TRUE if at least two of the inputs A, B, and Cin are TRUE

Drawing a full adder circuit

  • A full adder circuit consists of three inputs: A, B, and Carry (Cin), and two outputs: Sum (S) and Carry (Cout)

  • It can be designed using two half adders and an OR gate

  • Label Inputs:

    • Start by drawing three lines on the left side of your paper or drawing space

    • Label the top line as ‘A‘, the middle line as ‘B’, and the bottom line as ‘Cin

    • These represent your inputs

  • First Half Adder:

    • Draw a half adder with A and B as inputs

    • This consists of an XOR gate (for the Sum) and an AND gate (for the Carry)

    • Label the output of the XOR gate as ‘Sum1‘ and the output of the AND gate as ‘Carry1

  • Second Half Adder:

    • Draw a second half adder underneath the first, using Sum1 and Cin as inputs

    • Again, it consists of an XOR gate (for the Sum) and an AND gate (for the Carry)

    • Label the output of the XOR gate as ‘S‘ (final Sum) and the output of the AND gate as ‘Carry2

  • OR Gate:

    • Draw an OR gate to the right of the half adders

    • Connect Carry1 and Carry2 to the inputs of the OR gate

    • The output of the OR gate is the final Carry (Cout)

      full-adder-v2

Full Adder Logic Gates

Responses

您的邮箱地址不会被公开。 必填项已用 * 标注