-
[PID]AdvancedControlEngineering2001BurnsMatlab
[PID] Advanced Control Engineering 2001 Burns Matlab.pdf
good control book with matlab code examples
- 2009-09-29 04:47:26下载
- 积分：1
-
two_way_relay
two-way-relay场景下，中继处理矩阵的设计，仿真分析了DPC-ZF及DPC-MMSE算法的性能要由于AF与ZF算法性能。(In the two-way-relay scenario,simulation show that both DPC-ZF and DPC-MMSE have a higher throughput and lower BER performance compared with the traditional AF algorithm and ZF algorithm.)
- 2020-12-06 19:09:21下载
- 积分：1
-
StOMP-20060403
L1 MAGIC :THIS BOOK INTRODUCE THE STAGE WIESE IRTHOGONAL MATCHING PURSUIT
- 2014-11-28 01:27:20下载
- 积分：1
-
GA
说明： 基本的遗传算法实现，并举了一个简单的例子，编程语言matlab(Basic genetic algorithm, both a simple example, programming language matlab)
- 2009-01-14 16:55:43下载
- 积分：1
-
FEA.m
说明： FEA 有限元计算matlab很早以前编制的程序，适应新的matlab环境。(FEA finite element matlab long ago programmed to adapt to the new matlab environment.)
- 2011-04-09 12:24:07下载
- 积分：1
-
kekaoxing
该程序针对可靠性问题进行验证，对比分析了网络中多种链接方式的可靠性，并通过绘图形象表示(The program validated for reliability issues, comparative analysis of the reliability of the network in a variety of ways of links and images represented by drawing)
- 2014-11-14 13:19:11下载
- 积分：1
-
snr
求去噪之后信号的信噪比，发给大家共同探讨(For denoising the signal to noise ratio after the signal, issued to everyone to explore)
- 2008-05-26 17:05:55下载
- 积分：1
-
mca
详尽地介绍了sparse sensing 和morpological Componet Analysis的内容(these introduce sparse sensing and morpological Componet analysis)
- 2009-12-22 10:37:50下载
- 积分：1
-
dijikstra
For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).
- 2012-04-12 21:01:48下载
- 积分：1
-
test_BK
脉冲压缩雷达二相位编码重的巴克码压缩雷达信号处理仿真(Barker code simulation)
- 2020-11-20 10:29:38下载
- 积分：1
