-
chap5
PID控制程序,matlab编写,适合初学者(5)(PID control procedures, matlab prepared for beginners (5))
- 2008-05-16 21:07:11下载
- 积分:1
-
t1
说明: 在N=128时采用次优化迭代算法的PTS法与普通PTS法的PAPR性能比较。仿真参数:QPSK调制,V=4,P=4,取 。从程序的运行时间可知,采用次优化迭代算法,PTS法的复杂性可以大大降低。(In the N = 128 used sub-optimal iterative algorithm method and the general PTS PTS PAPR performance comparison method. Simulation parameters: QPSK modulation, V = 4, P = 4, to take. We can see from the program' s running time, using sub-optimal iterative algorithm, PTS method can greatly reduce the complexity.)
- 2011-05-26 16:38:34下载
- 积分:1
-
p_judge
判断一组数据服从何种分布:正态分布判,断泊松分布判断,γ分布判断,指数分布判断,rayleigh分布判断(Determine a set of data obey what distribution
)
- 2013-08-25 09:13:28下载
- 积分:1
-
Phase_Noise
说明: PLL Phase Noise MATLAB simulation
- 2019-03-21 10:04:21下载
- 积分:1
-
get-image
使用matlab编写程序控制摄像头获取外界图像(Use matlab program control camera image for the outside world)
- 2012-04-06 16:38:17下载
- 积分:1
-
Super-Trend-Profit
Ea forex, um bom robot
- 2015-03-25 04:16:11下载
- 积分:1
-
QualNet-5.0.2-APIReferenceGuide
QualNet-5.0.2-APIReferenceGuide.ita software manual.QualNet-5.0.2
- 2014-01-12 23:00:29下载
- 积分:1
-
MATLAB-Code-for-Simulated-Annealing
TSP can be defined as a problem where starting from a node it is required to visit every other node only once in a way that the total distance covered is minimized. After an initial solution a neighborhood solution is selected by an exchange of a randomly selected pair of nodes. The randomly generated neighbor solution is selected if it improves the solution else it is selected with a probability that depends on the extent to which it deteriorates from the current solution.
- 2009-11-20 02:54:41下载
- 积分:1
-
2
说明: On Maximum-Likelihood Detection and the Search
for the Closest Lattice Point
- 2015-02-10 22:49:22下载
- 积分:1
-
MMCqueue
In queueing theory, the M/M/c queue is a multi-server queueing model.[1] In Kendall s notation it describes a system where arrivals form a single queue and are governed by a Poisson process, there are c servers and job service times are exponentially distributed.[2] It is a generalisation of the M/M/1 queue which considers only a single server. The model with infinitely many servers is the M/M/∞ queue.
- 2013-05-05 22:20:14下载
- 积分:1