Difference between revisions of "Barrel shifter"

Latest revision as of 17:11, 9 December 2011

A barrel shifter is a digital circuit that can shift a data word by a specified number of bits in one clock cycle. It can be implemented as a sequence of multiplexers (mux.), and in such an implementation the output of one mux is connected to the input of the next mux in a way that depends on the shift distance.

For example, take a 4-bit barrel shifter, with inputs A, B, C and D. The shifter can cycle the order of the bits ABCD as DABC, CDAB, or BCDA; in this case, no bits are lost. That is, it can shift all of the outputs up to three positions to the right (and thus make any cyclic combination of A, B, C and D). The barrel shifter has a variety of applications, including being a useful component in microprocessors (alongside the ALU).

Implementation

A barrel shifter is often implemented as a cascade of parallel 2×1 multiplexers. For a 4-bit barrel shifter, an intermediate signal is used which shifts by two bits, or passes the same data, based on the value of S[1]. This signal is then shifted by another multiplexer, which is controlled by S[0]:

 im  = IN, if S[1] == 0
     = IN << 2, if S[1] == 1
 OUT = im, if S[0] == 0
     = im << 1, if S[0] == 1

Larger barrel shifters have additional stages.

Cost

The number of multiplexers required for an n-bit word is <math>\scriptstyle n\times\log_2(n)</math>. Five common word sizes and the number of multiplexers needed are listed below:

• 128-bit — <math>\scriptstyle 128\times\log_2(128) = 128\times7 = 896</math>
• 64-bit — <math>\scriptstyle 64\times\log_2(64) = 64\times6 = 384</math>
• 32-bit — <math>\scriptstyle 32\times\log_2(32) = 32\times5 = 160</math>
• 16-bit — <math>\scriptstyle 16\times\log_2(16) = 16\times4 = 64</math>
• 8-bit — <math>\scriptstyle 8\times\log_2(8) = 8\times3 = 24</math>

Cost of critical path in FO4 (estimated, without wire delay):

• 32-bit: from 18 FO4 to 14 FO4^[1]

Uses

A common usage of a barrel shifter is in the hardware implementation of floating-point arithmetic. For a floating-point add or subtract operation, the significand of the two numbers must be aligned, which requires shifting the smaller number to the right, increasing its exponent, until it matches the exponent of the larger number. This is done by subtracting the exponents, and using the barrel shifter to shift the smaller number to the right by the difference, in one cycle. If a simple shifter were used, shifting by n bit positions would require n clock cycles.

External links

• Google Answers has a good explanation, and collection of links
• University of Hamburg for a useful Java Barrel shifter.
• Xilinx Application Note Implementation of Barrel shifter using Xilinx FPGAs.

References

This article was originally based on material from the Free On-line Dictionary of Computing, which is licensed under the GFDL.

de:Barrel-Shifter

1. ↑ http://www.realworldtech.com/page.cfm?ArticleID=RWT081502231107&p=4