-
Adaptive_LMS
lms for the simulation, this technique is used in egalization
- 2011-04-26 00:01:04下载
- 积分:1
-
ATTENUATIONS
matlab file for cample bozorgnaia 2004 attenuation code
- 2013-11-07 16:31:51下载
- 积分:1
-
argox-cp-3140VCSharp_2005
argox cp-3140的Visual C#测试用例。(argox cp-3140 Visual C# test example。)
- 2013-12-22 11:24:20下载
- 积分:1
-
get_CS_results
compressive sensing matlab code.
- 2014-02-13 22:13:58下载
- 积分:1
-
两用户NOMA仿真
说明: 基础noma仿真程序,适合初期学习用,实现两用户(Basic noma simulation program, suitable for initial learning, to achieve two users)
- 2020-11-16 19:59:40下载
- 积分:1
-
Matlabsourcecodeofawaveletdenoising
一个小波去噪MATLAB程序, 分别对语音高低频进行去噪(MATLAB a wavelet denoising procedure, respectively, the noise of low and high frequency voice)
- 2010-08-15 16:11:01下载
- 积分:1
-
svm_model
space vector modulation for three phase induction motor open loop operation
- 2010-02-26 16:54:23下载
- 积分:1
-
matlab-gui_shixiaohong
MATLAB 学习资料,关于GUI界面编程好书(MATLAB learning materials, a good book on the GUI interface programming)
- 2013-03-28 11:46:58下载
- 积分:1
-
LMS_matlab
这个是用MATLAB程序编写的回波消除的代码,效果不错,简单明了(This is a MATLAB programming with the echo cancellation code, the effect is good, simple and clear)
- 2014-02-24 19:53:50下载
- 积分:1
-
NSGA-III
测试可以跑,根据自己情况修改下函数即可. NSGA-III 首先定义一组参考点。然后随机生成含有 N 个(原文献说最好与参考点个数相同)个体的初始种群,其中 N 是种群大小。接下来,算法进行迭代直至终止条件满足。在第 t 代,算法在当前种群 Pt的基础上,通过随机选择,模拟两点交叉(Simulated Binary Crossover,SBX)和多项式变异 产生子代种群 Qt。Pt和 Qt的大小均为 N。因此,两个种群 Pt和 Qt合并会形成种群大小为 2N 的新的种群 Rt=Pt∪Qt。 为了从种群 Rt中选择最好的 N 个解进入下一代,首先利用基于Pareto支配的非支配排序将 Rt分为若干不同的非支配层(F1,F2等等)。然后,算法构建一个新的种群St,构建方法是从 F1开始,逐次将各非支配层的解加入到 St,直至 St的大小等于 N,或首次大于 N。假设最后可以接受的非支配层是 L层,那么在 L+ 1 层以及之后的那些解就被丢弃掉了,且 St FL中的解已经确定被选择作为 Pt+1中的解。Pt+1中余下的个体需要从 FL中选取,选择的依据是要使种群在目标空间中具有理想的多样性。(The test can run and modify the function according to its own situation. NSGA-III first defines a set of reference points. Then the initial population containing N individuals (preferably the same number of reference points as the original literature) was randomly generated, where N was the size of the population. Next, the algorithm is iterated until the termination condition is satisfied. On the basis of current population Pt, the algorithm simulates two-point crossover (SBX) and polynomial mutation to produce offspring population Qt by random selection.)
- 2021-01-26 22:38:41下载
- 积分:1