%========================开始提取加噪信号的各类特征值================================ for n=1:1:50; m=n*Ns; x=(n-1)*Ns; for i=x+1:m; %提取加噪信号'signal_with_noise=y+noise'的前256个元素，抽取50次 y0(i)=signal_with_noise(i); end Y=fft(y0); %对调制信号进行快速傅里叶算法（离散） y1=hilbert(y0) ; %调制信号实部的解析式 factor=0; %开始求零中心归一化瞬时幅度谱密度的最大值gamma_max for i=x+1:m; factor=factor+y0(i); end ms=factor/(m-x); an_i=y0./ms; acn_i=an_i-1; end gamma_max=max(fft(acn_i.*acn_i))/Ns
上传时间： 2020-04-07
上传用户：如拷贝般复制
VHDL编写的4选一数据选择器 entity mux41a is port(a,b:in std_logic; s1,s2,s3,s4:in std_logic; y: out std_logic); end entity mux41a; architecture one of mux41a is signal ab:std_logic_vector(1 downto 0);
上传时间： 2020-05-15
上传用户：cdga
Many times I have been asked to explain “ briefl y ” how SDH, SONET, and the OTN “ exactly ” work. The questions came mainly from new colleagues, stu- dents, and users of these technologies, personally or via the usenet newsgroup comp.dcom.sdh - sonet. I could have referred them to the standards documents, but to provide a more consistent and clear answer I decided to write this pocket guide. The objective of this book is that it can be used both as an introduction as well as a reference guide to these technologies and their spe- cifi c standards documents.
标签： Generation Transport Optical ComSoc Guide
上传时间： 2020-05-27
上传用户：shancjb
function y=lagr(x0,y0,x) %x0,y0为节点 %x是插值点 n=length(x0); m=length(x); for i=1:m z=x(i); s=0.0; for k=1:n p=1.0; for j=1:n if j~=k p=p*(z-x0(j))/(x0(k)-x0(j)); end end s=p*y0(k)+s; end y(i)=s; end
标签： lagr
上传时间： 2020-06-09
上传用户：shiyc2020
My association with the theory of controls in continuous time started during my studies at the Indian Institute of Technology, Kharagpur, India, in 1974 as an undergraduate student in the Controls and Power program. The initial introduction by Professors Kesavamurthy, Y. P. Singh, and Rajagopalan laid the foundation for a good basic understanding of the subject matter. This pursuit and further advanced study in the field of digital controls continued during my days as a graduate student in the Electrical and Systems Engineering Department at the University of Connecticut in Storrs, from 1983 to 1988.
标签： Applications Digital Control
上传时间： 2020-06-10
上传用户：shancjb
#include<stdio.h> #define TREEMAX 100 typedef struct BT { char data; BT *lchild; BT *rchild; }BT; BT *CreateTree(); void Preorder(BT *T); void Postorder(BT *T); void Inorder(BT *T); void Leafnum(BT *T); void Nodenum(BT *T); int TreeDepth(BT *T); int count=0; void main() { BT *T=NULL; char ch1,ch2,a; ch1='y'; while(ch1=='y'||ch1=='y') { printf("\n"); printf("\n\t\t 二叉树子系统"); printf("\n\t\t*****************************************"); printf("\n\t\t 1---------建二叉树 "); printf("\n\t\t 2---------先序遍历 "); printf("\n\t\t 3---------中序遍历 "); printf("\n\t\t 4---------后序遍历 "); printf("\n\t\t 5---------求叶子数 "); printf("\n\t\t 6---------求结点数 "); printf("\n\t\t 7---------求树深度 "); printf("\n\t\t 0---------返 回 "); printf("\n\t\t*****************************************"); printf("\n\t\t 请选择菜单号 （0--7）"); scanf("%c",&ch2); getchar(); printf("\n"); switch(ch2) { case'1': printf("\n\t\t请按先序序列输入二叉树的结点:\n"); printf("\n\t\t说明：输入结点（‘0’代表后继结点为空）后按回车。\n"); printf("\n\t\t请输入根结点:"); T=CreateTree(); printf("\n\t\t二叉树成功建立！\n");break; case'2': printf("\n\t\t该二叉树的先序遍历序列为:"); Preorder(T);break; case'3': printf("\n\t\t该二叉树的中序遍历序列为:"); Inorder(T);break; case'4': printf("\n\t\t该二叉树的后序遍历序列为:"); Postorder(T);break; case'5': count=0;Leafnum(T); printf("\n\t\t该二叉树有%d个叶子。\n",count);break; case'6': count=0;Nodenum(T); printf("\n\t\t该二叉树总共有%d个结点。\n",count);break; case'7': printf("\n\t\t该树的深度为:%d",TreeDepth(T)); break; case'0': ch1='n';break; default: printf("\n\t\t***请注意：输入有误！***"); } if(ch2!='0') { printf("\n\n\t\t按【Enter】键继续，按任意键返回主菜单！\n"); a=getchar(); if(a!='\xA') { getchar(); ch1='n'; } } } } BT *CreateTree() { BT *t; char x; scanf("%c",&x); getchar(); if(x=='0') t=NULL; else { t=new BT; t->data=x; printf("\n\t\t请输入%c结点的左子结点:",t->data); t->lchild=CreateTree(); printf("\n\t\t请输入%c结点的右子结点:",t->data); t->rchild=CreateTree(); } return t; } void Preorder(BT *T) { if(T) { printf("%3c",T->data); Preorder(T->lchild); Preorder(T->rchild); } } void Inorder(BT *T) { if(T) { Inorder(T->lchild); printf("%3c",T->data); Inorder(T->rchild); } } void Postorder(BT *T) { if(T) { Postorder(T->lchild); Postorder(T->rchild); printf("%3c",T->data); } } void Leafnum(BT *T) { if(T) { if(T->lchild==NULL&&T->rchild==NULL) count++; Leafnum(T->lchild); Leafnum(T->rchild); } } void Nodenum(BT *T) { if(T) { count++; Nodenum(T->lchild); Nodenum(T->rchild); } } int TreeDepth(BT *T) { int ldep,rdep; if(T==NULL) return 0; else { ldep=TreeDepth(T->lchild); rdep=TreeDepth(T->rchild); if(ldep>rdep) return ldep+1; else return rdep+1; } }
上传时间： 2020-06-11
上传用户：ccccy
#include <stdio.h> #include <stdlib.h> #define SMAX 100 typedef struct SPNode { int i,j,v; }SPNode; struct sparmatrix { int rows,cols,terms; SPNode data [SMAX]; }; sparmatrix CreateSparmatrix() { sparmatrix A; printf("\n\t\t请输入稀疏矩阵的行数，列数和非零元素个数（用逗号隔开）:"); scanf("%d,%d,%d",&A.cols,&A.terms); for(int n=0;n<=A.terms-1;n++) { printf("\n\t\t输入非零元素值（格式：行号，列号，值）:"); scanf("%d,%d,%d",&A.data[n].i,&A.data[n].j,&A.data[n].v); } return A; } void ShowSparmatrix(sparmatrix A) { int k; printf("\n\t\t"); for(int x=0;x<=A.rows-1;x++) { for(int y=0;y<=A.cols-1;y++) { k=0; for(int n=0;n<=A.terms-1;n++) { if((A.data[n].i-1==x)&&(A.data[n].j-1==y)) { printf("%8d",A.data[n].v); k=1; } } if(k==0) printf("%8d",k); } printf("\n\t\t"); } } void sumsparmatrix(sparmatrix A) { SPNode *p; p=(SPNode*)malloc(sizeof(SPNode)); p->v=0; int k; k=0; printf("\n\t\t"); for(int x=0;x<=A.rows-1;x++) { for(int y=0;y<=A.cols-1;y++) { for(int n=0;n<=A.terms;n++) { if((A.data[n].i==x)&&(A.data[n].j==y)&&(x==y)) { p->v=p->v+A.data[n].v; k=1; } } } printf("\n\t\t"); } if(k==1) printf("\n\t\t对角线元素的和：:%d\n",p->v); else printf("\n\t\t对角线元素的和为：:0"); } int main() { int ch=1,choice; struct sparmatrix A; A.terms=0; while(ch) { printf("\n"); printf("\n\t\t 稀疏矩阵的三元组系统 "); printf("\n\t\t*********************************"); printf("\n\t\t 1------------创建 "); printf("\n\t\t 2------------显示 "); printf("\n\t\t 3------------求对角线元素和"); printf("\n\t\t 4------------返回 "); printf("\n\t\t*********************************"); printf("\n\t\t请选择菜单号（0-3）:"); scanf("%d",&choice); switch(choice) { case 1: A=CreateSparmatrix(); break; case 2: ShowSparmatrix(A); break; case 3: SumSparmatrix(A); break; default: system("cls"); printf("\n\t\t输入错误！请重新输入！\n"); break; } if (choice==1||choice==2||choice==3) { printf("\n\t\t"); system("pause"); system("cls"); } else system("cls"); } }
上传时间： 2020-06-11
上传用户：ccccy
某疾病发生率y‰和年龄段x（每五年为一段，例如0~5岁为第一段..）
标签： C代码
上传时间： 2020-06-14
上传用户：ll12346
第一种边界条件下的三次样条插值问题（高斯消元法） 题目 计算方法上机实习题目（二） ——第一种边界条件下的三次样条插值问题（高斯消元法） 已知直升飞机旋转机翼外形曲线轮廓线上的某些型值点（见表）及端点处的一阶导数值 y' (x ) = 1.86548, y' (x ) = -0.046115
标签： 计算方法上机实习题目
上传时间： 2020-06-27
上传用户：zg250
x=[1,2,0,-1,3,2];h=[1,-1,1]; y1=x*h(1); y2=x*h(2); y3=x*h(3); Y1=[0,0,y1]; Y2=[0,y2,0]; Y3=[y3,0,0]; y=Y1+Y2+Y3; L=-2:1:5; figure(1); subplot(211);stem(L,y,'*'); xlabel('L');ylabel('y');title('(1)'); X=x.';X=X'; r1=X*y(1);r2=X*y(2);r3=X*y(3);r4=X*y(4); r5=X*y(5);r6=X*y(6);r7=X*y(7);r8=X*y(8); R1=[0,0,0,0,0,0,0,r1];R2=[0,0,0,0,0,0,r2,0]; R3=[0,0,0,0,0,r3,0,0];R4=[0,0,0,0,r4,0,0,0]; R5=[0,0,0,r5,0,0,0,0];R6=[0,0,r6,0,0,0,0,0]; R7=[0,r7,0,0,0,0,0,0];R8=[r8,0,0,0,0,0,0,0]; R=R1+R2+R3+R4+R5+R6+R7+R8; n=-7:5; subplot(212);stem(n,R);title('(2)');
标签： ketang
上传时间： 2020-11-10
上传用户：
