科研之友
微信
新浪微博
Facebook
分享链接
摘要
Given a natural number e, an addition chain for e is a finite sequence of numbers having the following properties: (1) the first number is one, (2) every element is the sum of two earlier elements, and (3) the given number occurs at the end of the sequence. We introduce a fast optimal algorithm to generate a chain of short length for the number e of n-bits. The algorithm is based on the right-left binary strategy and barrel shifter circuit. The algorithm uses processors and runs in time under exclusive read exclusive write parallel random access machine.
- 出版日期2018-1
