کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
455381 695364 2009 9 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
More efficient systolic arrays for multiplication in GF  (2m2m) using LSB first algorithm with irreducible polynomials and trinomials
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر شبکه های کامپیوتری و ارتباطات
پیش نمایش صفحه اول مقاله
More efficient systolic arrays for multiplication in GF  (2m2m) using LSB first algorithm with irreducible polynomials and trinomials
چکیده انگلیسی

Systolic arrays for multiplication in GF(2m)GF(2m) 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(2m)GF(2m). 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(2m)GF(2m) using irreducible trinomial xm+xk+1xm+xk+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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Electrical Engineering - Volume 35, Issue 1, January 2009, Pages 159–167
نویسندگان
, , ,