3 Hilewitz, Yedidya Lee, Ruby B. 2007 Proceedings of the 18th IEEE Symposium on Computer Arithmetic (ARITH-18) Montpellier, France 251-260 June 2007 shifter, rotations, permutations, bit manipulations, arithmetic, processor This paper describes a new basis for the implementation of a shifter functional unit. We present a design based on the inverse butterfly and butterfly datapath circuits that performs the standard shift and rotate operations, as well as more advanced extract, deposit and mix operations found in some processors. Additionally, it also supports important new classes of even more advanced bit manipulation instructions recently proposed: these include arbitrary bit permutations, bit scatter and bit gather instructions. The new functional unit?s datapath is comparable in latency to that of the classic barrel shifter. It replaces two existing functional units - shifter and mix - with a much more powerful one.