In a multiplier, instead of xoring each exponent before and after the computation, an alternative is to xor with the opposite input, add the correction (also without xoring), and then add 2 if the input signs were different (aka output number is negative). Doesn't seem to be efficient in software, but it could potentially have uses in hardware.