Binary Splification

Discussion in 'Homework Help' started by Thinker, Jan 9, 2007.

  1. Thinker

    Thread Starter Active Member

    Jan 9, 2007
    61
    0
    There is a task on my assignment paper which ask:

    Simplify using total of 8 bits on of which is a sign bit.

    These are the things you simplify: 1) 34 + 4, 2) 15 - 15 and 3) -14 - 10

    Does anybody know which website i could go to that give a good explanation on binary splification?

    Thanks.
     
  2. Dave

    Retired Moderator

    Nov 17, 2003
    6,960
    144
  3. Thinker

    Thread Starter Active Member

    Jan 9, 2007
    61
    0
    Thanks a lot Dave!

    Is there a chapter which gives you help on fixed point notations, mattissa, exponent and etc?

    This is basicaly for a Computer System assigment on Binary and Logic.

    Thanks.
     
  4. Dave

    Retired Moderator

    Nov 17, 2003
    6,960
    144
    I'm not sure what exactly you are looking for. Try looking through Volume 4 to see if it has what you want. You can also use the search function on the sidebar on the left hand side.

    Dave
     
  5. Thinker

    Thread Starter Active Member

    Jan 9, 2007
    61
    0
    Thanks for the help Dave, when i finish answering the task i'll post the answers on here and people can check if it's right.

    Thanks.
     
  6. Dave

    Retired Moderator

    Nov 17, 2003
    6,960
    144
    No problem.

    Dave
     
  7. Thinker

    Thread Starter Active Member

    Jan 9, 2007
    61
    0
    Here are my answers:

    1) 110010
    2) 0000
    3) 1110

    Can anyone check if these are right (BTW check the question on post 1)?
     
  8. Dave

    Retired Moderator

    Nov 17, 2003
    6,960
    144
    Assuming 8-bit binary with a sign bit (which is the Most Significant bit) I get the following:

    1) 00100110
    2) 00000000
    3) 11101000

    The relative weighting for each bit is as thus: -128 64 32 16 8 4 2 1

    So for each of my above answers, where there is a '1' this will give a value based on the above relative weighting, for example:

    1) 00100110 = 32 + 4 + 2 = 38

    2) 00000000 = 0

    3) 11101000 = -128 + 64 + 32 + 8 = 24

    Which is verifyable with the answers to the decimal equations in your opening post. For specific information on this technique refer to Volume 4 - Chapter 2 - Negative Binary Numbers.

    Dave
     
  9. Thinker

    Thread Starter Active Member

    Jan 9, 2007
    61
    0
    Dave, thanks for the corrections.

    I just sorted it out over the weekend and my binary numbers are different but they give the same type of answer. So, yeah i've manged to pull myself out of the water this time.
     
  10. Dave

    Retired Moderator

    Nov 17, 2003
    6,960
    144
    The important thing to remember for 2's compliment (x-bits with a sign bit, call it what you want) is that the MSB is the sign bit: 0 => positive and 1 => negative. A characteristic of 2's compliment is that if you set all the bits to 1, then the value of bit-segment is always -1.

    Dave
     
  11. Thinker

    Thread Starter Active Member

    Jan 9, 2007
    61
    0
    Yeah, thanks Dave i checked out my answers with your explanation and it comes up at the end with does positive/negative values.

    One thing i know now, is i'm definitely not taking circuitry up as a lifetime job :p
     
Loading...