Understanding Digital Multiplication Through Array Logic
An Array Multiplier is a combinational digital circuit that performs binary multiplication using a systematic arrangement of logic gates. It multiplies two binary numbers by implementing the traditional multiplication algorithm in hardware, using a grid of AND gates and adders arranged in a regular pattern.

Figure 1: Architecture of a 2-bit by 2-bit Array Multiplier
For two 2-bit numbers a = a₁a₀ and b = b₁b₀, the multiplication produces a 4-bit result c = c₃c₂c₁c₀.

Figure 2: 4-bit by 3-bit Array Multiplier showing adder network architecture
The 4-bit array multiplier extends the concept by using multiple rows of AND gates and a network of full adders arranged in a systematic array structure.
Generate partial products by ANDing each bit of one multiplicand with each bit of the other
Sum two bits producing sum and carry outputs (used in first row)
Sum three bits including carry-in from previous stage (used in subsequent rows)
Propagates carries through the adder network to generate final result
| Parameter | n-bit Array Multiplier | Notes |
|---|---|---|
| Delay | O(n) | Linear with bit width due to carry propagation |
| Area | O(n²) | Requires n² AND gates and approximately n² adders |
| Power | Medium | All gates active simultaneously |
| Regularity | High | Regular structure simplifies layout and design |
Try multiplying two 4-bit binary numbers!