Untitled

8PSK解调算法的实现，希望对进行调制解调的朋友有所帮助！(8PSK demodulation algorithm, want to be friends modem help!)

Eigenvalues and eigenvectors of a symmetric matrix.

轨道车轮踏面接触椭圆参数计算，最终获得椭圆面的长轴与短轴长度(Wheel tread contact with the track ellipse parameters calculated)

用matlab编写的几个图形界面的小程序，开始的几个非常的简单，强烈推介最后一个，本人觉得很有参考价值。(Prepared with a few graphical interface matlab small program, the first few very simple and strongly recommend the last one, I think a good reference.)

压缩感知的很简单的入门小例子，基矩阵为正弦基，能很好地重构出稀疏信号(A simple example for the introduction of CS theory, the basis matrix is sinosoidal matrix, which can fully reconstruct the sparse signal.)

对学习阵列信号有很大的帮助，对初学者很实用！(In learning array signals are of great help for beginners very useful)

该程序是使用Matlab仿真协同通信的DF（解码转发）基本性能，基本模型S-R-D三个节点，接收端使用MRC（最大比合并）。固定DF由于SR信道的错误，其性能受到限制，在大SNR情况下不能获得有效分集。而当SR距离足够近的时候，可能获得一定的分集增益。(AF and DF simulation procedure code)

说明：  遗传算法是计算数学中用于解决最佳化的搜索算法，是进化算法的一种。进化算法最初是借鉴了进化生物学中的一些现象而发展起来的，这些现象包括遗传、突变、自然选择以及杂交等。遗传算法通常实现方式为一种计算机模拟。对于一个最优化问题，一定数量的候选解（称为个体）的抽象表示（称为染色体）的种群向更好的解进化。传统上，解用二进制表示（即0和1的串），但也可以用其他表示方法。进化从完全随机个体的种群开始，之后一代一代发生。在每一代中，整个种群的适应度被评价，从当前种群中随机地选择多个个体（基于它们的适应度），通过自然选择和突变产生新的生命种群，该种群在算法的下一次迭代中成为当前种群。(Genetic algorithm (GA) is a search algorithm used to solve optimization in computational mathematics. It is one of evolutionary algorithms. Evolutionary algorithms were originally developed by borrowing phenomena in evolutionary biology, such as heredity, mutation, natural selection and hybridization. Genetic algorithms are usually implemented as a computer simulation. For an optimization problem, an abstract representation of a certain number of candidate solutions (called individuals) (called chromosomes) evolves towards a better solution. Traditionally, solutions are represented in binary (that is, strings of zeros and ones), but other representations are possible. Evolution begins with a population of completely random individuals, and it happens from generation to generation.)

说明：  该模型为自动泊车倒车入库模型，动态化图形展示，十分形象(The model is a model of automatic parking and parking, dynamic graphic display, very vivid)

说明：  三边交换简单算法 哈密尔顿回路 求最短路径(zui duan lu jing)