-
10
说明： Training Sequence Design for Discriminatory Channel Estimation in Wireless MIMO Systems
- 2010-11-15 03:37:20下载
- 积分：1
-
TSPE
一种基于蚁群算法的旅行商问题的源代码.............................................................................(TSP BASED ON ANT COLONY ALGORITHM)
- 2009-06-17 11:24:02下载
- 积分：1
-
smith
说明： 纯滞后系统的smith控制算法，给出了仿真程序清单和simulink仿真模块(delay systems smith control algorithm, a simulation program is given a list and Simulink simulation module)
- 2005-12-07 08:32:57下载
- 积分：1
-
deteccionbordessobel1
Codigo que realiza la detección de bordes por sobel
- 2011-05-21 03:36:40下载
- 积分：1
-
backfolding
采用backfolding差分算法，去除相邻点间的噪声干扰(Difference algorithm to remove the noise between adjacent points.)
- 2013-01-24 11:37:12下载
- 积分：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
-
genbinomtab
Generate binomial table MATLAB function (by David H, BSD License)
- 2011-12-13 20:16:17下载
- 积分：1
-
st
此程序为S变换源代码，用于matlab软件环境下。st.m(S transform)
- 2013-05-18 01:47:10下载
- 积分：1
-
matlab_bgl-3.0-beta
这是一个包含有几十个程序的软件包，可以求网路的最短路径等。(This is a program contains dozens of packages, you can seek the complexity of the network, such as the shortest path.)
- 2009-07-09 12:20:29下载
- 积分：1
-
仿生优化算法
仿生优化计算方法，可适用于基于选择类问题求解(Metaheuristic method, which can be used for problems based the requirement of sample selection)
- 2020-06-21 15:40:02下载
- 积分：1
