Loading web-font TeX/Math/Italic
Low-Complexity Digit-Serial Multiplier Over <span class="MathJax_Preview" style="">GF(2^{m})</span><script type="math/tex" id="MathJax-Element-1">GF(2^{m})</script> Based on Efficient Toeplitz Block Toeplitz Matrix–Vector Product Decomposition | IEEE Journals & Magazine | IEEE Xplore

Low-Complexity Digit-Serial Multiplier Over GF(2^{m}) Based on Efficient Toeplitz Block Toeplitz Matrix–Vector Product Decomposition


Abstract:

In this paper, we have shown that a regular Toeplitz matrix-vector product (TMVP) can be transformed into a Toeplitz block TMVP (TBTMVP) using a suitable permutation matr...Show More

Abstract:

In this paper, we have shown that a regular Toeplitz matrix-vector product (TMVP) can be transformed into a Toeplitz block TMVP (TBTMVP) using a suitable permutation matrix. Based on the TBTMVP representation, we have proposed a new (a,b)-way TBTMVP decomposition algorithm for implementing a digit-serial multiplication. Moreover, it is shown that, based on iterative block recombination, we can improve the space complexity of the proposed TBTMVP decomposition. From the synthesis results, we have shown that the proposed TBTMVP-based multiplier involves less area, less area-delay product, and higher throughput compared with the existing digit-serial multipliers.
Page(s): 735 - 746
Date of Publication: 23 September 2016

ISSN Information:


References

References is not available for this document.