multiplications
英 [ˌmʌltɪplɪˈkeɪʃənz]
美 [ˌmʌltəpləˈkeɪʃənz]
n. 乘; 相乘; 增加
multiplication的复数
双语例句
- The optimum paths for multiplications of 7 and 8 are depicted in Figure 6.17.
图6.17中描绘了倍增7倍和8倍的最优路径。 - This algorithm results in a great reduction of multiplications and simplifies the realization structure of fan filters as compared with the published design procedures.
与已有的设计方法相此，大大减少了扇形滤波器的系数并简化了其实现结构。 - The translation of multiplications and titles.
倍数及标题的翻译。 - The window method is used to significantly reduce the number of modular multiplications needed for completing the modular exponentiation.
在设计中还采用了窗口法减少模幂运算过程中所需进行的模乘运算次数，大大提高了处理速度。 - All of these algorithms avoid calculating functions which need much more time, and usually, only 4 additions and 4 multiplications are needed to accurately calculate the coordinates of the Points on the arcs.
这些算法避免了需要较长时间的函数值计算，一般只需进行4次乘法和4次加法运算，就可以由曲线弧上前一点的坐标值精确地计算出下一点的坐标值。 - By proceeding from the general, form of the product of two linear polynomials, this paper presents some skills in seeking 7 multiplications on diagrams for the problem of the product of two 2 × 2 matrices.
本文从两个线性多项式乘积的一般形式出发，讨论用7次乘法求两个2×2矩阵乘积问题，给出了一套在图形上寻找7次乘法的技巧。 - Besides, in order to cut down the enormous Inverse Fast Fourier Transforms ( IFFTs) of CSLM, a new scheme that replaces the IFFT operations with matrix multiplications is presented.
另外，为了减少CSLM算法中繁多的快速傅里叶逆变换（IFFT），提出了一种利用多矩阵相乘代替IFFT运算的新方案。 - The ANALYSATOR HANNOVER evaluates statistically probability density distributions PDD and class frequency distributions CFD of different stochastic variables and calculates from the instantaneous values of welding voltage u and welding current I, the True Electrical Power Input as the linear mean value of all multiplications UI.
汉诺威分析仪采用统计学的概率密度分布PDD和频段分布（CFD）方法对不同的随机变量进行评定，通过对瞬间焊接电流（I）与电弧电压（U）乘积的计算而获得真实电能功率。 - This multiplier has two working modes, normal mode and SIMD mode which support 16-bit multiplication or two 8-bit multiplications respectively.
该乘法器有两种工作模式，普通模式和SIMD模式，可以支持16位整数乘法或2个8位乘法。 - 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）域上的软件实现，提出了一种基于固定基的核心点乘运算的快速算法，提高了数字签名和签名验证的速度。