PSOand-test-function

本程序实现了中继协作时候对中继选择时候根据信噪比对中继的排序选择工作(implemente the relay system s order of the relay)

formant feature voice its important for extraction 14 coofeecient from lp

自适应滤波器中MUSIC算法的MATLAB程序·(Adaptive filter algorithm in the MATLAB program MUSIC)

整数规划的matlab代码，常用的优化工具！(Integer programming matlab code, commonly used optimization tools!)

云发生器的matlab代码，云模型的实现过程(cloud )

用MATLAB实现加噪信号的消噪噪,用了三种常用方法。可直接使用。 (Using MATLAB to increase noise and signal noise cancellation noise, with three commonly used methods. Can be used directly.)

find peaks in waveform

通过设置不同的参数利用Matlab软件仿真了不同场景下的系统性能 (This document suggests a user’s guide to a MATLAB application which simulates a Spatial Channel Model (SCM) based on reference [1] with some minor adjustments. It focuses on how to use the Graphical User Interfaces (GUIs) and the functions of the application and avoids going into specifics about the nature of the parameters as this is done analytically in the reference document)

说明：  16Qam的Matlab/Simulink仿真系统，包含匹配滤波，载波恢复，位定时恢复等个重要模块，加深对16Qam调制解调系统的理解(16Qam the Matlab/Simulink system, matched filtering, carrier recovery, rehabilitation Timing important module, the better modulation and demodulation system 16Qam understanding)

遗传算法tsp问题 针对题目中物流配送路径优化问题，本文引入0-1规划思想，建立了带约束条件的物流配送问题的数学模型。求解时，引入遗传算法的编码方式，并针对分区数与客户数量相差较小的情况，灵活运用分区配送算法确定包含最优解的分区序列组，紧密结合枚举法使得其算法兼顾简单、快速的优点。应用Matlab软件可执行得到最短路径。兼顾时间因素导致的复杂影响，我们引入了惩罚函数，并通过设定惩罚系数，进一步由最短路径求得最优路径。(Genetic algorithm tsp problem of logistics distribution routing optimization problem subject, this paper introduces 0-1 programming ideas, a mathematical model with the constraints of logistics and distribution problems. Solving, introducing genetic algorithm encoding, and the number of partitions and the number of customers for a small difference, the flexible use of the partition containing the partition algorithm to determine the distribution of the optimal solution sequence group, closely enumeration method allows both the algorithm is simple, fast advantages. Matlab software application executable to get the shortest path. Complex factors affecting both the time, we introduce a penalty function, and by setting the penalty coefficient, and further obtain the optimal path from the shortest path.)