-
hamming
说明： 实现汉明码的译码算法 进行正交调制和硬判决 (Hamming code decoding algorithm to achieve the orthogonal modulation and hard decision)
- 2011-03-16 11:24:47下载
- 积分：1
-
laosi
自己制作的GUI画面，开发程序为Matlab，用于劳斯稳定判据实现，界面丰富，推荐大家下载(To produce their own GUI screen, the development program of Matlab, for Rolls stability criterion to achieve, rich interface, we recommend downloading)
- 2013-04-22 22:17:06下载
- 积分：1
-
dipole2
It s about 3d 3D DIPOLE ANTENNA DESIGN.
- 2013-11-08 00:03:15下载
- 积分：1
-
wdg_min_dist
wedge minimum distance control
- 2015-03-24 00:59:24下载
- 积分：1
-
iHMM
infinite HMM
Refer to Beal s Paper
Applying Gibbs Sampling in inference
the number of states of HMM is changeable in this algorithm, based on Dirichlet Proce(infinite HMMRefer to Beal s PaperApplying Gibbs Sampling in inferencethe number of states of HMM is changeable in this algorithm, based on Dirichlet Proce)
- 2008-01-24 10:10:54下载
- 积分：1
-
GNN
说明： 基于MATLAB的差分进化算法优化神经网络的源程序(MATLAB based on the differential evolution algorithm for optimization of neural network source code)
- 2009-08-23 08:48:58下载
- 积分：1
-
Neural-network
神经网络，它是一种模范动物神经网络行为特征，进行分布式并行信息处理的算法数学模型。这种网络依靠系统的复杂程度，通过调整内部大量节点之间相互连接的关系，从而达到处理信息的目的。(Neural network, it is a neural network model of animal behavior characteristics, the distributed parallel algorithm for information processing model. This network relies on the complexity of the system, by adjusting the connection between the number of nodes within the relationship, so as to achieve the purpose of processing information.)
- 2011-05-12 11:45:18下载
- 积分：1
-
myfrf
利用remez设计rrc滤波器,通过迭代算法实现(use the remez to design rrc filter)
- 2011-12-10 16:42:57下载
- 积分：1
-
capacity
信息论中计算信道容量的matlab编程代码，经测试可用。(Information theory to calculate the channel capacity matlab programming code, have been tested.)
- 2013-12-20 20:35:06下载
- 积分：1
-
k_means
k means techniques de classification non supervisée (clustering) les plus utilisées.
Etant donné un entier K, K-means partitionne les données en K groupes, ou "clusters", ou "classes" ne se chevauchant pas. Ce résultat est obtenu en positionnant K "prototypes", ou "centroï des" dans les régions de l espace les plus peuplées. Chaque observation est alors affectée au prototype le plus proche (règle dite "de la Distance Minimale"). Chaque classe contient donc les observations qui sont plus proches d un certain prototype que de tout autre prototype
- 2010-08-05 23:34:13下载
- 积分：1
