代码搜索:Generates

找到约 10,000 项符合「Generates」的源代码

代码结果 10,000
www.eeworm.com/read/187250/8838571

m genrand.m

function Datatx = genrand(NumSymb,wordsize,NumCarr) %GENRAND Generates random data to transmit % Datatx = genrand(NumSymb,wordsize,NumCarr) Datatx = floor(rand(NumSymb,NumCarr)*(2^wordsize));
www.eeworm.com/read/187250/8838619

m genrand.m

function Datatx = genrand(NumSymb,wordsize,NumCarr) %GENRAND Generates random data to transmit % Datatx = genrand(NumSymb,wordsize,NumCarr) Datatx = floor(rand(NumSymb,NumCarr)*(2^wordsize));
www.eeworm.com/read/187250/8838670

m genrand.m

function Datatx = genrand(NumSymb,wordsize,NumCarr) %GENRAND Generates random data to transmit % Datatx = genrand(NumSymb,wordsize,NumCarr) Datatx = floor(rand(NumSymb,NumCarr)*(2^wordsize));
www.eeworm.com/read/187078/8858516

m th.m

% % FUNCTION 2.3 : "cp0201_TH" % % Generates a pseudorandom Time Hopping code % with periodicity 'Np' and cardinality 'Nh' % % Programmed by Guerino Giancola % function THcode=TH(Nh,Np) %
www.eeworm.com/read/187078/8858545

m bits.m

% % FUNCTION 2.1 : "cp0201_bits" % % Generates a stream of equiprobable binary values ('bits') % The number of bits ('numbits') is an input parameter % % Programmed by Guerino Giancola % fun
www.eeworm.com/read/187078/8858555

asv th.asv

% % FUNCTION 2.3 : "cp0201_TH" % % Generates a pseudorandom Time Hopping code % with periodicity 'Np' and cardinality 'Nh' % % Programmed by Guerino Giancola % function THcode=TH(Nh,Np) %
www.eeworm.com/read/187074/8858634

m bits.m

% % FUNCTION 2.1 : "cp0201_bits" % % Generates a stream of equiprobable binary values ('bits') % The number of bits ('numbits') is an input parameter % % Programmed by Guerino Giancola % fun
www.eeworm.com/read/284429/8930729

m fibonacci.m

% name 曾莉莉 % id 07120482 % email 07120482@bjtu.edu.cn % supervisor 丁晓明 function f=fibonacci(n) % FIBONACCI Fibonacci sequence % f=FIBONCCI(n) generates the first n Fiboncci numbers. f=zer
www.eeworm.com/read/427511/8938543

m fibonacci.m

function f = fibonacci(n) %FIBONACCI Fibonacci sequence % f = FIBONACCI(n) generates the first n Fibonacci numbers. f = zeros(n,1); f(1) = 1; f(2) = 2; for k = 3:n f(k) = f(k-1) + f(k-2);
www.eeworm.com/read/185945/8971954

m channelcorr.m

% This function generates pulse response of channel % Jakes model % ll represent the number of path % t is time. % fd=115 function f=channelcorr(fd,t,ll) s=35; rand('state',ll); h1=0; h2=