multiplications信息详情
n.乘法；大量增加
multiply by───乘以；乘上
countercurrent multiplier───逆流倍增器
scoop up multiple───挖起多个
exerts multiple adverse───施加多重不利影响
multiplicity───n.多样性；[物]多重性
multiple choice questions───多项选择题；[经]多种选择问题
multiple system───多系统；[电]多路系统；多机系统，多路系统，并联式
multiplier symbols───倍增符号
least common multiple───n.最小公倍数；n.[数]最小公倍数
multiplying tariffs───倍增关税
Modul ar exponentiation algorithm scans encryption from right to sot, so t wo modular multiplications can be processed parallelly.───模幂算法采用从右到左扫描指数的方法，可以使得两次模乘运算同时进行。
We are interested in the number of divisions, multiplications, and total number of steps until a reaches 1.───我们对到a变为1为止所经历的除法、乘法的次数以及总共经历的步数感兴趣。
polynomial multiplication is performed by sub-polynomial multiplications and additions.───多项式乘法由子多项式的乘法和加法实现。
According to a few examples for filter banks with typical structures, the number of multiplications and additions are figured out.───最后以几种典型滤波器组应用结构为例，给出了所需乘加运算次数。
For instance , the compiler may further optimize the code from above to round some of the intermediate multiplications to single precision .───例如，编译器可以进一步优化上述代码，将某些中间乘法舍入到单精度。
Second, the procedure of Montgomery modular square algorithm is modified to reduce the required number of single-precision multiplications.───其次对蒙哥马利模平方运算的算法流程进行优化，减少其中单精度乘法的执行次数。
The inherent parallel-processing potential is fully exploited by optical implementation of multiplications and summations.───固有的并行处理的潜力得到充分利用光学执行乘法和总结。
Coefficients of the multipliers are transformed into CSD forms and the multiplications are substitute by minimum shift-add operations.───把乘法器系数表示为CSD形式，将常系数乘法优化为最少的移位加操作。
Multiplier and multiplicand were distinguished on multiplications with different coding methods.───对不同编码方式的乘法器，识别乘数和被乘数的结合顺序。
The polynomial multiplication is performed by sub-polynomial multiplications and additions.
Modul ar exponentiation algorithm scans encryption from right to sot, so t wo modular multiplications can be processed parallelly.
The optimum paths for multiplications of 7 and 8 are depicted in Figure 6.17.
In 1614, John Napier discovered the logarithm which made it possible to perform multiplications and divisions by addition and subtraction.
Multiplier and multiplicand were distinguished on multiplications with different coding methods.
But it could perform 50 multiplications per second, a feat unmatchable by either a human or the latest adding machine.