PID

说明：  图论的算法，包括floyd和其他一些应用于求最短路径问题的matlab程序(Algorithms of graph theory, including the floyd and other used for the shortest path problem in matlab program)

一种基于均匀圆阵的传播算子高分辨算法，能快速准确进行360度的DOA估计(A method based on uniform circular array propagator high resolution algorithm, can be fast and accurate to360 degrees DOA estimation )

粒子群算法初步讲解，粒子群算法分类，标准粒子群算法的实现(Preliminary analysis of particle swarm optimization)

粒子群算法OptSwarm记录每个粒子的历史最优解（粒子历史最好的适应度）以及全部粒子搜索到的全局最优解。用Wg代表全局最优解，W.,1代表每个粒子的历史最优解。粒子群初始化阶段表OptSwarm的前N行与表ParSwarm中的相同，而Wg的值为表ParSwarm中适应度值的最大值对应的行。(Particle swarm algorithm OptSwarm record the history of each particle the optimal solution (particles history best fitness), and all the particles of the search to the global optimal solution. Use Wg represents the global optimal solution, w., 1 representative of each particle history to the solution. Particle swarm initial stage OptSwarm table before the line and the table ParSwarm N is same, and the value of the ParSwarm Wg for tables in the maximum fitness value corresponding line. )

class a chopper.is also called as step down chopper mostly used in pv array characterstics for the mppt algorithms

递推最小二乘程序，是进行系统辨识很好的程序(Recursive least-squares procedure, is a good program for system identification)

对数据进行reof处理，得到数据的空间模态和时间系数(Matlab function of reof)

A Binary Particle Swarm Optimization for Optimal Placement and Sizing of Capacitor Banks in Radial Distribution Feeders with Distorted Substation Voltages

Bloch simulator. [mx,my,mz] = bloch(b1,gr,tp,t1,t2,df,dp,mode,mx,my,mz) Bloch simulation of rotations due to B1, gradient and off-resonance, including relaxation effects. At each time point, the rotation matrix and decay matrix are calculated. Simulation can simulate the steady-state if the sequence is applied repeatedly, or the magnetization starting at m0. INPUT: b1 = (Mx1) RF pulse in G. Can be complex. gr = (Mx1,2,or 3) 1,2 or 3-dimensional gradient in G/cm. tp = (Mx1) time duration of each b1 and gr point, in seconds, or 1x1 time step if constant for all points

文件中包含了Turbo码和卷积码误码率的对比，其中Turbo码采用了BCJR译码算法，迭代次数分别为1、2、3、4次。文件中包含了源代码和分析文档(File contains a comparison of Turbo code and convolution code BER, which Turbo code decoding algorithm used BCJR iterations respectively 1,2,3,4 times. File contains the source code and documentation analysis)