jpeg

经典数字信号处理滤波器的源代码 重点是利用巴特沃斯模拟滤波器转而设计其它数字滤波器 (Classical digital signal processing filter source code)

voice recognition project on home application

递归式最小均方（RLS）算法的基本思想是力图使在每个时刻对所有已输入信号而言重估的平方误差的加权和最小，这使得RLS算法对非平稳信号的适应性要好。与LMS算法相比，RLS算法采用时间平均，因此，所得出的最优滤波器依赖于用于计算平均值的样本数，而LMS（NLMS）算法是基于集平均而设计的，因此稳定环境下LMS（NLMS）算法在不同计算条件下的结果是一致的(Recursive least-mean-square (RLS) algorithm for the basic idea is to try to make in every moment of all the input signal in terms of re-evaluation of the weighted squared error and the smallest, which allows non-stationary RLS algorithm for adaptive signal better. Compared with the LMS algorithm, RLS algorithm uses the average time, therefore, the resulting optimal filter depends on the used to calculate the average number of samples, and the LMS (NLMS) algorithm is designed based on set average, and therefore a stable environment LMS (NLMS) algorithm in different conditions, the results of the calculation is consistent)

MALAB算例，绘制不同函数曲线的用户界面(MALAB example, drawing the user interface of the different functions of the curve)

依据矩量法对偶极子天线和单线行波天线进行分析,将其分为多个小段,分别计算各段上的电流,然后根据电流分布计算出远场和近场的场强波瓣图,从近场随距离的明显变化得出天线近场分析的必要性。(Dipole antenna and a single-wire traveling wave antenna analysis based on the method of moments, will be divided into multiple small pieces, respectively, to calculate the current on each segment, the field strength of the far-field and near-field lobe diagram is then calculated according to the current distribution, draw antenna near-field analysis of the need for significant change with distance from the near-field.)

rbf神经网络模型预测淀粉利用率，径向基神经网络模型预测淀粉利用率(rbf neural network model to predict)

fir滤波器，一个三频率信号的低通和带通滤波器(fir filter, a three-frequency signal of low pass and band-pass filter)

Bayes分类器和Fisher分类器的设计仿真(Bayesian classifier and Fisher classifier design simulation)

remove noise frome multiple noisy images by mean operation

1.实验目的：绘制分形图案并分析其特点。  2.实验内容：绘制Koch曲线、Sierpinski三角形和树木花草图形，观察这些图形的局部和原来分形图形的关系。  3.实验思路：利用函数反复调用自己来模拟分形构造时的迭代过程，当迭代指标n为0时运行作图操作，否则继续迭代(1. Purpose: Draw fractal patterns and analyze their characteristics. 2. Experiment: Draw Koch curve, Sierpinski triangle graphic flowers and trees, observe the relationship between the local and original graphics fractal graphics. 3. Experiment idea: using the function calls itself repeatedly to simulate the iterative process when the fractal structure, when the iteration index n is plotted 0:00 run, otherwise continue iterating)