mlp_tanker

g729的编码和解码程序，matlab写的编解码是分开的(G729 encoding and decoding procedures, matlab codec is written in separate)

一个关于神经网络的 SOFM算法的程序 改程序用C语言编写(A SOFM neural network algorithm on the procedure to change procedures for using C language)

耳蜗实质上相当于一个滤波器组，耳蜗的滤波作用是在对数频率尺度上进行的，在1000HZ下，人耳的感知能力与频率成线性关系；而在1000HZ以上，人耳的感知能力与频率不构成线性关系，而更偏向于对数关系，这就使得人耳对低频信号比高频信号更敏感。Mel频率的提出是为了方便人耳对不同频率语音的感知特性的研究。频率与Mel频率的转换公式为(on logarithm frequency scale, under the 1000 hz, the perception of the human ear and a linear relationship with frequency In more than 1000 hz, the perception of the human ear does not constitute a linear relationship with frequency, and prefer to logarithmic relationship, which makes the human ear is sensitive to low frequency signal is better than high frequency signal. Mel frequency is put forward in order to facilitate the ear of the study of speech perception characteristics of different frequency. For frequency and Mel frequency conversion formula )

matlab 基于“轮廓和颜色”来识别花朵的相似性的程序。可以区别出不同类的花儿。比较有趣。(matlab based on the " contours and colors" to identify the similarity of the flowers of the procedure. Can distinguish different types of flowers. More interesting.)

三相双闭环PWM整流器simulink仿真，空间矢量SVPWM，电流前馈解耦，DQ坐标变换(Double closed loop three-phase PWM rectifier, using SVPWM, current feedforward decoupling, DQ coordinate conversion, etc )

kalman滤波实现目标跟踪 简洁明了(Kalman filter tracking concise)

MATLAB小波变换在发动机故障、齿轮故障诊断中应用的三个程序代码，非常实用(Three application of the MATLAB wavelet transform engine failure, gear fault diagnosis code, very useful)

该文件代码可以在MATLAB环境下适用于语音智能识别，使用倒谱系数法(The code of the file in the MATLAB environment suitable for voice intelligent recognition using cepstral coefficients method)

Adaptive SIgnal Processing. NLMS, Leaky LMS

RT（快速扩展随机树）是一种基于采样的算法求解路径规划问题。RRT提供可行的解如果时间RRT趋于无穷大。 RRT *是一个基于采样的算法为解决运动规划问题，这是一个概率最优变异性。RRT *收敛到最优解的渐近。 RRT * FN是一个基于采样的算法基于RRT *。RRT * FN内在渐近收敛到最优解，然而RRT * FN实现使用更少的内存(RRT (Rapidly-Exploring Random Tree) is a sampling-based algorithm for solving path planning problem. RRT provides feasable solution if time of RRT tends to infinity. RRT* is a sampling-based algorithm for solving motion planning problem, which is an probabilistically optimal variant of RRT. RRT* converges to the optimal solution asymptotically. RRT*FN is a sampling-based algorithm based on RRT*. RRT*FN inherents asymptotical convergence to the optimal solution, however RRT*FN implements it using less memory.)