Spatial

16QAM数字通信信号的调制解调程序，尽可能的仿真实际的通信系统(16QAM modulation and demodulation digital communication signal process, as far as possible the actual communication system simulation)

交叉验证源程序 评价模型性能的一种方式(cross validation)

LTE链路平台的实现，包括发射和接收端，而且加入了同步算法(LTE link platform implementation, including transmitting and receiving end, and joined the synchronization algorithm)

说明：  m序列的产生方法的源代码 matlab仿真 希望初学者有用(m sequence generator method )

说明：  用Matlab实现多目标遗传算法的源代码(Multi-objective genetic algorithm source code)

傅立叶变换能将满足一定条件的某个函数表示成三角函数（正弦和/或余弦函数）或者它们的积分的线性组合。(Fourier transform can meet certain conditions expressed as a function trigonometric (sine and/or cosine functions) or their integral linear combinations.)

smth apsk simulation program, including land-side, the originator, channel, as well a apsk modulation methods used for school data modulation

Yaakov Bar-Shalom, X.-Rong Li,Thiagalingam Kirubarajan - Estimation with Applications to Tracking and Navigation - DynaEst toolbox (Yaakov Bar-Shalom, X.-Rong Li,Thiagalingam Kirubarajan- Estimation with Applications to Tracking and Navigation- DynaEst toolbox )

arnold cat 映射实验，观察其迭代次数与置乱效果的关系，这是图像加密的典型算法(arnold cat mapping experiments to observe the number of iterations and the scrambling effect relationship, which is a typical image encryption algorithm)

利用遗传算法求解旅行商问题 旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 (Traveling salesman problem using genetic algorithm traveling salesman problem, namely, the problem TSP (Travelling Salesman Problem) is one of the famous field of mathematics. Suppose a business trip to visit n cities, he must choose the path to go, pass through the restriction is to visit each city only once, and finally go back to the original departure city. Path selection objective is to get the path distance to the minimum value among all paths.)