水声信道的均衡dfe-lms

说明：  信息科学与通信工程中信息论编码的RS码函数的编写(Information Science and Communication Engineering, Information Theory encoded RS codes in the preparation of the function)

PCA人脸识别 的源代码 在matlaB 里面实现的(PCA MatlAB FaceRec.m eigface Reconstruct.m calc xmean,sigma and its eigen decomposition)

说明：  计算加速器频谱，可以显示加速器频谱书面 加速器频谱，可以显示加速器频谱书(Compute accelerator spectrum, the spectrum can show a written accelerator accelerator spectrum, the spectrum can be displayed accelerator book)

说明：  遗传算法借鉴了达尔文的进化论和孟德尔的生物遗传学说，模拟大自然界生物进化 机制，是一种高效、并行、全局搜索的优化方法。它能够在搜索过程中自动获取和积累 有关搜索空间的知识，并自适应控制搜索过程以求得最优解。(Genetic algorithm draws on Darwin s theory of evolution and Mendel s biological genetics, simulation of the nature of biological evolution Mechanism, is an efficient, parallel, global search optimization method. It can be automatically acquired and accumulated during the search process Knowledge about the search space, and adaptive control of the search process in order to obtain the optimal solution.)

This is a simple matlab routine that calculates a simulated multiplicative cascade process for a time series, then compares it with a real time series you want to analyze, and plots them both in log-log coordinates to compare them. You should have your time series in a format of double column listing: the ordinal member in the first column, the corresponding data in the second one. Then you change the file name that appears in the program for the name of your own file, and proceed.

用来评估信号去噪的效果，采用模拟评估法，matlab程序(Used to assess the effects of signal de-noising, analog Assessment Act, matlab program)

MATLAB HELP FUNDENMENTAL IN YOUR CODE 2 IN FILE

说明：  累加弦长的参数三次样条曲线方法求插值曲线，给定顶点(cumulative long string parameter cubic spline curve interpolation methods for curve, given vertex)

notch filter specific design in matlab

这是一个二维模态分解的一个程序。 一个美国佬写的。是分析图形的一个新的方法。( BEMD.m J.C. Nunes, Y. Bouaoune, E. Del閏helle, N. Oumar, and Ph. Bunel. "Image analysis by bidimensional empirical mode decomposition". Image and Vision Computing Journal (IVC), (to appear), 2003. )