MODE-MIX-HHT

利用遗传算法求解旅行商问题 旅行商问题，即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.)

ofdm simulation using matlab

说明：  求解分块五对角方程组的Matlab编程,并且给出了求解误差的子函数，本编程实用性强(solution for Block pentadiagonal equations)

说明：  Bayesian Actor-Critic matlab example

program for modulation

8 puzzle 程序, 采用 matlab 编程(8 puzzle)

说明：  神经网络 西安电子科技大学出版社 侯媛彬 全书程序夹 CH10(Neural network)

Stewart platform, classic model with PID controller

C_与MATLAB混合编程(英文版),讲解如何用C与MATLAB的混合编程运用。(C_ mixed with the MATLAB programming (English))

This program can produce the Parity Check Matrices of DVBS2 codes.