Binary Fraction Tool

Binary Truncation Calculator

Remove unwanted fractional bits from a binary number. Choose how many bits to keep after the binary point and instantly see the truncated binary value, discarded bits, decimal result, and exact error.

Positive & negative values 0–256 fractional bits Exact base-2 calculation
Truncate Binary Fraction
Truncated binary 101.110
3 fractional bits kept.
Original 101.110101
Discarded bits 101
Decimal result 5.75
Truncation error -0.078125
Binary Truncation

What Is Binary Truncation?

Binary truncation removes fractional bits beyond a selected precision without rounding the retained binary value upward.

Suppose a binary number contains six fractional bits but a system can store only three. Truncation keeps the first three fractional bits and removes the remaining three.

For positive numbers, truncation reduces or preserves the value. For negative values written with an explicit minus sign, truncating the magnitude moves the result toward zero.

Example: truncate 101.110101₂ to 3 fractional bits
Original: 101.110101₂ Keep: 101.110₂ Discard: 101₂ Result: 101.110₂ Decimal: 5.75
Steps

How to Truncate a Binary Number

1
Enter the binary value Use digits 0 and 1 with an optional binary point and sign.
2
Choose fractional bits to keep For example, choose 3 to keep only three places after the binary point.
3
Remove all following bits Extra fractional bits are discarded without incrementing the retained portion.
Truncation vs Rounding

Binary Truncation Is Not the Same as Rounding

Truncation simply removes unwanted bits. Rounding examines the discarded portion and may increase the retained value.

Original Keep Truncated Nearest Rounded
10.1111 2 bits 10.11 11.00
101.110101 3 bits 101.110 101.111
1.0011 2 bits 1.00 1.01
This calculator performs truncation only. It does not inspect discarded bits to decide whether the retained value should be increased.
Precision

Fractional Bits and Binary Precision

Each binary fractional position represents a negative power of two. Keeping fewer fractional bits means using a larger minimum step between representable values.

Bits Kept Smallest Step Binary Weight
0 1 2⁰
1 0.5 2⁻¹
2 0.25 2⁻²
3 0.125 2⁻³
4 0.0625 2⁻⁴
8 0.00390625 2⁻⁸
Negative Values

Truncating Negative Binary Numbers

This calculator accepts signed-magnitude text input such as -1.1011. When fractional bits are removed, the magnitude becomes smaller, so the result moves toward zero.

Example: -1.1011₂ truncated to 2 fractional bits
Original: -1.1011₂ Keep: -1.10₂ Discard: 11₂ Result: -1.10₂ Decimal result: -1.5

This is different from mathematical floor rounding. Floor would move a negative inexact value toward negative infinity rather than toward zero.

Error

What Is Truncation Error?

The truncation error is the difference between the truncated result and the original value.

If 101.110101₂ equals 5.828125 and it is truncated to 101.110₂, which equals 5.75, the error is:

Truncation error
5.75 – 5.828125 = -0.078125

For positive values the truncation error is normally zero or negative. For negative values truncated toward zero, the error is normally zero or positive.

Applications

Where Binary Truncation Is Used

Fixed-Point Arithmetic

Removing fractional bits when a fixed-point format has limited precision.

Digital Hardware

Dropping low-order bits when reducing register or datapath width.

Digital Signal Processing

Limiting coefficient, sample, or accumulator precision.

Embedded Systems

Reducing numerical precision to fit memory or processor formats.

Binary Analysis

Testing how much value is lost when lower binary digits are removed.

Computer Architecture

Studying precision loss during bit-width reduction and arithmetic operations.

Common Mistakes

Common Binary Truncation Mistakes

Rounding instead of truncating

Do not increase the retained portion simply because the first discarded bit is 1. Truncation always removes the extra bits.

Removing integer bits

Fractional truncation removes digits to the right of the binary point. It does not remove the integer portion of the value.

Confusing truncation with floor

Truncation and floor behave differently for negative values. Truncation moves toward zero while floor moves toward negative infinity.

Forgetting the selected precision

A result such as 101.110 intentionally retains three fractional positions, including trailing zeros.

FAQ

Binary Truncation Calculator FAQs

It means removing binary digits beyond a chosen precision without rounding the retained portion upward.
Choose how many bits you want after the binary point and remove every fractional bit that follows.
No. Truncation simply discards the extra bits.
Yes. Set fractional bits to keep to 0 and all bits after the binary point will be removed.
Yes. Enter a minus sign before the binary number, for example -101.1101.
For signed numerical values, removing fractional magnitude without incrementing the retained portion corresponds to movement toward zero.
Discarded bits are the fractional binary digits removed because they are beyond the selected precision.
No value is removed. The calculator may add trailing zeroes only to show the selected number of fractional places.
It is the difference between the truncated result and the original binary value.
Yes. The truncation decision and value calculations use integer arithmetic over powers of two rather than relying on ordinary floating-point conversion.
This calculator supports from 0 through 256 fractional bits.
Trailing zeroes show the requested binary precision. For example, 101.1 and 101.100 have the same value but different displayed precision.
Scroll to Top