-
cv_fenxi1
matlab 代码，主要用于计算一数据矩阵的标准差，方差，变异系数，话三维曲面图(matlab code, data matrix used to calculate a standard deviation, variance, coefficient of variation, then D surface chart)
- 2013-10-31 19:58:00下载
- 积分：1
-
myclean
基于clean算法的雷达多目标分离与提取(Based on the clean radar multi-target separation and extraction of the algorithm)
- 2016-09-29 09:29:53下载
- 积分：1
-
TD-SYNC-DL
TD-SCDMA小区搜索最为关键的sync-dl码同步的确定过程，即搜索DwPTS。(TD-SCDMA cell search of the most critical sync-dl code synchronization process of determining that the search DwPTS.)
- 2009-11-11 17:52:23下载
- 积分：1
-
programme
Source code of AFIS (pattern recognition)
- 2010-12-29 08:42:10下载
- 积分：1
-
tic2000_MATLAB
说明： 好不容易找不到的2812芯片在MATLAB环境下仿真的说明文件！ (After 2812 the chip can not be found in the MATLAB simulation environment documentation!)
- 2009-08-20 19:42:43下载
- 积分：1
-
SLM_16QAM
SLM解决OFDM系统中存在的PAPR问题，调制方式16QAM(Solve PAPR problem in OFDM system with SLM)
- 2021-05-13 06:30:02下载
- 积分：1
-
lunwenji
数学建模竞赛历年获奖论文，希望对大家有帮助！(Mathematical modeling contest winning papers over the years, want to help!)
- 2011-06-26 11:04:10下载
- 积分：1
-
autosp
this code helps you to calculate the autospcter (autospecter_code)
- 2011-09-27 21:58:29下载
- 积分：1
-
pitch
自己编的一个利用自相关法求解基音周期的程序(own addendum to the use of an auto-correlation method Pitch procedures)
- 2007-06-20 14:59:26下载
- 积分：1
-
Matlab_zuixiaoerchengfa
最小费用最大流算法通用Matlab函数
基于Floyd最短路算法的Ford和Fulkerson迭加算法 基本思路：把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条 自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流 量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新 确定,如此多次迭代,最终得到最小费用最大流.( Minimum cost maximum flow algorithm for general Matlab functions based on the Floyd shortest path algorithm of Ford and Fulkerson superposition algorithm of the basic ideas: the cost of unit flow on the arc as a certain length of Floyd for the most short-circuit method to determine the one percent V1 through Vn are the most short-circuit then this short circuit as a scalable road, a method for solving the maximum flow problem on flow increased to the maximum possible value that the shortest way increased traffic, the cost of unit flow on each arc sure, so many iterations, the final minimum cost maximum flow.)
- 2012-07-27 14:54:17下载
- 积分：1
