loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
IEEE 17th International Conference on Application-specific Systems, Architectures and Processors (ASAP'06)
Fast Bit Compression and Expansion with Parallel Extract and Parallel Deposit Instructions
Steamboat Springs, Colorado, USA
September 11-September 13
ISBN: 0-7695-2682-9
Yedidya Hilewitz, Princeton University, Princeton, NJ
Ruby B. Lee, Princeton University, Princeton, NJ
Current microprocessor instruction set architectures are word oriented, with some subword support. Many important applications, however, can realize substantial performance benefits from bitoriented instructions. We propose the parallel extract (pex) and parallel deposit (pdep) instructions to accelerate compressing and expanding selections of bits. We show that these instructions can be implemented by the fast inverse butterfly and butterfly network circuits. We evaluate latency and area costs of alternative functional units for implementing subsets of advanced bit manipulation instructions. We show applications exhibiting significant speedup, 3.41? on average over a basic RISC architecture, and 2.48? on average over an instruction set architecture (ISA) that supports extract and deposit instructions.
Citation:
Yedidya Hilewitz, Ruby B. Lee, "Fast Bit Compression and Expansion with Parallel Extract and Parallel Deposit Instructions," asap, pp.65-72, IEEE 17th International Conference on Application-specific Systems, Architectures and Processors (ASAP'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.