欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
为了减少双基数表示时间，提出双基数子集的概念，将存储空间和预计算时间从n^2降低到3n-2，同时给出求子集表示的贪婪算法．给出基于双基数子集的标量乘算法，由于搜索空间的降低，整数的双基数子集表示个数稍微多于双基数表示个数，新算法使用混合坐标进行优化．从运算量、存储空间上，将新算法分别与传统固定基点的窗口算法和Dimitrov的基于双基数链的算法进行比较，结果证明新算法显著优于前人算法．
英文摘要：
A new algorithm based on subset of double-base number system（DBNS） was proposed in order to improve the efficiency of scalar multiplication. The concept of subset of DBNS was described, and storagespaee and precomputation time were decreased from tz2 to 3n -2. A greedy algorithm was deduced to compute the DBNS chain at the same time. The number of 2-integers is smaller, so that the length of DBNS chain becomes a little longer. Mixed-coordinate was used to optimize the algorithm. The new rithm was compared with the traditional fixed-point window algorithm and Dimitrov method, and the resuits show that the new algorithm is more efficient in computation time and storage space than others.
同期刊论文项目
同项目期刊论文
期刊信息
位置：