More efficient systolic arrays for multiplication in GF() using LSB first algorithm with irreducible polynomials and trinomials
✍ Scribed by Soonhak Kwon; Chang Hoon Kim; Chun Pyo Hong
- Book ID
- 104014501
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 416 KB
- Volume
- 35
- Category
- Article
- ISSN
- 0045-7906
No coin nor oath required. For personal study only.
✦ Synopsis
a b s t r a c t 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.