Chapter-02-D.pdf - CP216 – Introduction to Microprocessors Chapter 2 Computer Arithmetic and Digital Logic Lecture-2D Lecture-02 Chapter 2 Computer

Chapter-02-D.pdf - CP216 – Introduction to...

This preview shows page 1 - 9 out of 22 pages.

CP216 Introduction to Microprocessors ©2017 Dr. S. Song Chapter 2 Computer Arithmetic and Digital Logic Lecture-2D Lecture-02: 2.1 What is Data 2.2 Numbers 2.3 Binary Arithmetic 2.4 Signed Integers 2.5 Introduction to Multiplication and Division Chapter 2 Computer Arithmetic and Digital Logic 28/12/2017 Lecture-02 Page 1 Lecture-2A 2.6 Floating-Point Numbers 2.7 Floating-Point Arithmetic 2.8 Floating-Point Arithmetic and the Programmer Lecture-2B 2.9 Computer Logic 2.10 Sequential Circuits 2.11 Busses and Tristate Gates Lecture-2C and Lecture-2D
Image of page 1

Subscribe to view the full document.

CP216 Introduction to Microprocessors ©2017 Dr. S. Song Chapter 2 Computer Arithmetic and Digital Logic Lecture-2D 28/12/2017 Lecture-02 Page 2 Lecture-2D 2.9 Computer Logic 2.10 Sequential Circuits 2.11 Busses and Tristate Gates
Image of page 2
CP216 Introduction to Microprocessors ©2017 Dr. S. Song Chapter 2 Computer Arithmetic and Digital Logic Lecture-2D 28/12/2017 Lecture-02 Page 3
Image of page 3

Subscribe to view the full document.

CP216 Introduction to Microprocessors ©2017 Dr. S. Song Chapter 2 Computer Arithmetic and Digital Logic Lecture-2D 28/12/2017 Lecture-02 Page 4 2.9.3 Basic Circuits
Image of page 4
CP216 Introduction to Microprocessors ©2017 Dr. S. Song Chapter 2 Computer Arithmetic and Digital Logic Lecture-2D 28/12/2017 Lecture-02 Page 5 2.9.3 Basic Circuits The Half Adder and Full Adder Table 2.13 gives the truth table of a half adder that adds bit A to bit B to get a sum S and a carry. Figure 2.22 shows the possible structure of a two-bit adder. The carry bit is generated by ANDing the two inputs. From Truth Table to Boolean Function Sum= M1+M2 =A’B+AB’ C= M3 = AB From Boolean Function To Circuit
Image of page 5

Subscribe to view the full document.

CP216 Introduction to Microprocessors ©2017 Dr. S. Song Chapter 2 Computer Arithmetic and Digital Logic Lecture-2D 28/12/2017 Lecture-02 Page 6 2.9.3 Basic Circuits Full Adder Circuit Figure 2.3 gives the possible circuit of a one-bit full adder.
Image of page 6
CP216 Introduction to Microprocessors ©2017 Dr. S. Song Chapter 2 Computer Arithmetic and Digital Logic Lecture-2D 28/12/2017 Lecture-02 Page 7 2.9.3 Basic Circuits Full Adder/Parallel-Adder We need m full adder circuits to add two m -bit words in parallel as Figure 2.25 demonstrates. Each of the m full adders adds bit a i to bit b i , together with a carry-in from the stage on its right, to produce a carry-out to the stage on its left.
Image of page 7

Subscribe to view the full document.

CP216 Introduction to Microprocessors ©2017 Dr. S. Song
Image of page 8
Image of page 9
  • Winter '14
  • Staff
  • Logic gate, Flip-flop, Dr. S. Song

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern

Ask Expert Tutors You can ask 0 bonus questions You can ask 0 questions (0 expire soon) You can ask 0 questions (will expire )
Answers in as fast as 15 minutes