Reducing the number of embedded multipliers in squaring large size complex numbers

To square large size complex numbers using n×n embedded multipliers as in using FPGAs, one needs to first partition the real and imaginary parts into segments of size less or equal to n and then to multiply the segments using these embedded multipliers. When the size of some segments is small, we show that three multiplications can be carried out using one n×n multiplier thus two n×n embedded multipliers can be saved. The idea is also applicable in carrying out two small squarers using one n×n embedded multiplier.