Searched full:multiplication (Results 1 – 25 of 157) sorted by relevance
1234567
9 * Description: This function make 16 bit unsigned multiplication.10 * To fit the output into 16 bits the 32 bit multiplication result is right19 * Description: This function make 16 bit multiplication and return the result20 * in 16 bits. To fit the multiplication result into 16 bits the multiplication22 * is done to remove the extra sign bit formed due to the multiplication.
574 #define B43_NPHY_RSSIMC_0I_RSSI_X B43_PHY_N(0x1A4) /* RSSI multiplication coefficient 0 I RSSI X */575 #define B43_NPHY_RSSIMC_0I_RSSI_Y B43_PHY_N(0x1A5) /* RSSI multiplication coefficient 0 I RSSI Y */576 #define B43_NPHY_RSSIMC_0I_RSSI_Z B43_PHY_N(0x1A6) /* RSSI multiplication coefficient 0 I RSSI Z */577 #define B43_NPHY_RSSIMC_0I_TBD B43_PHY_N(0x1A7) /* RSSI multiplication coefficient 0 I TBD */578 #define B43_NPHY_RSSIMC_0I_PWRDET B43_PHY_N(0x1A8) /* RSSI multiplication coefficient 0 I power de…579 #define B43_NPHY_RSSIMC_0I_TSSI B43_PHY_N(0x1A9) /* RSSI multiplication coefficient 0 I TSSI */580 #define B43_NPHY_RSSIMC_0Q_RSSI_X B43_PHY_N(0x1AA) /* RSSI multiplication coefficient 0 Q RSSI X */581 #define B43_NPHY_RSSIMC_0Q_RSSI_Y B43_PHY_N(0x1AB) /* RSSI multiplication coefficient 0 Q RSSI Y */582 #define B43_NPHY_RSSIMC_0Q_RSSI_Z B43_PHY_N(0x1AC) /* RSSI multiplication coefficient 0 Q RSSI Z */583 #define B43_NPHY_RSSIMC_0Q_TBD B43_PHY_N(0x1AD) /* RSSI multiplication coefficient 0 Q TBD */[all …]
25 * scale up this constant by 2^31, perform the actual multiplication,70 * division by multiplication: you don't have to worry about
7 …* http://software.intel.com/en-us/articles/carry-less-multiplication-and-its-usage-for-computing-t…64 # carry-less multiplication
115 that uses the 64x64 to 128 bit polynomial multiplication (vmull.p64)147 tristate "NEON accelerated Curve25519 scalar multiplication library"
9 * Integers Using Multiplication" by Torbjörn Granlund and Peter19 * a much faster multiplication operation with a variable dividend A
18 * First tree values in each line are multiplication factor and last78 * First three factors in a row are multiplication factors which have 17 bits81 * value before multiplication and lower 16 bits represents constant, which
231 * Multiplication algorithms:234 /* Given a 1W * 1W => 2W primitive, do the extended multiplication. */262 /* Given a 1W * 1W => 2W primitive, do the extended multiplication.264 where multiplication is much more expensive than subtraction. */323 /* Do at most 120x120=240 bits multiplication using double floating324 point multiplication. This is useful if floating point325 multiplication has much bigger throughput than integer multiply.
121 * Multiplication algorithms:125 multiplication immediately. */136 /* Given a 1W * 1W => 2W primitive, do the extended multiplication. */
95 * remaining multiplication opcodes.180 * Prepare for either multiplication or division loop.355 /* MULTIPLICATION361 * Actual multiplication algorithms don't use repeated addition, however.407 /* Initialize the multiplication loop. */
6 | Core multiplication routine |16 | Basic multiplication routine. |
7 - overflow after multiplication?
23 MODULE_DESCRIPTION("Curve25519 scalar multiplication");
34 MODULE_DESCRIPTION("Curve25519 scalar multiplication");
46 /* Best value of multiplication factor divider */51 * loop multiplication factor.
62 /* Compute multiplication table */ in main()81 /* Compute vector multiplication table */ in main()
21 result from the function call and f4 were used in a multiplication. If the
31 1]; /* Histogram matching multiplication parameter */
32 1]; /** Histogram matching multiplication parameter */
20 arr = CX86_ARR_BASE + (reg << 1) + reg; /* avoid multiplication by 3 */ in cyrix_get_arr()184 arr = CX86_ARR_BASE + (reg << 1) + reg; /* avoid multiplication by 3 */ in cyrix_set_arr()
58 * Inner shift makes sure multiplication doesn't overflow in __ndelay()
43 * Division by multiplication: you don't have to worry about
23 * if executed while an integer multiplication is in progress:
42 * Approximate Division by multiplication:
49 Multiplication factor used to grow per-cpu guest_halt_poll_ns