.png){kind=icon}
返回
Low-complexity bit-parallel dual basis multipliers using the modified Booth's algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compeleceng.2005.09.002.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
New bit-parallel dual basis multipliers using the modified Booth's algorithm are presented. Due to the advantage of the modified Booth's algorithm, two bits are processed in parallel for reduction of both space and time complexities. A multiplexer-based structure has been proposed for realization of the proposed multiplication algorithm. We have shown that our multiplier saves about 9% space complexity as compared to other existing multipliers if the generating polynomial is trinomial or all one polynomial. Furthermore, the proposed multiplier is faster than existing multipliers. (c) 2005 Elsevier Ltd. All rights reserved.
Keyword:
dual basis
finite field multiplication
Booth's algorithm
trinomials
polynomial basis
all one polynomial
equally spaced polynomial
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.9
论文数:
6.7K
被引数:
1.3W
机构
暂无机构信息
引用论文
UNC9426, A SELECTIVE TYRO3 INHIBITOR, DECREASES HUMAN PLATELET ACTIVATION AND INCREASES SURVIVAL IN A MURINE PULMONARY EMBOLISM MODELUNC9426，一种选择性TYRO3抑制剂，降低了人血小板活化并提高了小鼠肺栓塞模型中的存活率。
.png){kind=icon}
PREAI
分享收藏TEMPORAL TRENDS AND PREDICTORS OF VENOUS THROMBOEMBOLISM IN HOSPITALIZED CHRONIC LYMPHOCYTIC LEUKEMIA PATIENTS慢性淋巴细胞白血病住院患者的静脉血栓栓塞症的时序趋势和预测因素
PREAI
分享收藏Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
PREAI
分享收藏
查看更多内容