代码搜索：Num
找到约 10,000 项符合「Num」的源代码
代码结果 10,000
www.eeworm.com/read/187956/8585588
m p3203.m
%基本ESPRIT算法2(未加入随机相位)
clear all;
N = 128;
Pi = 3.1415926;
n = [1:1:128];
m= 35;
Times=100; %独立仿真次数
f=zeros(Times,2);
for k=1:Times
w = randn(1,N);
x = sqrt(20)*sin(2*Pi*0.2*n)+
www.eeworm.com/read/187956/8585600
m p3181fai.m
%一般最小二乘方法（引入随机相位）
clear all;
N = 128;
Pi = 3.1415926;
n = [1:1:128];
p=6; %可调AR阶数
q=16;
Times=100; %独立仿真次数
f=zeros(Times,2);
for k=1:Times
w = randn(1,N);
fai1=rand*2*Pi-P
www.eeworm.com/read/187956/8585612
m p319fai.m
clear all;
N = 128;
m = 80;
Pi = 3.1415926;
n = [0:1:N-1];
fsin=0;
Times=100; %独立仿真次数
for k=1:Times
x = zeros(m,N);
fai1=rand*2*Pi-Pi;
fai2=rand*2*Pi-Pi;
for i=1:m
ran
www.eeworm.com/read/187956/8585614
m p3181.m
%一般最小二乘方法（未引入随机相位）
clear all;
N = 128;
Pi = 3.1415926;
n = [1:1:128];
p=6; %可调AR阶数
q=16;
Times=100; %独立仿真次数
f=zeros(Times,2);
for k=1:Times
w = randn(1,N);
x = sqrt(20)*si
www.eeworm.com/read/187956/8585624
m p3182.m
%SVD-TLS方法（未引入随机相位）
clear all;
N = 128;
Pi = 3.1415926;
n = [1:1:N];
pe= 58;
M = 68;
Times=100;
f=zeros(Times,2);
for k=1:Times
w = randn(1,N);
x = sqrt(20)*sin(2*Pi*0.2*n)+sqrt(2
www.eeworm.com/read/187956/8585628
m p3182fai.m
%SVD-TLS方法（引入随机相位以后）
clear all;
N = 128;
Pi = 3.1415926;
n = [1:1:128];
pe=63;
M=64;
Times=100;
f=zeros(Times,2);
for k=1:Times
w = randn(1,N);
fai1=rand*2*Pi-Pi;
fai2=rand*2*Pi-
www.eeworm.com/read/288929/8593519
c packetdriver.c
/******************************************************************************
*
* Copyright (c) 2003 Windond Electronics Corp.
* All rights reserved.
* Winbond W90N740 Boot Loader
*
* Mo
www.eeworm.com/read/388617/8595380
cpp leftover.cpp
// leftover.cpp -- overloading the left() function
#include
unsigned long left(unsigned long num, unsigned ct);
char * left(const char * str, int n = 1);
int main()
{
using nam
www.eeworm.com/read/388617/8596452
cpp leftover.cpp
// leftover.cpp -- overloading the left() function
#include
unsigned long left(unsigned long num, unsigned ct);
char * left(const char * str, int n = 1);
int main()
{
using nam
www.eeworm.com/read/388569/8599976
cpp 1313m round and round we go.cpp
#include
#include
using namespace std;
char num[71];
char mnum[71];
int len1,len2;
int multiple(int m)
{
int i,j,inc,t,s;
inc=0;
s=0;
while(num[s]=='0')
s++;