-
smartantenna
智能天线的matlab程序,程序较多,非常好用(smart antenna
)
- 2009-06-03 11:56:28下载
- 积分:1
-
particlefilter
非常不错的非线性非高斯环境下的粒子滤波程序(very good nonlinear non-Gaussian environment under the particle filter process)
- 2006-12-06 17:54:11下载
- 积分:1
-
diandianhedianchang
利用matlab计算点电荷场强的教程 清晰易懂~(Calculated using matlab tutorial point charge field lucid ~)
- 2013-10-05 08:32:23下载
- 积分:1
-
Costas
Matlab下的costas载波提取程序 (The costas under Matlab carrier extraction procedures)
- 2012-11-17 10:21:01下载
- 积分:1
-
Model_and_simulate_discrete-event_systems
SimEvents® extends Simulink® with tools for discrete-event simulation of the transactions between components in
a system architecture. You can use the architecture model to analyze performance characteristics such as
end-to-end latencies, throughput, and packet loss. SimEvents can also be used to simulate a process, such as a
mission plan or a manufacturing process, to determine resource requirements or identify bottlenecks.
- 2010-01-08 04:02:49下载
- 积分:1
-
array_weighiting_I
array weighting models fort smart antennas
- 2012-12-31 17:19:13下载
- 积分:1
-
morp
提取图像的形状特征的一个matlab程序(A code of matlab to extract a ROI s shape feature)
- 2011-06-07 09:22:17下载
- 积分: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
-
Viterbi
维特比算法8*8的实现。适用于数字通信原理的卷积码章节的学习。(viterbi algrithem)
- 2011-12-02 07:22:37下载
- 积分:1
-
plotbox
cica is most usefule za shaa shaa algorithm. and it is hutsdag pizdanuud yum ahkak.
- 2013-12-17 17:09:21下载
- 积分:1