EKF

Newton Raphson Jacobian algorithm in 3 Phase

ofdm基本功能,可以展示ofdm的基本功能图形并茂。(that is a foundamental techology)

fuzzy control of Cement kiln

动态倒计时牌，目标时间（即倒计时截至时间）的年、月、日、时、分、秒以及倒计时主题可以根据不同主题由用户动态设定，并且在此设定基础上在屏幕上显示距离相关主题到达之时还有n年、n天和n秒（其中的三个n各不相同，且随着程序运行动态变化），以北京时间作为主要显示板块，同时显示纽约、伦敦时间的附加倒计时板块。程序中除了刚运行时给出一次当前标准时间值（或读出系统当前时间）外，在程序运行期间应在自己独立的用户时钟控制下，而不受外界输入影响和系统时间的束缚。(Dynamic countdown, the target time (ie, as the countdown time) of the year, month, day, hour, minute, second, and the countdown theme can set different themes by the users, and in this setting is displayed on the screen on the basis of distance-related There are n the theme of the time of arrival, n day n seconds (one of the three different n, and with the dynamic program runs), to Beijing as the main display section, also shows New York, London time, the additional countdown Plate. In addition to just run the program once the current standard time value is given (or read the current system time), but during the program should be independent in their own under the control of the user clock, and free from outside influence and input system time constraints. )

算法的改进，可以运行，并对算法进行了改进，有需要的可供大家学习参考(Algorithm, you can run, and the algorithm is improved, there is need for them to learn from reference)

包含二进制和十进制进化算法，以及算法中二进制和十进制之间爱你的转化(Include binary and decimal evolutionary algorithm, and algorithm of love your conversion between binary and decimal )

电阻式处理炉温控系统设计,simulink仿真单回路系统以及串级系统和simith预估控制系统设计。(Resistive treatment furnace temperature control system design, simulink simulation of single-loop system, and a cascade system and simith predictive control system design.)

说明：  脑电信号特征提取 多尺度方法 经验模态分解 均值粗粒化 移动均值粗粒化(Feature Extraction of EEG Signals Multiscale method Empirical Mode Decomposition Mean coarsening Moving mean coarsening)

sift算法的应用实例，对于做图像处理的初学者相当有用。(sift algorithm application example, image processing, for doing very useful for beginners.)

qc-ldpc码编程，围长为6，列重为3，无4环(The algorithm divides rows into three equal groups. The rows are then connnected to form a distance graph which is then transformed in to a matrix. Girth of six is maintained by avoiding four-cycles. No two rows are connected more than once (the row-column constraint).)