代码搜索：Generates
找到约 10,000 项符合「Generates」的源代码
代码结果 10,000
www.eeworm.com/read/355485/10262014
asv sefade.asv
% sefade.m
%
% This function generates frequency selecting fading
%
function [iout,qout,ramp,rcos,rsin]=sefade(idata,qdata,itau,...
dlvl,th,n0,itn,n1,nsamp,tstp,fd,flat)
%***************
www.eeworm.com/read/355485/10262034
m sefade.m
% sefade.m
%
% This function generates frequency selecting fading
%
function [iout,qout,ramp,rcos,rsin]=sefade(idata,qdata,itau,...
dlvl,th,n0,itn,n1,nsamp,tstp,fd,flat)
%***************
www.eeworm.com/read/355484/10262136
asv sefade.asv
% sefade.m
%
% This function generates frequency selecting fading
%
function [iout,qout,ramp,rcos,rsin]=sefade(idata,qdata,itau,...
dlvl,th,n0,itn,n1,nsamp,tstp,fd,flat)
%***************
www.eeworm.com/read/355484/10262150
m sefade.m
% sefade.m
%
% This function generates frequency selecting fading
%
function [iout,qout,ramp,rcos,rsin]=sefade(idata,qdata,itau,...
dlvl,th,n0,itn,n1,nsamp,tstp,fd,flat)
%***************
www.eeworm.com/read/354492/10349574
c alg43.c
#include
#include
#include
/* generates:
original element sequence:
29 23 20 22 12 17 15 26 51 19 12 23 35 40
stable sort -- default ascending order
www.eeworm.com/read/354492/10349576
c alg38.c
#include
#include
#include
/* generates:
original element sequence:
0 1 1 2 3 5 8 13 21 34
sequence after applying remove_if < 10:
13 21 34
www.eeworm.com/read/354492/10349583
c alg45.c
#include
#include
#include
/* generates:
original element sequence:
29 23 20 22 17 15 26 51 19 12 35 40
stable_partition on even element:
20 22
www.eeworm.com/read/354492/10349671
c alg32.c
#include
#include
#include
#include
/*
* generates:
original array values: 3 5 8 13 21
transform each element by doubling: 6 10 16 26 42
tr
www.eeworm.com/read/279421/10439109
m gaussn.m
function g = gaussn(f0,n)
% function gn = gaussn(f0,n) : generates the order n derivative of the
% gaussian window, centered at frequency f0
% The wavelet gn is real, but it is its analytic form
www.eeworm.com/read/161189/10440148
m examp.m
%
% This script generates the Shaw example from chapter 4 of the book.
%
%
% First, clear and reset the RNG states.
%
clear
randn('state',0);
rand('state',0);
%
% Build the n=20 Shaw problem.
%
[G,m,d