PASCAL编译器

应用背景数字PID，可用于各类开关电源控制，亲测可行，灵活性较高，但是不是利用浮点型计算，用的整形计算，还是会存在细微误差，但是在速度方面可以弥补这方面误差，可利用其搭建各种反馈数字电路关键技术数字PID，考虑到了由于负数所带来的影响，利用补码进行不足，防止计算的时候溢出，还可以根据你的需求对其中的位数进行调整，达到实际需求，不适用模块写的，整个用状态机完成

本文件包含三个小程序，分别为用fft实现功率谱估计、实现快速卷积和快速相关。对了解fft在c中的编程很有帮助-This document contains three procedures were used to achieve power spectrum estimation fft, fast convolution and fast correlation. Fft to know programming in c in the helpful

通过高斯消去法，进行矩阵求逆运算，在工程中有很强的实用价值。-through Gaussian elimination method for computing matrix inversion, the project has a strong practical value.

二叉树的集合操作，附带一份程序的试验报告，相当优秀的程序，对深入理解二叉树很有帮助。-binary tree assembly operation, accompanied by a program to the test report, the procedure quite excellent, in-depth understanding of binary tree helpful.

本程序是关于各种信道的模型，很有用！对多径数确定，每个路径的多普勒频移随机产生，能够准确的模拟多径多普勒信道的特性。

旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 -Traveling Salesman Problem, or TSP problem (Travelling Salesman Problem) is a well-known field of mathematics problems. Assuming there is a travel business to visit n cities, he must choose which path to go, via the restriction is to visit each city only once and the last to go back to the original departure city. Path selection objective is to get the path distance for all paths are the minimum.

calc大数库，实现了所有的基本大数运算功能-calc library of large numbers, realize all the basic computing functions of large numbers

*   To factor the n by n matrix A = (A(I,J)) into the product of the*   lower triangular matrix L = (L(I,J)) and U = (U(I,J)), that is*   A = LU, where the main diagonal of either L or U consists of all ones:**   INPUT:   dimension n; the entries A(I,J), 1

最小生成树绝对可以运行的程序-absolute minimum spanning tree can run the procedure

MD5即Message-Digest Algorithm 5（信息-摘要算法5），用于确保信息传输完整一致。是计算机广泛使用的杂凑算法之一（又译摘要算法、哈希算法），主流编程语言普遍已有MD5实现。 将数据（如