rtools.tar

Fortran进行并行计算的讲稿，台湾网站上下的。(Fortran for parallel computing of the script, Taiwan Web site from top to bottom.)

codificacion huffman

编写查找程序search，功能如下：给定任意有序数列，然后输入任意一数，用折半查找法找出该数在数列中的位置，若数列中有此数，则返回该数在数列中所在的位置，若数列中无此数，则返回-1 把给定值y插入到有序数组a（由大到小）中，插入后，数组中的数仍然有序 用递推法求解：一串字符以问号“？”结尾，顺序读入后反向输出，且统计其中字符的个数(prepare you search procedures, functions as follows : Given a series of arbitrary order, then enter an arbitrary number, using binary search method to find the few series in the position, if the series is this, Return of the few series in the location, if the series has been no such number,-1 is returned will be distributed to value y orderly array inserted into a (decreasing), insert after The array is an orderly with a few recursive method : a bunch of characters with a question mark "?" The end of the order after reading the reverse output and statistics on the number of characters)

Pulse width modulation - matlab simulation.

用matlab4、5阶龙格-库塔法函数求解模拟批次试验动力学，(With matlab4 order Runge- Kutta method function solving analog batch tests dynamics,)

线性预测分析的基本原理,线性预测分析的基本原理,线性预测分析格型法的解法,线谱对的分析法(The basic principle of linear predictive analysis, the basic principles of linear predictive analysis, the solution of linear predictive analysis lattice method, the line spectrum pair analysis)

code test LAB Embeded system

在AWGN信道下采用BPSK调制，对于一个给定生成矩阵和union bound的线性码，我们得到求解其重量分布的方法。。(Compute the weight distrubution of a linear code given its generator matrix and the union bound on its performance with BPSK modulation over an AWGN channel.)

旅行商问题，即TSP问题（Travelling Salesman Problem）又译为旅行推销员问题、货郎担问题，是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路径的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。(Traveling Salesman Problem, or TSP problem (Travelling Salesman Problem) also translated as the traveling salesman problem, traveling salesman problem is one of the well-known problems in the field of mathematics. Suppose you have a travel business to visit n cities, he must choose which path to go, limiting the path is to visit each city only once, and the last to return to the original departure city. Select the destination path is the requirement for the minimum distance path was among all paths.)

基本蚁群算法求解TSP问题的MATLAB源代码(TSP Ant Colony Algorithm for the basic question of the source code of MATLAB)