loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
18th IEEE Symposium on Computer Arithmetic (ARITH '07)
Performing Advanced Bit Manipulations Efficiently in General-Purpose Processors
Montpellier, France
June 25-June 27
ISBN: 0-7695-2854-6
Yedidya Hilewitz, Princeton University
Ruby B. Lee, Princeton University
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.
Index Terms:
shifter, rotations, permutations, bit manipulations, arithmetic, processor
Citation:
Yedidya Hilewitz, Ruby B. Lee, "Performing Advanced Bit Manipulations Efficiently in General-Purpose Processors," arith, pp.251-260, 18th IEEE Symposium on Computer Arithmetic (ARITH '07), 2007
Usage of this product signifies your acceptance of the Terms of Use.