1 / 42

EE207: Digital Systems I, Semester I 2003

7-Sep-12. 2. Chapter 3-v: Combinational Logic Design (3.9-3.11). Overview. Binary Subtraction2''s complementExtension to r's complementSubtraction with complementsBinary Adders/SubtractorsSigned numbersSigned Addition/SubtractionOverflow problemBinary Multipliers. 7-Sep-12. 3. Chapter 3-v: C

alva
Download Presentation

EE207: Digital Systems I, Semester I 2003

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. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

    1. EE207: Digital Systems I, Semester I 2003/2004 CHAPTER 3-v: Combinational Logic Design (Section 3.9-3.11)

    2. 7-Sep-12 2 Chapter 3-v: Combinational Logic Design (3.9-3.11) Overview Binary Subtraction 2’’s complement Extension to r’s complement Subtraction with complements Binary Adders/Subtractors Signed numbers Signed Addition/Subtraction Overflow problem Binary Multipliers

    3. 7-Sep-12 3 Chapter 3-v: Combinational Logic Design (3.9-3.11) Binary Subtraction Unsigned numbers: minus sign is not explicitly represented. Given 2 binary numbers M and N, find M-N: Case I: M = N, thus, MSB of Borrow is 0 B 0 0 0 1 1 0 M 1 1 1 1 0 30 N -1 0 0 1 1 -19 Result is Correct Dif 0 1 0 1 1 11 Case II: N > M, thus MSB of Borrow is 1 B 1 1 1 0 0 0 M 1 0 0 1 1 19 N -1 1 1 1 0 -30 Result requires correction! Dif 1 0 1 0 1 21

More Related