-
mt_cdma
mt-cdma系统性能仿真，matlab版(mt-cdma department conduct anti Chu Kui Ling suddenly ㄛ matlab唳)
- 2008-04-04 23:20:45下载
- 积分：1
-
calculateTF
Calculate TF for designing SDM
- 2012-04-12 21:45:45下载
- 积分：1
-
2fsk
2FSK是利用数字基带信号控制在波的频率来传送信息。经过调制后的2FSK数字信号通过两个频率不同的带通滤波器f1、f2滤出不需要的信号，然后再将这两种经过滤波的信号分别通过包络检波器检波，最后将两种信号同时输入到抽样判决器同时外加抽样脉冲，最后解调出来的信号就是调制前的输入信号。(gudi hduidf hdag sdd w)
- 2014-12-22 17:44:45下载
- 积分：1
-
matlab
聚类算法，不是分类算法。分类算法是给一个数据，然后判断这个数据属于已分好的类中的具体哪一类。聚类算法是给一大堆原始数据，然后通过算法将其中具有相似特征的数据聚为一类。这里的k-means聚类，是事先给出原始数据所含的类数，然后将含有相似特征的数据聚为一个类中。所有资料中还是Andrew Ng介绍的明白。首先给出原始数据{x1,x2,...,xn}，这些数据没有被标记的。初始化k个随机数据u1,u2,...,uk。这些xn和uk都是向量。根据下面两个公式迭代就能求出最终所有的u,这些u就是最终所有类的中心位置。(Clustering algorithm, not a classification algorithm. Classification algorithm is to give a figure, and then determine the data belonging to a specific class of good which category. Clustering algorithm is to give a lot of raw data, and then through the algorithm which has similar characteristics data together as a class. Here k-means clustering, is given in advance the number of classes contained in the raw data, then the data contain similar characteristics together as a class. All information presented in or Andrew Ng understand. Firstly, raw data {x1, x2, ..., xn}, the data is not labeled. K random initialization data u1, u2, ..., uk. These are the vectors xn and uk. According to the following two formulas can be obtained final iteration all u, u is the ultimate all these classes the center position.)
- 2014-02-18 09:59:02下载
- 积分：1
-
Matlab
MATLAB的设计，包括常见的函数和功能(MATLAB design, including the common functions and features)
- 2009-09-24 17:49:16下载
- 积分：1
-
IntelligentDataAnalysis
several method for Intelligent data analysis
- 2010-12-11 18:31:16下载
- 积分：1
-
danchunxingfa
单纯形法，求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。它的理论根据是：线性规划问题的可行域是 n维向量空间Rn中的多面凸集，其最优值如果存在必在该凸集的某顶点处达到。顶点所对应的可行解称为基本可行解。单纯形法的基本思想是：先找出一个基本可行解，对它进行鉴别，看是否是最优解；若不是，则按照一定法则转换到另一改进的基本可行解,再鉴别；若仍不是，则再转换,按此重复进行。因基本可行解的个数有限，故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。
(Simplex method, for solving linear programming problems common method. Simplex is the American mathematician GB Danzig in 1947 first put forward. Its theory is based on: linear programming problem feasible region is n-dimensional vector space Rn convex set in the multi-faceted, and its optimal value must be if the vertices of a convex set to achieve. Feasible solution corresponding to the vertex is called a basic feasible solution. The basic idea of the simplex method is: first find a basic feasible solution, to identify it and see whether it is the optimal solution If not, switch to another according to certain rules to improve the basic feasible solution, and then identify if still No, the re-conversion, click here to repeat. Due to the limited number of basic feasible solution, it will be converted by the finite optimal solution can be reached. If the problem can also be the optimal solution method has been applied without discrimination.
)
- 2011-01-17 21:01:44下载
- 积分：1
-
code
calssification algorithm knn
- 2014-11-26 22:12:05下载
- 积分：1
-
NLMS
本例程为改进的LMS算法NLMS算法的MATLAB实现和其收敛性的验证程序(This routine is improved LMS algorithm NLMS algorithm in MATLAB and its convergence verification procedures)
- 2011-12-30 11:00:47下载
- 积分：1
-
Les-distribution-code
无限衰落信道仿真分析 莱斯分布代码莱斯分布实际上可以理解为主信号与服从瑞利分布的多径信号分量的和。由图可知当保持不变时包络的峰值随主信号幅度的峰值的增加而减小。(Simulation analysis of infinite fading channels and Les distribution code)
- 2015-06-25 10:20:06下载
- 积分：1
