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

Carry Select Adder Multiplexer Stage

MediumLogic CircuitBuild

High-speed DSP circuits and ALUs rely on speculative execution to break critical path delays. By precomputing multiple possible block results and selecting the correct one later, a carry-select adder significantly reduces the latency of wide arithmetic operations.

The circuit must route one of two precomputed 4-bit sums and their corresponding carry-outs to the final output based on a late-arriving carry-in signal.

| cin | sum_out | cout_out | |-------|-----------|------------| | 0 | sum0 | cout0 | | 1 | sum1 | cout1 |

Constraints

  • Implement using only combinational logic.
  • Do not instantiate arithmetic adders to compute the sums.
  • Route the signals strictly based on the state of the carry-in.

Topics

optimizationcombinationalarithmeticmultiplexer

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