Article ID Journal Published Year Pages File Type
539521 Integration, the VLSI Journal 2016 12 Pages PDF
Abstract

•We propose explicit formulae of the Mastrovito matrix for a pentanomial.•We propose explicit formulae of the Toeplitz matrix for a pentanomial.•We give the complexity of the Toeplitz matrix for a pentanomial.•We give the complexity of a multiplier based on TMVP for a pentanomial.•We give conditions on pentanomials for an efficient multiplier based on the TMVP.

We propose explicit formulae of the Mastrovito matrix M and its corresponding Toeplitz matrix T for an arbitrary irreducible pentanomial using shifted polynomial basis. We also give the complexity of the Toeplitz matrix for a pentanomial. This yields the complexity of a multiplier based on Toeplitz matrix–vector product (TMVP) for an arbitrary irreducible pentanomial for the first time. Moreover, we introduce a new type of pentanomials for which a multiplier based on TMVP is efficiently implemented. We show that the complexity of a subquadratic space complexity multiplier for such a special type of pentanomials is comparable with that for trinomials.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Hardware and Architecture
Authors
, , , ,