ravenprp
Feb1-07, 06:56 PM
1. The problem statement, all variables and given/known data
What is the range of a 11bit code, using
c. Unsigned fixed-point with 8 binary places
2. Relevant equations
Base conversions
2^n where n is bits, for range/precision
3. The attempt at a solution
I have two ideas:
1)
The highest value that can be represented is: 111.11111111, which represents this ... 7.99609375 ... then I subtract one from it ... – 1 = 6.99609375
0 to 6.99609375
Or
2) Since it is a 11bit code, you have 2^11 possible combinations to store in memory. Since the binary pt is fictional, until it is programmed by the programmer, wouldn't you still need 2^11 binary points to represent the 11 bit code xxxxxxxxxxx, regardless of what value it is?
That's my reasoning.
What is the range of a 11bit code, using
c. Unsigned fixed-point with 8 binary places
2. Relevant equations
Base conversions
2^n where n is bits, for range/precision
3. The attempt at a solution
I have two ideas:
1)
The highest value that can be represented is: 111.11111111, which represents this ... 7.99609375 ... then I subtract one from it ... – 1 = 6.99609375
0 to 6.99609375
Or
2) Since it is a 11bit code, you have 2^11 possible combinations to store in memory. Since the binary pt is fictional, until it is programmed by the programmer, wouldn't you still need 2^11 binary points to represent the 11 bit code xxxxxxxxxxx, regardless of what value it is?
That's my reasoning.