代码搜索:序列信号

找到约 10,000 项符合「序列信号」的源代码

代码结果 10,000
www.eeworm.com/read/491806/6426319

cpp 最大公共子序列.cpp

#include #include int LCS(char s1[20],char s2[20],int n1,int n2) { int i,j; int L[20][20]; for (i=0;i
www.eeworm.com/read/482925/6616262

cpp 最长公共子序列.cpp

#include using namespace std; void L(int m,int n,char *x,char *y,int c[8][7],char b[8][7]) { int i,j; for(i=1;i
www.eeworm.com/read/477233/6740407

m 构造离散序列x.m

%----------------------------------------------------------------- % exa010101.m: for example 1.1.1 and to generate Fig1.1.8a,b,c %-----------------------------------------------------------------
www.eeworm.com/read/405843/11455941

cpp 两序列相关c程序.cpp

#include # define nx 3 # define ny 3 # define nrxy 5 void main() { int i,k,n; float x[nx],y[ny]; float rxy[nrxy]; float sum; x[0]=2; x[1]=3; x[2]=-1; y[0]=-1; y[1
www.eeworm.com/read/405817/11456345

cpp farey sequence(farey序列数).cpp

#include #include #include using namespace std; const int MAX = 1000100; int n; bool num[1100]; int prime[1100], total; __int64 f[MAX], inc[MAX]; void cal_pr
www.eeworm.com/read/346772/11723837

m 构造离散序列x.m

%----------------------------------------------------------------- % exa010101.m: for example 1.1.1 and to generate Fig1.1.8a,b,c %-----------------------------------------------------------------
www.eeworm.com/read/157008/11744939

cpp 先中序列生成树.cpp

#include #include typedef struct bitree{ struct bitree *rig,*lef; char data; int flag; char p; }*tree,treenote; treenote btrees; char *ch; char *prestr; void creat(tree
www.eeworm.com/read/259776/11764587

txt 纵横点阵序列-mod.txt

0= 1=0011011111111011001100110011001100110011 2=011110110011000011000011000110001110011100011000111000111111 3=011110110011000011000111001110000111000011000011110111011110 4=00011000111000
www.eeworm.com/read/154049/11991779

m 六级m序列.m

clear %清理工作间变量 L=63; %M序列的周期 y1=1;y2=0;y3=1;y4=0;y5=1;y6=0; %给六个移位积存器的输出赋初值 for k=1:L; %开始循环,长度为L x1=xor(y5,y6); %第一个移位寄存器的输入是第5个与第6个移位积存器的输出的“或非” x2=y1; %第二个移位寄存器的输入是第1个移位寄存器的输出 x3=y2;