Shift Micro-operations

Introduction

Shift micro-operations move bits within a register left or right. While this sounds simple, shifts are remarkably versatile — they can multiply or divide by powers of 2, extract bit fields, serialize data for transmission, and implement efficient algorithms. The way the "empty" positions are filled and the "lost" bits are handled defines different shift types, each with its own purpose.

Types of Shift Operations

1. Logical Shift

Shifts bits in the specified direction. Empty positions are filled with zeros. The bit that falls off the end is typically stored in the Carry flag.

Logical Shift Left (LSL):

Effect: Multiplies unsigned number by 2 (equivalent to ×2)

Logical Shift Right (LSR):

Effect: Divides unsigned number by 2 (equivalent to ÷2, truncating)

2. Arithmetic Shift

Designed for signed numbers (two's complement). The key difference: arithmetic right shift preserves the sign bit.

Arithmetic Shift Left (ASL): Same as logical shift left — fill with zeros from the right.

Note: If the sign bit changes, overflow has occurred.

Arithmetic Shift Right (ASR): Fill with a copy of the sign bit (MSB):

Effect: Divides signed number by 2, rounding toward negative infinity.

3. Circular Shift (Rotate)

No bits are lost — the bit that falls off one end wraps around to the other end.

Rotate Left (ROL):

Rotate Right (ROR):

Rotate Through Carry: The carry flag acts as an extra bit in the rotation:

This is useful for multi-word shifts (shifting a value wider than one register).

RTL Notation for Shifts

Hardware Implementation

Basic Shifter (1-bit shift)

A 1-bit left shift is simply reconnecting wires:

No logic gates needed for a fixed 1-bit shift — just wiring!

Combinational Shifter

A shifter that can do different types of shifts uses multiplexers:

Barrel Shifter

For shifting by variable amounts (shift by 0 to n-1 positions in one cycle):

An n-bit barrel shifter uses log₂(n) stages of multiplexers and can shift by any amount in a single clock cycle. This is what modern processors use.

Example: Shift by 5 (101₂):

• Stage 1 (bit 0 = 1): Shift by 1 ✓
• Stage 2 (bit 1 = 0): Don't shift
• Stage 3 (bit 2 = 1): Shift by 4 ✓
• Total: shifted by 5

Applications of Shift Operations

Fast Multiplication and Division

Multiply by 10: shift left 3 (×8) + shift left 1 (×2) + add:

Serial Data Transfer

Shift data out one bit at a time for serial communication:

Bit Field Extraction

Extract bits 4-7 from a register:

Cryptography

Many encryption algorithms use rotation operations (circular shifts) as part of their mixing functions.

Shift Operations Summary Table

Key Takeaways

1. Logical shifts fill with zeros — used for unsigned multiplication/division by 2
2. Arithmetic right shift preserves the sign bit — used for signed division by 2
3. Rotate wraps bits around without loss — used in cryptography and multi-word operations
4. Shift left by n = multiply by 2ⁿ (much faster than actual multiplication)
5. Barrel shifters can shift by any amount in one clock cycle using log₂(n) MUX stages
6. Shift operations combined with AND masking enable powerful bit-field manipulation
7. The ALU integrates shift hardware alongside arithmetic and logic units