Area-Delay Efficient Digit-Serial Multiplier Based on k-Partitioning Scheme Combined With TMVP Block Recombination Approach

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

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

题名:	Area-Delay Efficient Digit-Serial Multiplier Based on k-Partitioning Scheme Combined With TMVP Block Recombination Approach
作者:	Lee, CY (Lee, Chiou-Yng) Meher, PK (Meher, Pramod Kumar) Liu, CH (Liu, Chung-Hsin)
贡献者:	資工系
关键词:	Block recombination digit-serial multiplication Karatsuba algorithm (KA) shifted polynomial basis (SPB) subquadratic space complexity
日期:	2016-07
上传时间:	2017-04-13 09:25:46 (UTC+8)
摘要:	Shifted polynomial basis (SPB) and generalized polynomial basis (GPB) are two efficient bases of representation in binary extension fields, and are widely studied. In this paper, we use the GPB formulation to derive a new modified SPB (MSPB) representation for arbitrary irreducible trinomials and pentanomials. It is shown that the basis conversion from the MSPB to the SPB for trinomials is free of hardware cost. We have shown that multiplication based on SPB and MSPB representations can make use of Toeplitz matrix-vector product (TMVP) formulation. The existing TMVP block recombination (TMVPBR) approach is used here to derive an efficient k-partitioning TMVPBR decomposition for digit-serial double basis multiplication that can achieve subquadratic space complexity. From synthesis results, we have shown that the proposed multiplier has less area and less area-delay product compared with the existing digit-serial multipliers. We also show that the proposed multiplier using k-partitioning TMVPBR decomposition can provide a better tradeoff between time and space complexities.
關聯:	IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS 卷: 24期: 7 頁碼: 2413-2425
显示于类别:	[資訊工程學系] 期刊論文

文件中的档案:

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

检视Licence

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

数据加载中.....