Area-Delay Efficient Digit-Serial Multiplier Based on -Partitioning Scheme Combined With TMVP Block Recombination Approach

摘要

Shifted polynomial basis (SPB) and generalized polynomial basis (GPB) are two efficient bases of representation in binary extension fields, and are widely studied. In this paper, we use the GPB formulation to derive a new modified SPB (MSPB) representation for arbitrary irreducible trinomials and pentanomials. It is shown that the basis conversion from the MSPB to the SPB for trinomials is free of hardware cost. We have shown that multiplication based on SPB and MSPB representations can make use of Toeplitz matrix–vector product (TMVP) formulation. The existing TMVP block recombination (TMVPBR) approach is used here to derive an efficient -partitioning TMVPBR decomposition for digit-serial double basis multiplication that can achieve subquadratic space complexity. From synthesis results, we have shown that the proposed multiplier has less area and less area-delay product compared with the existing digit-serial multipliers. We also show that the proposed multiplier using -partitioning TMVPBR decomposition can provide a better tradeoff between time and space complexities.