CodiodeCodiode
Home
Problem Solving
Skill Tracks
My Assignments
Contests
Leaderboard
Community
Settings
Codiode/Problems/Combinational Logic

Binary Fraction to Decimal

EasyLogic CircuitAnalyze

Fixed-point representation drives digital signal processing hardware where floating-point arithmetic is too expensive. The bit pattern 0.1011 represents an unsigned fractional binary value. The radix point separates the integer portion from the fractional portion. Each position to the right of the radix point carries a positional weight of a negative power of two. Determine the exact decimal equivalent of this binary fraction.

Constraints

  • Assume an unsigned fixed-point representation.
  • The radix point is explicitly shown and fixed in place.
  • Answers must be exact decimal values without rounding.

Topics

binaryfixed-pointdata-representation

Solve this problem

Place the gates, wire them up and watch the signals settle. Every submission runs on the same simulation engine that grades it.

This problem is part of Codiode Pro. The statement above is free to read.

Sign in to solveSee what Pro unlocks

The circuit builder and code editor need a desktop screen. On a phone, read the problem here and open it on a laptop to solve.

Related problems

  • Binary to HexEasy
  • 1-to-4 Demultiplexer from AND and NOT GatesEasy
  • 2-to-4 Line Decoder with Active-High EnableEasy
  • Hex Nibble to BinaryEasy
  • Odd Parity Bit Generator for 3-bit DataEasy
  • Full Adder from Half AddersEasy
  • Modulo ArithmeticMedium
  • Two's Complement: Encode a Negative DecimalEasy

Browse all problems · Learning tracks