Loading web-font TeX/Math/Italic
Subquadratic Space Complexity Multiplier Using Even Type GNB Based on Efficient Toeplitz Matrix-Vector Product | IEEE Journals & Magazine | IEEE Xplore

Subquadratic Space Complexity Multiplier Using Even Type GNB Based on Efficient Toeplitz Matrix-Vector Product


Abstract:

Multiplication schemes based on Toeplitz matrix-vector product (TMVP) have been proposed by many researchers. TMVP can be computed using the recursive two-way and three-w...Show More

Abstract:

Multiplication schemes based on Toeplitz matrix-vector product (TMVP) have been proposed by many researchers. TMVP can be computed using the recursive two-way and three-way split methods, which are composed of four blocks. Among them, we improve the space complexity of the component matrix formation (CMF) block. This result derives the improvements of multiplication schemes based on TMVP. Also, we present a subquadratic space complexity GF(2^m) multiplier with even type Gaussian normal basis (GNB). In order to design the multiplier, we formulate field multiplication as a sum of two TMVPs and efficiently compute the sum. As a result, for type 2 and 4 GNBs, the proposed multipliers outperform other similar schemes. The proposed type 6 GNB is the first subquadrtic space complexity multiplier with its explicit complexity formula.
Published in: IEEE Transactions on Computers ( Volume: 67, Issue: 12, 01 December 2018)
Page(s): 1794 - 1805
Date of Publication: 15 May 2018

ISSN Information:

Funding Agency:


References

References is not available for this document.