PESGM2008-000268

自己编写的迭代小程序，小程序，没问题额的啊(I have written a small program iteration, a small program, the amount of, ah no problem)

Nyquist Graph Rutine

北京航空航天大学出版的matlab从零进阶的原程序代码第1章案例21.1源代码(Beijing University of Aeronautics and Astronautics published matlab from the original program code zero Advanced Case 21.1)

matlab实现canny算子进行图像边缘提取。(canny operator matlab)

部分院校的数字信号处理的matlab的实验(Some institutions of digital signal processing matlab experiment)

一个采用lcmv实现多径信号的波束形成的性能分析，主要关于信噪比和信干噪比(Lcmv performance analysis of multipath signals beamforming, mainly on the SNR and SINR )

用于现代信号分析与处理课程，作用是实现K-L变换和DCT变换。(For modern signal analysis and processing programs, the role is to achieve the KL transform and DCT.)

DC-DC部分采用定功率单环控制，klxUkix参数对于初学者具有参考意义，包含收发两个客户端的链路级通信程序,包含位置式PID算法、积分分离式PID，vwWPfDq条件包含优化类的几个简单示例程序，部分实现了追踪测速迭代松弛算法。( DC-DC power single-part set-loop control, klxUkix parameter For beginners with a reference value, Contains two clients receive link-level communications program, It contains positional PID algorithm, integral separate PID, vwWPfDq condition Optimization class contains several simple sample programs, Partially achieved tracking speed iterative relaxation algorithm.)

说明：  此为完整的CRC循环冗余校验编译码的源代码。分为三个模块，清晰地显示了编译码函数的调用过程。(This is the full CRC cyclic redundancy check encoding and decoding of the source code. Divided into three modules, clearly shows the process of decoding the function call.)

最小费用最大流算法通用Matlab函数 基于Floyd最短路算法的Ford和Fulkerson迭加算法   基本思路：把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条   自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流   量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新   确定,如此多次迭代,最终得到最小费用最大流.(Minimum cost maximum flow algorithm general Matlab functions The basic idea of ​ ​ the shortest path algorithm of Ford and Fulkerson superposition algorithm based on Floyd: the cost of unit flow on the arc as a certain length of Floyd and the shortest path method to determine the one percent self-V1 to the Vn the most short-circuit and then the this Article is the most short-circuit as a can be the expansion Lu, to use solving the method of the the the problem of the maximum flow will its on the stream the amount of increased to the maximum possible values while the the the the flow of of this Article of the shortest on the road increase, the costs of the unit of flow on each arc sure, so many iterations, the final minimum cost maximum flow.)