-
STBC_OFDM_with_Alamouti
基于Alamouti的STBC-OFDM系统性能分析(Based on Alamouti' s STBC-OFDM system performance analysis)
- 2021-04-25 04:38:46下载
- 积分:1
-
AWGN_Channel_GMSK_1
GMSK BER AWGN BCH code
- 2014-10-20 17:05:37下载
- 积分:1
-
movie
Matlab GUIs to show a video capture and to help learn how to Make GUI in Matlab.
- 2013-04-04 23:35:26下载
- 积分:1
-
Grey-wolf-optimizer-(gwo)-in-matlab
In implementing this project, four types of gray wolves like Alpha, Beta, Delta and Omega is the use to simulate the leadership hierarchy in which the three main steps of the hunt, searching for prey, surrounded prey, and attack the bait, are implemented. The simulation results with particle swarm algorithm (PSO) is compared, show that the algorithm has achieved better performance Grey Wolf GWO.
- 2016-11-03 23:35:29下载
- 积分:1
-
matlabtxtread
说明: matlab中常见txt文件读入的实用方法 (matlab common txt file into a practical method)
- 2010-04-15 14:42:46下载
- 积分:1
-
LPP-code
Locality preserving projections algorithm in Matlab.Folder consists of three files
- 2020-07-08 23:18:57下载
- 积分:1
-
BPNN
bp神经网络matlab算法,实现网络的训练与预测(bp neural network
train the networks and predict via the networks)
- 2018-07-23 16:21:15下载
- 积分:1
-
arry
基于最小均方算法lms算法的程序源代码程序仿真(Least mean square algorithm based on LMS algorithm source code)
- 2009-02-23 13:12:49下载
- 积分:1
-
completely-matlab7.1-tutorial
matlab7.1完全教程,可以很系统的了解和学习matlab用法(completely matlab7.1 tutorial, system understanding and learning matlab usage)
- 2012-11-13 11:30:44下载
- 积分:1
-
matlab_3_opt
提供一种求解最优哈密尔顿的算法---三边交换调整法,要求在运行jiaohuan3(三交换法)之前,给定邻接矩阵C和节点个数N,结果路径存放于R中。
bianquan.m文件给出了一个参数实例,可在命令窗口中输入bianquan,得到邻接矩阵C和节点个数N以及一个任意给出的路径R,,回车后再输入jiaohuan3,得到了最优解。
由于没有经过大量的实验,又是近似算法,对于网络比较复杂的情况,可以尝试多运行几次jiaohuan3,看是否能到进一步的优化结果。
(Provide an optimal algorithm Hamilton- trilateral exchange Adjustment Act, requiring running jiaohuan3 (c exchange) before a given adjacency matrix C and the node number N, the results of the path stored in the R in. bianquan.m document gives examples of a parameter can be in the command window, type bianquan, be the adjacency matrix C and the node number N and an arbitrary given path R,, carriage return after the input jiaohuan3, have been the optimal solution . After the absence of a large number of experiments, it is approximate algorithm, for more complex network situations, you can try to run several jiaohuan3, can look to further optimize the results.)
- 2007-09-20 19:35:15下载
- 积分:1