Efficient Digit-Serial KA-Based Multiplier Over Binary Extension Fields Using Block Recombination Approach

文化大學機構典藏 CCUR > 理工學院 > 工學院 > 資訊工程學系 > 期刊論文 > Item 987654321/30576

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://irlib.pccu.edu.tw/handle/987654321/30576

题名:	Efficient Digit-Serial KA-Based Multiplier Over Binary Extension Fields Using Block Recombination Approach
作者:	Liu, Chung-Hsin Lee, Chiou-Yng Meher, Pramod Kumar
贡献者:	Dept Comp Sci & Informat Engn
关键词:	Block recombination architecture digit-serial multiplication finite field Karatsuba algorithm
日期:	2015-08
上传时间:	2015-10-20 15:52:44 (UTC+8)
摘要:	It is well-known that the (a, b)-way Karatsuba algorithm (KA) with a not equal b is used for efficient digit-serial multiplication with subquadratic space complexity architecture. In this paper, based on (a, b)-way KA decomposition, we have derived a novel kappa-way block recombination KA (BRKA) decomposition for digit-serial multiplication. The proposed kappa-way BRKA is formed by a power of 2 polynomial decomposition. By theoretical analysis, it is shown that kappa-way BRKA can provide the necessary tradeoff between space and time complexity. Using (4,2)-way KA to construct the proposed kappa-way BRKA architecture in GF(2(409)), it is shown that the proposed 2-way BRKA approach requires less area, and the proposed 8-way BRKA approach requires less computation time and less area-time product compared to compared the existing (a, b)-way KA decomposition.
關聯:	IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS 卷: 62 期: 8 頁碼: 2044-2051
显示于类别:	[資訊工程學系] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	404	检视/开启

检视Licence

在CCUR中所有的数据项都受到原著作权保护.