Partitioned systolic multiplier for GF(2m)

This paper presents a partitioned systolic array with an arbitrary number of PEs for MSB-first approach multiplication in GF(2^m) based on the polynomial representation. As compared to the related multipliers presented by Wang et al. the proposed partitioned systolic array requires significantly small number of basic cells. It requires only m/2 number of basic cells and has the same throughput rate as when it has 2 bands. The proposed systolic array architecture has an arbitrary number of PEs using the partitioning concept although it suffers a little loss of computation times