%0 Journal Article
%T Unified Parallel Systolic Multiplier Over GF(2m)<br>Unified Parallel Systolic Multiplier Over GF(2^m)
%A Chiou-Yng Lee
%A Yung-Hui Chen
%A Che-Wun Chiou
%A Jim-Min Lin
%A <br>Chiou-Yng Lee
%A Yung-Hui Chen
%A Che-Wun Chiou
%A and Jim-Min Lin
%J 计算机科学技术学报
%D 2007
%I 
%X In general, there are three popular basis representations, standard (canonical, polynomial) basis, normal basis, and dual basis, for representing elements in GF(2m). Various basis representations have their distinct advantages and have their different associated multiplication architectures. In this paper, we will present a unified systolic multiplication architecture, by employing Hankel matrix-vector multiplication, for various basis representations. For various element representation in GF(2m), we will show that various basis multiplications can be performed by Hankel matrix-vector multiplications. A comparison with existing and similar structures has shown that the proposed architectures perform well both in space and time complexities.
%K Hankel matrix-vector multiplication
%K bit-parallel systolic multiplier
%K Galois field GF(2m)<br>乘法器
%K 运算器
%K 有限域
%K 电子数字计算机
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=CBCDFFE5AEBDB1BF507776F01A39122E&yid=A732AF04DDA03BB3&vid=BC12EA701C895178&iid=CA4FD0336C81A37A&sid=D3E34374A0D77D7F&eid=16D8618C6164A3ED&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=0&reference_num=30