More efficient systolic arrays for multiplication in GF(2m) using LSB first algorithm with irreducible polynomials and trinomials

  • Authors:

  • Soonhak Kwon;Chang Hoon Kim;Chun Pyo Hong

  • Affiliations:

  • Institute of Basic Science and Department of Mathematics, Sungkyunkwan University, Suwon 440-746, Republic of Korea;School of Computer and Information Technology, Daegu University, Kyungsan 712-714, Republic of Korea;School of Computer and Communication Engineering, Daegu University, Kyungsan 712-714, Republic of Korea

  • Venue:
  • Computers and Electrical Engineering
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Systolic arrays for multiplication in GF(2^m) of Yeh et al. with LSB (least significant bit) first algorithm have the unfavorable properties such as increased area complexity and bidirectional data flows compared with the arrays of Wang and Lin with MSB (most significant bit) first algorithm. In this paper, by using a polynomial basis with LSB first algorithm, we present new bit parallel and bit serial systolic arrays over GF(2^m). Our bit parallel systolic multiplier has unidirectional data flows with seven latches in each basic cell. Also our bit serial systolic array has only one control signal with eight latches in each basic cell. Thus our new arrays with LSB first algorithm have shorter critical path delay, comparable hardware complexity, and have the same unidirectional data flows compared with the arrays using MSB first algorithm. We also present new linear systolic arrays for multiplication in GF(2^m) using irreducible trinomial x^m+x^k+1. It is shown that our linear arrays with trinomial basis have reduced hardware complexity since they require two fewer latches than the linear systolic arrays using general irreducible polynomials.