Parity predictor for shifting-output adders

A parity scheme for an adder that chooses either the most or least significant bits of the result (shifting-output adder) depending on instruction is presented. The hardware required to implement the parity predictor, and the delay associated with its critical path, are of the same order of magnitude as parity predictors for nonshifting output adders.