How to determine fraction length of fixed-point binary so that distinct entries of a group of decimal numbers (for example: 1, 0.456, 0.444) remain distinct after converting them from decimal to fixed-point binaries?
2026-03-30 05:25:07.1774848307
Determine fraction length of fixed-point binary
594 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in ALGORITHMS
- Least Absolute Deviation (LAD) Line Fitting / Regression
- Do these special substring sets form a matroid?
- Modified conjugate gradient method to minimise quadratic functional restricted to positive solutions
- Correct way to prove Big O statement
- Product of sums of all subsets mod $k$?
- (logn)^(logn) = n^(log10+logn). WHY?
- Clarificaiton on barycentric coordinates
- Minimum number of moves to make all elements of the sequence zero.
- Translation of the work of Gauss where the fast Fourier transform algorithm first appeared
- sources about SVD complexity
Related Questions in BINARY
- What is (mathematically) minimal computer architecture to run any software
- Produce solutions such that $k$&$x$ $=$ $k$,in a range ($0$,$n$)
- Solve an equation with binary rotation and xor
- Number of binary sequences with no consecutive ones.
- Recurrence with $\lfloor n/2 \rfloor$
- Converting numbers to different bases
- Why does the decimal representation of (10^x * 10^y) always suffix the same representation in binary?
- Period of a binary sequence
- Contradiction in simple linear regression formula
- From unary to binary numeral system
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
You can get a bound by looking at the smallest gap between your numbers. For your example, $0.456-0.444=0.012$ If you use $n$ bits such that $2^{-n} \lt 0.012$ you are guaranteed that the representations will be different after rounding. In this case, we find $n=7, 2^{-n}=0.0078125$ and in fact $0.456 \approx 0.0111010_2, 0.444 \approx 0.0111001_2$, so this is the best we can do. Two numbers that are very close together could round away from each other and fewer bits might be needed. For example, if your numbers were $0.250001$ and $0.249999$ we would think we would need $19$ bits as $2^{-19}\approx 1.9 \cdot 10^{-6} \lt 0.000002$, but in fact $0.249999$ rounds down to $0.0_2$ while $0.250001$ rounds up to $0.1_2$ and we only need one bit.