Reduction of the number of iteration steps or stages, e.g. using the Booth algorithm, log-sum, odd-even {by using multiple bit scanning, i.e. by decoding groups of successive multiplier bits in order to select an appropriate precalculated multiple of the multiplicand as a partial product overlapped, i.e. with successive bitgroups sharing one or more bits being recoded into signed digit representation, e.g. using the Modified Booth Algorithm}
Currently, there are no issues on this topic.