三相全桥整流电路模型

dwa动态窗口算法，MATLAB实现.....(DWA dynamic window algorithm, MATLAB implementation)

A、名称：限幅滤波法（又称程序判断滤波法） B、方法： 根据经验判断，确定两次采样允许的最大偏差值（设为A）， 每次检测到新值时判断： 如果本次值与上次值之差<=A，则本次值有效， 如果本次值与上次值之差>A，则本次值无效，放弃本次值，用上次值代替本次值。 C、优点： 能有效克服因偶然因素引起的脉冲干扰。 D、缺点： 无法抑制那种周期性的干扰。 平滑度差。(A. Name: Limited filter method (also known as program judgement filter method) B. Method: Based on experience, the maximum allowable deviation (set to A) of two sampling times is determined. Judge each time a new value is detected: If the difference between the current value and the previous value is <=A, the current value is valid. If the difference between the current value and the previous value is greater than A, then the current value is invalid, abandon the current value and replace the current value with the last value. C. Advantages: It can effectively overcome the impulse interference caused by accidental factors. D. Disadvantages: That periodic interference cannot be suppressed. The smoothness is poor.)

modelsim挺不错的教程，希望对你有用(good modelsim book ，hope it useful to you!)

说明：  基础的CKF程序实现常速度运动滤波，非常适合初学者。(The basic CKF program realizes constant velocity motion filtering, which is very suitable for beginners.)

在二维数组、三维空间中寻找最短路径，运用动态规划法，并能动态展示出路径(Finding the shortest path in two dimensional array and three dimensional space)

说明：  这个程序用来实现排课，利用的是·遗传算法，但这只是一个简单的程序(to deal with timetable scheduing)

QM算法是用来最小化卡诺图的一个算法，其大概思路是，对蕴含项中1的个数进行分组，只有1的个数相差为1的蕴含项才可能相邻，所以可以通过循环来穷举出所有的主蕴含项。(The QM algorithm is an algorithm used to minimize the Kano map. The idea is that the number of 1 of the implying items is grouped and only 1 of the implication items with a difference of 1 may be adjacent, so that all the main implication items can be given out through the cycle.)

是一个IIC通信程序，利用定时器进行扫描按键和数码管(IIC is a communication program, using the timer button for scanning and digital control)

说明：  经典数字图像处理教科书，美国大学数字图像处理课程专用教材(The classic textbook for digital image processing)

二维经验模式分解代码，十分实用，希望对有需要的朋友有用-Two-dimensional empirical mode decomposition code, are very useful, want to be useful to have a friend in need