代码搜索：Multiplication
找到约 1,176 项符合「Multiplication」的源代码
代码结果 1,176
www.eeworm.com/read/346508/3181763
c mul.c
/*
* linux/kernel/math/mul.c
*
* (C) 1991 Linus Torvalds
*/
/*
* temporary real multiplication routine.
*/
#include
static void shift(int * c)
{
__asm__("movl (%0),%%eax ;
www.eeworm.com/read/396844/2407446
m add_ndxb.m
function id = add_ndxB(bigdom, smalldom, ns)
% ADD_MULT_NDX Possibly add new multiplication indexes to the global cache
% id = add_mult_ndx(bigdom, smalldom, ns)
%
% ns is the node sizes of all no
www.eeworm.com/read/365493/2896905
m freq_shear.m
function y = freq_shear(x, c)
% freq_shear -- chirp multiplication
%
% Usage
% y = freq_shear(x, c)
%
% Inputs
% x signal vector, must have an odd length (to have a center point)
% c
www.eeworm.com/read/354345/3078249
c mul.c
/*
* linux/kernel/math/mul.c
*
* (C) 1991 Linus Torvalds
*/
/*
* temporary real multiplication routine.
*/
#include
static void shift(int * c)
{
__asm__("movl (%0),%%eax ;
www.eeworm.com/read/294317/8240698
cpp dmult.cpp
// dynamic programming matrix multiplication chain
// non-recursive solution
#include
#include "make2d.h"
void MatrixChain(int r[], int q, int **c, int **kay)
{// Compute costs a
www.eeworm.com/read/174450/9586883
fp l-mrect.fp
!!FP1.0
#L-M matrix-matrix multiplication
#just for 4*4 matrixs now
#But we can generate the fragmen program in Application.
# 2 + DimensionOfMatirx*5 < 1024
# so the biggest matrix is 204*204
#
www.eeworm.com/read/174450/9586931
fp l-mrect.fp
!!FP1.0
#L-M matrix-matrix multiplication
#just for 4*4 matrixs now
#But we can generate the fragmen program in Application.
# 2 + DimensionOfMatirx*5 < 1024
# so the biggest matrix is 204*204
#
www.eeworm.com/read/201477/15407434
cpp dmult.cpp
// dynamic programming matrix multiplication chain
// non-recursive solution
#include
#include "make2db.h"
void MatrixChain(int r[], int q, int **c, int **kay)
{// Compute costs
www.eeworm.com/read/101661/15822457
txt kalman.txt
Matrix Multiplication Routine
void MatrixMultiply(float* A, float* B, int m, int p, int n, float* C)
{
// A = input matrix (m x p)
// B = input matrix (p x n)
// m = number of rows in A
// p =
www.eeworm.com/read/425892/10311440
vhd r2p_corproc.vhd
library ieee;
use ieee.std_logic_1164.all;
use ieee.std_logic_arith.all;
entity r2p_corproc is
generic
(
RADIUS_CORRECTION : boolean := true; -- Corrects the radius by multiplication wi