-
ofdm_without_noise
ofdm signal without noise
- 2014-10-13 16:11:16下载
- 积分：1
-
ebooksclub
Programming the Finite Element Method 4th edition, Matlab-base approach
- 2011-10-12 18:30:31下载
- 积分：1
-
dsp1
随机产生序列u(n),计算自相关系数并且计算功率谱密度(Randomly generated sequence u (n), calculated from the correlation coefficient and calculate the power spectral density)
- 2009-12-01 02:03:04下载
- 积分：1
-
gaus9rdzeni_fft
far field modelling of active optical fibre 9 core
- 2011-02-09 04:35:28下载
- 积分：1
-
ssolve
Matlab中虽然有很多解方程的函数，但对于一般线性方程，有无穷个解时，却不能算出一个特解和基础解系，这几个函数可以实现这个功能。(Matlab Although there are many solutions to the equation function, but for the general linear equations, Infinite Solutions months, they can not penetrate a special solution and infrastructure solutions, which have several functions to achieve this function.)
- 2007-01-07 19:26:07下载
- 积分：1
-
cellularphone
本文开发了一个基于手机的心电图处理系统，可实现心电信号灯实时在线的连续检测和处理。(A cellular phone based online ECG processing system for ambulatory and continuous detection has been developed.)
- 2009-03-11 14:30:36下载
- 积分：1
-
mountaintopopt
说明： 根据moutaintop空时自适应数据编写的最优STAP方法(According to data prepared moutaintop space-time adaptive optimal space-time adaptive processing)
- 2011-04-07 18:02:56下载
- 积分：1
-
untitled0
用simulink自己搭建的小型双馈风力发电机并网，仿真分析双馈的并网输出特性(With simulink build their own small double-fed wind generator and network simulation analysis doubly-fed and web output characteristics)
- 2015-05-16 11:11:44下载
- 积分：1
-
fractal-use
分形的练习一
①Koch曲线
用复数的方法来迭代Koch曲线
clear i 防止i被重新赋值
A=[0 1] 初始A是连接（0，0）与（1，0）的线段
t=exp(i*pi/3)
n=2 n是迭代次数
for j=0:n
A=A/3 a=ones(1,2*4^j)
A=[A (t*A+a/3) (A/t+(1/2+sqrt(3)/6*i)*a) A+2/3*a]
end
plot(real(A),imag(A))
axis([0 1 -0.1 0.8])
②Sierpinski三角形
A=[0 1 0.5 0 0 1] 初始化A
n=3 迭代次数
for i=1:n
A=A/2 b=zeros(1,3^i) c=ones(1,3^i)/2
A=[A A+[c b] A+[c/2 c]]
end
for i=1:3^n
patch(A(1,3*i-2:3*i),A(2,3*i-2:3*i), b ) patch填充函数
end
(Fractal
Exercise One
The ① Koch curve
Plural iteration Koch curve
clear i to prevent i is reassigned
A = [0 1] initial A is a connection (0,0) and (1,0) of the segments
t = exp (i* pi/3)
n = 2 n is the number of iterations
for j = 0: n
A = A/3 a = ones (1,2* 4 ^ j)
A = [A (t* A+ a/3) (A/t+ (1/2+ sqrt (3)/6* i)* a) A+2/3* a]
end
plot (real (A), imag (A))
axis ([0 1-0.1 0.8])
② Sierpinski triangle
A = [0 1 0.5 0 0 1] initialized A
n = 3 the number of iterations.
for i = 1: n
A = A/2 b = zeros (1,3 ^ i) c = ones (1,3 ^ i)/2
A = [A A+ [c b] A+ [c/2 c]]
end
for i = 1:3 ^ n
patch (A (1,3* i-2: 3* i), A (2,3* i-2: 3* i), b ) patch filled function
end)
- 2013-03-02 10:03:09下载
- 积分：1
-
randvec
RANDVEC Generate gaussian random vectors X=(N,M,C)
- 2007-09-11 21:37:35下载
- 积分：1
|
联系客服（QQ：3324461878）
