Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • Home
  • SEARCH
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 6205429
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 24, 20262026-05-24T05:16:21+00:00 2026-05-24T05:16:21+00:00

when i am looking at the wikipedia page for Offset Binary , i cant

  • 0

when i am looking at the wikipedia page for Offset Binary, i cant follow the following sentence:

Unusually however, instead of using “excess 2^(n-1)” it uses “excess
2^(n-1)-1” which means that inverting the leading (high-order) bit of
the exponent will not convert the exponent to correct twos’ complement
notation.

can anyone explain it in details and give me some examples?

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-24T05:16:22+00:00Added an answer on May 24, 2026 at 5:16 am

    This is the range of exponents which allows you to calculate 1/Float.MAX_VALUE and 1/Float.MIN_NORMAL without going to zero or Infinity. If there was one more negative exponent and one less positive exponent, (with an offset of 128) 1/Float.MIN_NORMAL would be Infinity.


    The exponent in floating point is offset rather than plain two-complement.

    e.g. for double a 0 exponent is 11-bit value for 1023 or 0b0111111111, -1 is 1022 or 0b0111111110, +1 is 1024 0b10000000000.

    In twos-complement, the number would be 0 is 0b00000000000, -1 is 0b11111111111, and +1 is 0b00000000001

    A property of using an offset, is that the maximum is half the possible number of values. i.e. for 11 bits the range is -1023 to 1024 instead of -1024 to 1023.

    Another property is that number can be compared by just comparing the integer values.

    i.e.

    long l1 = Double.doubleToRawLongBits(d1);
    long l2 = Double.doubleToRawLongBits(d2);
    if (l1 > l2) // like d1 > d2
    

    The only difference is in the handling of NaN and -0.0 The approach Double.compare(double, double) uses is based on this.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I am looking to retrieve the XML of a Wikipedia page using their api.
I was looking at this on the Wikipedia Page and was wondering if anyone
I have a page where i am using the wikipedia api . But since
I was looking at the wikipedia page on primes and of course, I came
I've been looking at the wiki page: http://en.wikipedia.org/wiki/Shunting-yard_algorithm I've used the code example to
I'm going through crawling wikipedia using website downloader for windows, i was looking through
I'm working on a project constructing an online collaboration tool. Looking at Wikipedia, I
Am looking for checkpointing library for C#. Any ideas ? see http://en.wikipedia.org/wiki/Application_checkpointing
I am looking for the XSD schema of RSS. Via Wikipedia I have found
Looking for C# class which wraps calls to do the following: read and write

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.