multiplications
英 [ˌmʌltɪplɪˈkeɪʃənz]
美 [ˌmʌltəpləˈkeɪʃənz]
n. 乘; 相乘; 增加
multiplication的复数
双语例句
- You are to write a program to perform such multiplications and save the world.
你来设计一个程序执行该乘积运算，以拯救世界。 - Compared with the existing schemes without suffering from key escrow, ours achieves higher efficiency since the signing algorithm needs only one scalar multiplication in the additive group while the reverse operation requires only three scalar multiplications. 4.
与已有的无密钥托管的签名方案相比，我们的方案实施效率高：签名算法只需要1个加法群上的标量乘运算，而验证算法仅需3个标量乘运算。 - It requires about n 2 multiplications and additions for each iteration where n is the number of variables.
此算法每次迭代约需n2次乘法和加法，其中n是模型中变量的数目。 - In the domains of multimedia application, image process and so on, plenty of multiplications in cycles make multiplier a significant part, which plays an important role in deciding the performance of the whole CPU.
乘法器是处理器中的一个重要组成部分。在多媒体应用、图像处理等领域中，大量的循环乘法运算使得乘法器的作用尤为突出，其对处理器的整体性能也起到了至关重要的影响。 - The general methods applied for computing divisor scalar multiplications are Binary method and its improved versions.
在实现超椭圆曲线密码体制中起关键作用的运算是除子标量乘，一般采用的方法是二元法及其各种改进的二元法。 - At the same time, the duality result has been proved: two multiplications of loop space Y of pointed space Y obtained by two different ways are homotopic.
同时，也证明了对偶结果：通过两种途径得到点标拓扑空间Y的回路空间ΩY上的两个乘法也是同伦的。 - This paper discusses the software implementation of the elliptic curve digital signature algorithm ( ECDSA) over GF ( 2m), and gives a new way to compute point multiplications based Fixed-Point which improve the speed of digital signature generation and signature checking.
本文讨论了椭圆曲线数字签名算法（ECD-SA）在GF（2~m）域上的软件实现，提出了一种基于固定基的核心点乘运算的快速算法，提高了数字签名和签名验证的速度。 - The alias effects caused by complex-conjugate multiplications on IP quality are analyzed.
研究了干涉图形成过程出现的混叠效应对干涉相位质量的影响。 - This algorithm results in a great reduction of multiplications and simplifies the realization structure of fan filters as compared with the published design procedures.
与已有的设计方法相此，大大减少了扇形滤波器的系数并简化了其实现结构。 - As compared with the FPT algorithm for 2-D cyclic convolutions, the amount of multiplications of the algorithm introduced here decreases by one order of magnitude, and also it relieves the strict restriction of word length about cyclic convolution scale in FNT algorithm of 2-D cyclic convolutions.
与二维循环卷积的FPT算法相比，乘法量减少了一个数量级，同时实际取消了FNT算法中卷积规模所受到的字长的限制。