zinv

混沌吸引子的MATLAB主程序，经验证可以使用。(Chaotic attractor MATLAB main program, you can use the experience card.)

循环谱工具箱,包括快速FAM SSCA 二阶循环累积量，高阶循环累积量(cyclic spectrum toolbox)

说明：  遗传算法，实现求函数最值问题,适合初学者进行学习(Genetic algorithm, seeking to achieve the function most value question)

改进遗传算法用于结构的损伤识别，克服了传统遗传算法的弊端，精度提高(Improved genetic algorithm for structural damage identification, and overcome the shortcomings of traditional genetic algorithm, improve the precision)

说明：  维纳滤波器经典代码，加了详细标注，更适合阅读和改进。(Wiener filter classic code, add the detailed mark, more suitable for reading and improvement. )

一种能够用于将netCDF文件从GC-MS LC-MS输入到matlab中的工具箱(a freeware function to import netCDF files from GC-MS, LC-MS etc. software in MATLAB)

对数据进行包络分析，直觉调用数据，一种利用信号来分析故障的程序(The data envelopment analysis (dea), intuition call data, using a signal to failure analysis program)

纠错编码，信道编码，奇偶校验,系统码非系统码(Error correction encoding, channel encoding, parity)

递归法求解整数划分。 整数划分，是指把一个正整数n写成如下形式： n=m1+m2+…+mi （其中mi为正整数，并且1 <= mi <= n），则{m1,m2,...,mi}为n的一个划分。 如果{m1,m2,...,mi}中的最大值不超过m，即max(m1,m2,...,mi)<=m，则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )

SMART ANTENNA DESIGN FOR WIRELESS ALGORITHM USING CONSTANT MODULUS ALGORITHM