Scribd Logo
Upload

Welcome to Scribd!

  • 21 views

    Week 3

    Uploaded by

    syed mushtaher
    Digital Logic Design is an introductory course that covers number systems, binary and decimal conversions, binary complements, variables and logic functions, and binary addition and subtraction. Key topics include representing positive and negative numbers in binary, obtaining the 1's complement of a binary number by inverting the bits, adding binary numbers by taking the 1's complement of one number and adding, and handling carry bits. Examples are provided to demonstrate 1's complementation and binary addition and subtraction. The course recommends Digital Fundamentals by Thomas L. Floyd for further reading.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Week 3

    Uploaded by

    syed mushtaher
    21 views26 pages
    Digital Logic Design is an introductory course that covers number systems, binary and decimal conversions, binary complements, variables and logic functions, and binary addition and subtraction. Key topics include representing positive and negative numbers in binary, obtaining the 1's complement of a binary number by inverting the bits, adding binary numbers by taking the 1's complement of one number and adding, and handling carry bits. Examples are provided to demonstrate 1's complementation and binary addition and subtraction. The course recommends Digital Fundamentals by Thomas L. Floyd for further reading.

    Original Description:

    DLD

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Digital Logic Design is an introductory course that covers number systems, binary and decimal conversions, binary complements, variables and logic functions, and binary addition and subtraction. Key topics include representing positive and negative numbers in binary, obtaining the 1's complement of a binary number by inverting the bits, adding binary numbers by taking the 1's complement of one number and adding, and handling carry bits. Examples are provided to demonstrate 1's complementation and binary addition and subtraction. The course recommends Digital Fundamentals by Thomas L. Floyd for further reading.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    21 views26 pages

    Week 3

    Uploaded by

    syed mushtaher
    Digital Logic Design is an introductory course that covers number systems, binary and decimal conversions, binary complements, variables and logic functions, and binary addition and subtraction. Key topics include representing positive and negative numbers in binary, obtaining the 1's complement of a binary number by inverting the bits, adding binary numbers by taking the 1's complement of one number and adding, and handling carry bits. Examples are provided to demonstrate 1's complementation and binary addition and subtraction. The course recommends Digital Fundamentals by Thomas L. Floyd for further reading.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 26

    Overview Digital Logic Design

    INDUS UNIVERSITY

    2
    Digital Logic Design

    Number System
    Digital Logic Design

    • Week-03

    Binary and Decimal


    Numbers
    Binary – Decimal
    Conversion
    Compliments of Binary
    Numbers
    Common Number System
    Variables and functions

    🠶 Assume the switch controls a light bulb as shown


    – The output is defined as the state of the light L

    • If the light is on ->L=1


    • If the light is off ->L=0
    • The state of L, as

    🠶 function of x is
    🠶
    – L(x)=x
    • L(x) is a logic function
    • x is an input variable
    complement of binary number

    🠶 Generally, there are two types of complement of Binary number: 1’s


    complement and 2’s complement. To get 1’s complement of a binary
    number, simply invert the given number. For example, 1’s complement of
    binary number 110010 is 001101. To get 2’s complement of binary number is
    1’s complement of given number plus 1 to the least significant bit (LSB). For
    example 2’s complement of binary number 10010 is (01101) +1 = 01110.
    complement of binary number

    Example-1: Find 1’s complement of binary number


    10101110.

    Simply invert each bit of given binary number, so 1’s


    complement of given number will be 01010001.

    Example-2: Find 1’s complement of binary number


    10001.001.

    Simply invert each bit of given binary number, so 1’s


    complement of given number will be 01110.110.
    1’s Complementation in Signed Binary number
    Representation:

    🠶 1’s complement binary numbers are very useful in Signed number


    representation. Positive numbers are simply represented as Binary number
    number. There is nothing to do for positive binary number. But in case of
    negative binary number representation, we represent in 1’s complement. If
    the number is negative then it is represented using 1’s complement. First
    represent the number with positive sign and then take 1’s complement of
    that number.
    🠶 Example: Let we are using 5 bits register. The representation of -5 and +5
    will be as follows:
    🠶 +5 is represented as it is represented in sign magnitude method. -5 is
    represented using the following steps:
    🠶 (i) +5 =0 0101
    🠶 (ii) Take 1’s complement of 0 0101 and that is 1 1010. MSB is 1 which
    indica tes that number is negative.
    🠶 MSB is always 1 in ca se of negative numbers.
    CASES

    🠶 Example (Case-1: When Carry bit 1): Evaluate 10101 - 00101


    🠶 According to above algorithm, take 1’s complement of subtrahend 00101,
    which will be 11010, then add both of these. So, 10101 +11010 =1 01111 .
    Since, there is carry bit 1, so add this to the LSB of given result, i.e.,
    01111+1=10000 which is the answer.
    🠶 Example (Case-2: When no Carry bit): Evaluate 11110 with 1110
    🠶 According to above algorithm, take 1’s complement of subtrahend 11110,
    which will be 00011. Then add both of these, So, 11001 +00011 =11100 .
    Since there is no carry bit 1, so take 1’s complement of above result, which
    will be 00011, and this is negative number, i.e, 00011, which is the answer.
    🠶 Similarly, you can subtract two mixed (with fractional part) binary numbers.
    Note that you always add Carry bit the the least significant bit (LSB) of the
    result, whenever you get carry bit 1. LSB of fractional binary number is last
    (rightmost) bit of mixed or fractional binary numbers.
    Recommended Book:
    Digital Fundamentals, Thomas L. Floyd 11th Edition
    Thank You
    The End

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy