Polynomial long division: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
→‎Pseudo-code: added reference
 
(One intermediate revision by one other user not shown)
Line 1: Line 1:
A '''barrel shifter''' is a [[digital circuit]] that can [[Bit shift|shift]] a [[Word (data type)|data word]] by a specified number of [[bit]]s in one [[clock cycle]]. It can be implemented as a sequence of [[multiplexer]]s (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.
My name: Shona McCombie<br>Age: 32<br>Country: United States<br>Home town: Lexington <br>Post code: 40505<br>Address: 2906 Counts Lane<br><br>My web-site [http://xazina.com/DarPrimm/2014/08/01/dog-training-collar---make-your-dog-stay-in-your-yard.html dog training long beach ca]
 
For example, take a four-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 [[microprocessor]]s (alongside the [[Arithmetic logic unit|ALU]]).
 
== Implementation ==
 
A barrel shifter is often implemented as a cascade of parallel 2×1 multiplexers.  For a four-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\log_2n</math>.  Five common [[word size]]s and the number of multiplexers needed are listed below:
 
* 128-bit &mdash; <math>\scriptstyle 128\times\log_2(128) = 128\times7 = 896</math>
* 64-bit &mdash; <math>\scriptstyle 64\times\log_2(64) = 64\times6 = 384</math>
* 32-bit &mdash; <math>\scriptstyle 32\times\log_2(32) = 32\times5 = 160</math>
* 16-bit &mdash; <math>\scriptstyle 16\times\log_2(16) = 16\times4 = 64</math>
* 8-bit &mdash; <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<ref>http://www.realworldtech.com/page.cfm?ArticleID=RWT081502231107&p=4</ref>
 
== 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]]s 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.
 
==See also==
*[[Circular shift]]
 
==External links==
<!--*[http://answers.google.com/answers/threadview?id=388350 Google Answers] has a good explanation, and collection of links-->
*[http://tams-www.informatik.uni-hamburg.de/applets/hades/webdemos/10-gates/60-barrel/shifter8.html University of Hamburg] for a useful Java Barrel shifter.
*[http://www.xilinx.com/support/documentation/application_notes/xapp195.pdf Xilinx Application Note] Implementation of Barrel shifter using Xilinx FPGAs.
 
==References==
 
{{reflist}}
{{FOLDOC}}
 
[[Category:Digital circuits]]
[[Category:Binary arithmetic]]
[[Category:Computer arithmetic]]
 
{{CPU technologies}}

Latest revision as of 16:09, 2 December 2014

My name: Shona McCombie
Age: 32
Country: United States
Home town: Lexington
Post code: 40505
Address: 2906 Counts Lane

My web-site dog training long beach ca