.png){kind=icon}
返回
Fast binary multiplication by performing dot counting and complement recoding
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2007.02.136.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we present a new computation method by combining the dots counting method and the complement recoding method to efficiently evaluate modular multiplication in binary multiplications. The LUT (Look-Up Table) technique can be adopted in our proposed method to efficiently reduce the number of multiplications. And the proposed method can be easily implemented for the hardware. Numerous examples are provided to show the efficient and easy operations of the binary multiplication method. In average case, the worst case for the Hamming weight of the product X*Y is uv/4, where u is the bit-length of multiplicand X, v is the bit-length of multiplier Y. If the proposed method is applied, we could effectively reduce the Hamming weight of the product X*Y to 0.25u. (c) 2007 Elsevier Inc. All rights reserved.
Keyword:
look-up table
Hamming weight
binary multiplication
complement recoding method
dots counting method
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
.png){kind=icon}
Focused Intervention for Cervical Cancer 76 Screening Improved Screening Rates at Ryan White Funded Clinic针对宫颈癌筛查76的聚焦干预提高了瑞安·怀特资助诊所的筛查率
PREAI
分享收藏 没有更多内容
没有更多内容