代码搜索：Multiplication

找到约 1,176 项符合「Multiplication」的源代码

代码结果 1,176
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/386996/8714311

c montexpo.c

/* Author: Pate Williams (c) 1997 Montgomery exponentiation. See "Handbook of Applied Cryptography" by Alfred J. Menezes et al Section 14.6.1 pages 614 - 620. */ #include
·
www.eeworm.com/read/428852/8833106

c msp430x54x_mpy_15.c

//****************************************************************************** // msp430FG5438 Demo - Fractional mode, Q15 multiplication // // Description: The example illustrates multiplic
·
www.eeworm.com/read/428794/8840932

c msp430x47xx_mpy_15.c

//****************************************************************************** // MSP430x47xx Demo - Fractional mode, Q15 multiplication // // Description: The example illustrates multiplica
·
www.eeworm.com/read/365862/9843030

m gmm_distance_bayes.m

function D = gmm_distance_bayes(g1, g2) % Normalising constant from Gmm multiplication D = 0; for i=1:size(g1.x,2) for j=1:size(g2.x,2) wij = gauss_likelihood(g1.x(:,i)-g2.x(:,j),
·
www.eeworm.com/read/362834/9979361

v ff_mul.v

// Finite fields multiplication // Primitive olynomial: p(x) = x^8 + x^4 + x^3 + x^2 + 1 // Polynomial basis: {1, a^1, a^2, a^3, a^4, a^5, a^6, a^7} // Weak dual basis: {1+a^2, a^1, 1, a^7, a^6,
·
www.eeworm.com/read/161095/10452349

h slu_dcomplex.h

/* * -- SuperLU routine (version 2.0) -- * Univ. of California Berkeley, Xerox Palo Alto Research Center, * and Lawrence Berkeley National Lab. * November 15, 1997 * */ #ifndef __SUPERLU_DCOMPL
·
www.eeworm.com/read/161095/10452675

h slu_scomplex.h

/* * -- SuperLU routine (version 2.0) -- * Univ. of California Berkeley, Xerox Palo Alto Research Center, * and Lawrence Berkeley National Lab. * November 15, 1997 * */ #ifndef __SUPERLU_SCOMPL
·
www.eeworm.com/read/351998/10589060

m gmm_distance_bayes.m

function D = gmm_distance_bayes(g1, g2) % Normalising constant from Gmm multiplication D = 0; for i=1:size(g1.x,2) for j=1:size(g2.x,2) wij = gauss_likelihood(g1.x(:,i)-g2.x(:,j),
·
www.eeworm.com/read/349581/10816012

h complex.h

#ifndef COMPLEX_H #define COMPLEX_H class vector; class complex { private: m_real p[2]; // negation friend complex operator-( complex const& ); // addtion
·
www.eeworm.com/read/339749/7071263

v ff_mul.v

// Finite fields multiplication // Primitive olynomial: p(x) = x^8 + x^4 + x^3 + x^2 + 1 // Polynomial basis: {1, a^1, a^2, a^3, a^4, a^5, a^6, a^7} // Weak dual basis: {1+a^2, a^1, 1, a^7, a^6,
·