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

IEEE 754 Normalization Shifter

HardLogic CircuitBuild

Floating point adders and multipliers often produce unnormalized results that must be corrected before write-back. The normalization stage restores the hidden one format by shifting the mantissa left and decrementing the exponent by the exact shift amount.

The circuit receives an 8-bit unnormalized mantissa M_in, a 4-bit exponent E_in, and a 3-bit leading zero count LZC.

Produce an 8-bit normalized mantissa M_out by logically shifting M_in left by LZC bits. Zero-fill the lower bits during the shift. Produce a 4-bit adjusted exponent E_out by subtracting LZC from E_in.

Constraints

  • Combinational logic only.
  • Do not use sequential elements or clock signals.
  • Assume E_in is always strictly greater than or equal to LZC to prevent underflow.

Topics

arithmeticfloating-pointbarrel-shifter

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

  • Half Adder Using Only XOR and ANDEasy
  • Floating Point Exception FlagsMedium
  • 1-Bit ALU SliceMedium
  • 4-bit Carry Lookahead BlockHard
  • BCD Adder Correction BlockMedium
  • IEEE 754 Mantissa Alignment ShifterHard
  • Four-Bit Bus AdderEasy
  • Debugging Twos Complement OverflowMedium

Browse all problems · Learning tracks