Two binary numbers can be multiplied in the same method used to multiply two decimal numbers. The figure below shows an example of multiplying $1411=154.$ In this part, we focus on building an unsigned number multiplier, because signed number multiplication is more complex.

A binary multiplier can be implemented using several stages of full$-$adder $($FA$)$ blocks connected in a ripple$-$carry configuration. However, the delay caused by the carry signal rippling through the different FA blocks and the different stages can cause a significant impact on the time needed to generate a correct product result. The carry$-$save array configuration, is a binary multiplier that reduces the delay effect and produces correct results faster. The diagram below shows a $4-$bit multiplier circuit arranged in a carry$-$save array configuration.