Filter_LMS_mu

黄金分割法求极小，返回值fm为函数极小值，tm为极小值点，f为给定函数，t为函数变量，[a,b]为变量t的搜索区间(Golden section method is extremely small, the return value for the function fm minimum, tm for the minimum point, f for a given function, t for the function of variables, [a, b] for variable search interval t)

慢速跳频，调制样式为MFSK(MFSK/FH)，包括信号的发射接收模型，自己写的代码，仅供参考。(Slow frequency hopping, modulation pattern for the MFSK (MFSK/FH), including the launch of signal reception model, write your own code, for reference purposes only.)

这是wimax标准的ldpc码的译码程序 编码程序在文件夹ldpc_minioffset/matlab中，为matlab的源程序(This is the standard ldpc wimax decoding program code program in the folder ldpc_minioffset/matlab in the source code for the matlab)

该模块实现一个寄存器堆的操作，其中前16个仅主机能写，规给为32-bit×32。后16个仅Micorblaze能写。读取没有限制。如果双方同时对同一地址进行读写操作，读回的数将是全1。(This module implement a register file of the operation, of which the first host 16 is only able to write rules to the 32-bit × 32. Micorblaze only 16 after the write. There is no limit to read. If the two sides at the same time to read and write operations to the same address, read back would have been a full one.)

用离散数学或图论的术语来说，假设有一个图g=(v,e)，其中v是顶点集，e是边集，设d=(dij)是由顶点i和顶点j之间的距离所组成的距离矩阵，旅行商问题就是求出一条通过所有顶点且每个顶点只通过一次的具有最短距离的回路。 (Discrete Mathematics or use the terminology of graph theory, assume that a graph g = (v, e), where v is the vertex set, e is the edge set, let d = (dij) is a vertex between i and vertex j formed from the distance matrix, a traveling salesman problem is obtained through all the vertices and each vertex only once has the shortest distance through the loop.)

ForwardingMultiset<E> extends ForwardingCollection Source Code for Andriod.

D2D IoT and the code of multi cell equation will be detailled intthis section

说明：  PLL Phase Noise MATLAB simulation

说明：  实现场景交通标志识别，是一个交作业的小功能(the realization of scene traffic sign recognition, is a small function of hand in work)

遗传算法的matlab实现（遗传算法（Genetic Algorithm）是模拟达尔文生物进化论的自然选择和遗传学机理的生物进化过程的计算模型，是一种通过模拟自然进化过程搜索最优解的方法。）(Genetic algorithm matlab realize)