PROJECT TITLE :
Low-Complexity Digit-Serial Multiplier Over GF(2m) Based on Efficient Toeplitz Block Toeplitz Matrix–Vector Product Decomposition - 2017
In this paper, we tend to have shown that a regular Toeplitz matrix-vector product (TMVP) will be remodeled into a Toeplitz block TMVP (TBTMVP) using a suitable permutation matrix. Primarily based on the TBTMVP illustration, we have proposed a new (a,b)-approach TBTMVP decomposition algorithm for implementing a digit-serial multiplication. Moreover, it is shown that, based on iterative block recombination, we tend to will improve the area complexity of the proposed TBTMVP decomposition. From the synthesis results, we have shown that the proposed TBTMVP-based multiplier involves less space, less space-delay product, and better throughput compared with the existing digit-serial multipliers.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here