代码搜索：coefficient
找到约 3,200 项符合「coefficient」的源代码
代码结果 3,200
www.eeworm.com/read/352501/10546058
c fir4ways.c
//FIR4ways.c FIR with alternative ways of storing/updating samples
#include "bp41.cof" //BP @ 1 kHz coefficient file
#define METHOD 'D' //change to B or C or D
int yn = 0;
www.eeworm.com/read/276024/10773186
m gvf.m
function [u,v] = GVF(f, mu, ITER)
%GVF Compute gradient vector flow.
% [u,v] = GVF(f, mu, ITER) computes the
% GVF of an edge map f. mu is the GVF regularization coefficient
% and ITER is the n
www.eeworm.com/read/244471/12861398
m gvf.m
function [u,v] = GVF(f, mu, ITER)
%GVF Compute gradient vector flow.
% [u,v] = GVF(f, mu, ITER) computes the
% GVF of an edge map f. mu is the GVF regularization coefficient
% and ITER is t
www.eeworm.com/read/243168/12957495
c firprnbuf.c
//FIRPRNbuf.c FIR filter with input noise sequence & output in buffer
#include "bp41.cof" //BP @ 1 kHz coefficient file
#include "noise_gen.h" //header file for noise sequence
int yn =
www.eeworm.com/read/243168/12957732
c scram16k.c
//Scram16k.c Voice scrambler/de-scrambler program
#include "sine160.h" //sine data values
#include "LP114.cof" //filter coefficient file
short filtmodfilt(short data
www.eeworm.com/read/243168/12957798
c fir4ways.c
//FIR4ways.c FIR with alternative ways of storing/updating samples
#include "bp41.cof" //BP @ 1 kHz coefficient file
#define METHOD 'D' //change to B or C or D
int yn = 0;
www.eeworm.com/read/311447/13630886
m dmaxflat.m
function h = dmaxflat(N,d)
% returns 2-D diamond maxflat filters of order 'N'
% the filters are nonseparable and 'd' is the (0,0) coefficient, being 1 or 0 depending on use
% by Arthur L. da Cun
www.eeworm.com/read/301928/13845615
m gvf.m
function [u,v] = GVF(f, mu, ITER)
%GVF Compute gradient vector flow.
% [u,v] = GVF(f, mu, ITER) computes the
% GVF of an edge map f. mu is the GVF regularization coefficient
% and ITER is t
www.eeworm.com/read/147682/5728115
m asptbnlms.m
% [w,x,y,e,p]=asptbnlms(x,xn,dn,w,mu,p,b)
%
% Performs filtering and coefficient update using the
% Block Normalized Least Mean Squares (BNLMS) algorithm.
% BNLMS updates the N filter c
www.eeworm.com/read/147682/5728139
m asptftrls.m
% [ff,bb,k,cf,b,g,w]=asptftrls(ff,bb,k,cf,b,g,w,a,x,d)
%
% Performs filtering and coefficient update using the
% Fast Transversal Recursive Least Squares (FTRLS) algorithm,
% also known