Logical right shifting of bit vector

• Right shifting $x$ by $k$, fills the left end with $k$ zeroes.
• Assuming a $w-$bit vector, $x=\left[x_{w-1},x_{w-2},\dots ,x_0\right]$, $x\gg k$ will give:
  • $\left[0,\dots ,0,x_{w-1},x_{w-2},\dots x_k\right]$
• Almost all machine instructions use logical right shifts for unsigned data

Example

• $x=[1100]$
• $x>>2=[\text{00}\text{11}]$
  • The italicised 0s indicate the values that fill the left end

Sources

• Computer Systems - A Programmer’s Perspective

Related Notes