-
DVR-12pulse
MODELLING AND ANALYSIS OF CUSTOM POWER DEVICES FOR MITIGATION
OF VOLTAGE SAGS AND SWELLS TO IMPROVE POWER QUALITY)
- 2014-01-30 14:04:25下载
- 积分:1
-
自己编的多目标遗传算法应用程序
光纤无线通信系统中传输性能的研究,考虑雨衰 阴影 和多径影响,用于时频分析算法,包含光伏电池模块、MPPT模块、BOOST模块、逆变模块,利用matlab写成的窄带噪声发生,包含收发两个客户端的链路级通信程序。
- 2022-01-27 16:06:22下载
- 积分:1
-
Segmentation
code segmentation an image
- 2010-06-01 19:48:27下载
- 积分:1
-
guoling
介绍了一种过零检测方法,实用性强,检测效果较好(This paper introduces a zero crossing detection method, practical strong, better effect)
- 2015-03-13 23:51:31下载
- 积分:1
-
early-late-gate
一个二进制PAM通信系统,使用滚降系数0.4的升余弦波形,速率4800bps,仿真早迟门的工作(A binary PAM communication systems, the use of roll-off factor of 0.4 or cosine waveform, rate 4800bps, early-late gate simulation work)
- 2013-05-27 00:04:34下载
- 积分:1
-
EMal
使用EM算法完成图像的分割,使用混合高斯模型,可以修改分类数。运行EM.m(Expectation Algorithm)
- 2021-03-04 16:59:32下载
- 积分:1
-
er
说明: 自己搭建的风储一体化模型(对原demo修改较大)(Build the integrated model of the wind (the original demo modified))
- 2015-09-18 14:32:27下载
- 积分:1
-
无线通信系统中经典的定时同步的MATLAB程序
无线通信系统中经典的定时同步的MATLAB程序-Wireless Communication System Timing Synchronization classic procedure of MATLAB
- 2022-03-17 15:58:11下载
- 积分: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
-
fhss
hopping code in digital communication systems
- 2012-09-04 02:57:12下载
- 积分:1