Abstract: A bit searching method shifts an operand and counts the number of shifts it takes to shift out the value one, thereby identifying the bit position in operand containing the value one. The operand is first compared to zero. If the operand is zero, the zero flag is set, otherwise, a register is initialized by being cleared for a bit search forward instruction or, for a bit search reverse instruction, being initialized to 15 for a 16-bit data length or 31 for a 32-bit data length For a bit search forward instruction, the operand is then shifted right one bit and the register is incremented, while for a bit search reverse instruction, the operand is shifted left one bit and the register is decremented. The operand is then examined to see if a 1 has been shifted out. If so, the register is read and decremented by 1 to yield the bit position of the operand where the first 1 was found. If not, then another shift and increment (decrement) step is performed.

Abstract: A double precision shift operation utilizes a 32 bit data path.

Abstract: A microprocessor execution unit includes an arithmetic unit and an addressing unit. The arithmetic unit performs arithmetic and logical operations on operands. The addressing unit operates in conjunction with the arithmetic unit to calculate offsets, limits, and linear addresses in a single cycle.

Abstract: A barrel shifter performs multi-bit shift and rotate operations on data of different lengths using multiplexors to preprocess the data prior to introducing the data to a transistor array.