代码搜索：Num
找到约 10,000 项符合「Num」的源代码
代码结果 10,000
www.eeworm.com/read/439271/7713269
m qcpqft.m
function cp = qcpqft(num,den,w,T)
% QCPQFT Continuous and discrete-time frequency responses. (Utility Function)
% QCPQFT computes both the continuous and discrete bodes for the
% IDE
www.eeworm.com/read/438810/7726385
c 15rkey0.c
#define HEAPSORT struct student
#define KEY score
HEAPSORT
{ int num;
char name[8];
char sex;
int age;
double score;
};
#include "stdio.h"
#includ
www.eeworm.com/read/438810/7726409
c 15hkey0.c
#define HEAPSORT struct student
#define KEY name
HEAPSORT
{ int num;
char name[8];
char sex;
int age;
double score;
};
#include "stdio.h"
#include
www.eeworm.com/read/438810/7726425
c 15ikey0.c
#define HEAPSORT struct student
#define KEY age
HEAPSORT
{ int num;
char name[8];
char sex;
int age;
double score;
};
#include "stdio.h"
#include
www.eeworm.com/read/438605/7729352
m chap3_1.m
%Expert PID Controller
clear all;
close all;
ts=0.001;
sys=tf(5.235e005,[1,87.35,1.047e004,0]);
dsys=c2d(sys,ts,'z');
[num,den]=tfdata(dsys,'v');
u_1=0.0;u_2=0.0;u_3=0.0;
y_1=0;y_2=0;y_3=0
www.eeworm.com/read/438402/7731720
cpp sgu400.cpp
#include
#include
#include
#include
using namespace std;
const int maxl = 2000;
const int maxn = 200;
const int maxp = 30;
const int maxlen = 1000000;
const i
www.eeworm.com/read/438335/7732716
m frame_syn.m
len=100; %每帧的数据长度
n=3; %进行仿真的帧数
c=[1 1 1 -1 -1 1 -1]; %巴克码
for i=1:n
s(i,:)=randsrc(1,len); %产生每周的信源数据
end
r=[c s(1,:) c s(2,:) c s(3,:)]; %将巴克码插入信源数据中
thr=6; %判决门限，
www.eeworm.com/read/438330/7732738
m mud.m
%在DS-spread spectrum系统中,噪声为加性高斯白噪声,传统单用户检测,线性解相关多用户检测和最小均方误差多用户检测的性能比较
clear all
close all
clc;
prompt={'Enter the numbers of user:','Enter the length of user code:','Enter the power of the user code'
www.eeworm.com/read/438060/7737345
m wiener_filter02.m
% wiener-filter
% wiere-filter.m, for the DSP(II) homework 002, pp.61
% using the Burg method to fit a Nth order autoregressive(AR) model
% Author : sunbaoyu
% Date : March.20th,2009
function wi
www.eeworm.com/read/438045/7737385
m myga.m
function [f,x]=myga(num,bounds,N,CP,P)
%[f,x]=ga(num,bounds,fun,N,CP,P)
%[f,x]=myga([],bounds,[],[],[])
%该遗传算法适用于：
% 目标函数为求最大值，且解非负整数解
%bounds 边界约束
%Myfun 为目标函数
%num