MATLAB-for-trajectory

partical swarm optimization algorithm

harris corner detection very useful starting code with matlab

很好最优控制软件，配点法详细程序,需要仔细琢磨(A good way to learn Collocation in Optimal control)

一个对ADC和PLL输出结果作FFT频谱分析的matlab程序(An ADC and PLL output FFT spectrum analysis for matlab program)

Dean 的PLL Performance,Simulation and Design 这本书里3rd 滤波器PLL求解的精确matlab程序(Dean of the PLL Performance, Simulation and Design This book 2nd PLL filter matlab program to solve the)

IQA blind equalization method

随机信号处理原理与实践(课本原代码) 作者杨鉴(matlab code in )

Fast Fourier transform matlab code foile

converter control pwm simuling

递归法求解整数划分。 整数划分，是指把一个正整数n写成如下形式： n=m1+m2+…+mi （其中mi为正整数，并且1 <= mi <= n），则{m1,m2,...,mi}为n的一个划分。 如果{m1,m2,...,mi}中的最大值不超过m，即max(m1,m2,...,mi)<=m，则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )