Fast FPGA-Based Multipliers by Constant for Digital Signal Processing Systems

Abstract

Traditionally, the usual multipliers are used to multiply signals by a constant, but multiplication by a constant can be considered as a special operation requiring the development of specialized multipliers. Different methods are being developed to accelerate multiplications. A large list of methods implement multiplication on a group of bits. The most known one is Booth’s algorithm, which implements two-digit multiplication. We propose a modification of the algorithm for the multiplication by three digits at the same time. This solution reduces the number of partial products and accelerates the operation of the multiplier. The paper presents the results of a comparative analysis of the characteristics of Booth’s algorithm and the proposed algorithm. Additionally, a comparison with built-in FPGA multipliers is illustrated.

Efficient Algorithms and Architectures for DSP Applications

“…In [11], Bureneva and Mironov propose a modification of the Booth's algorithm for the multiplication by three digits at the same time (on a group of bits). The developed version reduces the number of partial products and the depth of the tree that performs the parallel summation of them.…”