multiplications
英 [ˌmʌltɪplɪˈkeɪʃənz]
美 [ˌmʌltəpləˈkeɪʃənz]
n. 乘; 相乘; 增加
multiplication的复数
双语例句
- It requires about n 2 multiplications and additions for each iteration where n is the number of variables.
此算法每次迭代约需n2次乘法和加法，其中n是模型中变量的数目。 - Experiment results indicate that the proposed algorithms can save up to 1/ 3 and 1/ 2 multiplications, compared with traditional Self-Organizing Mapping learning algorithm.
实验表明，相对于传统的自组织映射学习算法，所提两种方法分别可以节约近1/3和1/2以上的计算量。 - A symmetric generator polynomial was applied, and the number of Galois-field ( GF) multiplications was reduced in the encoder.
在编码器中，采用系数对称的生成多项式，减少了迦罗华域（GF）乘法器的个数。 - Finally, the methods to finding the spheroidal wave functions were also discussed the case when the multiplications of wavenumber and focus length were up to10 for oblate spheroid.
最后并对求解所需之椭圆体波动函数之求法加以研究，并延伸至较高频率之情况，本文提出之方法可求得准确之特徵值。 - The window method is used to significantly reduce the number of modular multiplications needed for completing the modular exponentiation.
在设计中还采用了窗口法减少模幂运算过程中所需进行的模乘运算次数，大大提高了处理速度。 - 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）域上的软件实现，提出了一种基于固定基的核心点乘运算的快速算法，提高了数字签名和签名验证的速度。 - This algorithm needs only O ( N) multiplications.
这种算法的乘法计算量仅为O（N）； - 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运算的新方案。 - 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算法中卷积规模所受到的字长的限制。