-
AM
说明： am的Matlab源程序，可以用于系统仿真！！！(am)
- 2010-04-29 12:06:57下载
- 积分：1
-
ZF-SIC_TPA
MIMO多径瑞利信道下的迫零+串行干扰抵消+自适应功率分配预编码算法仿真链路（simulink+m files）(Rayleigh MIMO multi-path channel under the zero forcing serial interference cancellation adaptive power distribution pre-coding algorithm simulation Chains (Simulink m files))
- 2007-01-25 10:37:13下载
- 积分：1
-
4353424234
turbo均衡算法的最经典算法，包括pb信道和pc信道的仿真，能仿真的通(turbo equalization algorithm of the most classic algorithms, including pb pc channel and channel simulation, simulation can pass)
- 2020-06-29 03:40:02下载
- 积分：1
-
GPR
利用高斯过程回归建立软测量模型，主程序名为OnlineStage.m,包含数据，可以直接运行，亲测可用。(Gaussian process regression soft sensor model, the main program named OnlineStage.m, contains data that can be run directly, pro-test available.)
- 2016-06-23 14:06:38下载
- 积分：1
-
line_hough
利用hough变换检测图像中的直线，得到检测直线的参数与首位端点，并在原图中标出所检测到得直线。(Detection using hough transform image of the straight line parameters to be detected with the first endpoint, and the Original bid to get straight out of the test.)
- 2020-11-05 09:59:52下载
- 积分：1
-
RBF_SMC
本程序为基于RBF神经网络上界自适应学习的滑模控制，适用于实际无法测量上界值的情况。(This procedure is based on the RBF neural network to learn the upper bound of adaptive sliding mode control, can not be applied to the actual measurement of the upper bound values.)
- 2008-04-25 19:53:39下载
- 积分：1
-
Karlman-LMS-RLS
RLS均衡器 matlba 代码，对研究现代书记信号处理的朋友有很大帮助(rls)
- 2010-05-22 22:44:48下载
- 积分：1
-
dIVISIVE-CLUSTER-
dIVISIVE CLUSTER ALGORITHM
- 2014-02-20 10:41:51下载
- 积分：1
-
imageadd
这个程序的主要功能是对彩色图像进行叠加计算。(Superposition of color images)
- 2009-04-25 20:59:42下载
- 积分：1
-
path_discovery
自己编写的利用matlab实现无线自组织网AODV仿真的算法源码。
为由50个节点构成的网络。在50m×50m大小的区域内，随机的产生50个节点。由用户指定源节点和目的节点，程序负责给出从源节点到目的节点的最小路径和此路径的跳数。各个节点之间设定为只要在自己直接通信范围内的其它节点，均一跳可达。(Write your own realization of the use of matlab simulation of wireless self-organizing network algorithms AODV source. The grounds of a network of 50 nodes. Size of 50m × 50m in area, randomly generated 50 nodes. By the user to specify the source node and destination node, the program responsible for the given node from the source node to the destination path and this path is the minimum number of hops. Set between each node to communicate directly as long as within the scope of their other nodes, all jump up.)
- 2021-04-15 16:08:55下载
- 积分：1
