In the register exchange, the entire best path ending in each state is updated on each new input. This allows the assumed merged paths to be read out easily within one cycle. It also uses a very large number of registers. For the 128 state code in this example, a traceback length of over 32 is expected. This means over 4000 registers are needed. This is feasible in a Virtex-6, but is a waste of resources.