waveletintroduction

编写的是2-4进制转换的功能函数，而进制转化是进行QAM调制的必须元件，而且可根据次程序进行编写其他进制的转换(hexTransform is necessary to modulation for example MQAM)

RESEARCH PAPER PUBLISHED IN NCITCSE 2015

Programa Matlab para Discrete Fourier Transformation.

多个电力电子、电机仿真模型。是重要的学习电力电子simulink 仿真的素材，权威教材，内容较多，分成上下两集,这个是上(useful simulink modles for leaners)

《MATLAB语言常用算法程序集》一书的源程序，好不容易找到的，奉献给大家！(Book " MATLAB language commonly used algorithm assembly source, hard to find, and dedicated to everyone!)

A feature selection based framework for human activity recognition using wearable multimodal sensors

DFT进行频谱分析时的三种现象 1、混叠：对连续信号采样，要求连续信号是带限的，采样频率要足够高。Fs应满足Nyquist采样定理才不产生混叠。 采样前加低通滤波器防混叠 2、频谱泄漏：DFT对时域信号进行了截断（相当于采样信号乘了一个窗函数），时域的乘积相当于频域卷积，改变了原信号频谱。 改用其他窗函数（非矩形）改善泄漏。 3、栅栏现象：DFT 只给出了频谱在采样点上的取值，采样点间的频谱内容丢失。(DFT spectrum analysis of a three phenomena, aliasing : continuous signal sampling, requiring continuous signal is band-limited, the sampling frequency should be high enough. Fs meet the Nyquist Sampling Theorem would not have aliasing. Sampling former low-pass filter plus anti-aliasing 2, spectrum leakage : DFT right time domain signal a disconnect (equivalent to a sampling signal by a window function). time domain is equivalent to the product of frequency-domain convolution, changes in the spectrum of the original signal. Window functions to switch to other (non-rectangular) to improve leakage. 3, fenced phenomenon : DFT spectrum is given only at the sampling point value, sampling points of the spectrum as lost.)

自适应时频频分析方法，具有界面操作，参数选择等功能，可以自由调入信号获得相应的自适应视频分析方法结果。(Adaptive time frequency analysis method,It can be used to give TFR of signal.)

采用栅格对机器人的工作空间进行划分，再利用优化算法对机器人路径优化，是采用智能算法求最优路径的一个经典问题。目前，采用蚁群算法在栅格地图上进行路径优化取得比较好的效果，而利用遗传算法在栅格地图上进行路径优化在算法显得更加难以实现。 利用遗传算法处理栅格地图的机器人路径规划的难点主要包括：1保证路径不间断，2保证路径不穿过障碍。 用遗传算法解决优化问题时的步骤是固定的，就是种群初始化，选择，交叉，变异，适应度计算这样，那么下面我就说一下遗传算法求栅格地图中机器人路径规划在每个步骤的问题、难点以及解决办法。(It is a classical problem to divide the workspace of the robot by grids and optimize the path of the robot by using optimization algorithm. At present, the ant colony algorithm is used to optimize the path on the grid map, and the genetic algorithm is used to optimize the path on the grid map, which is more difficult to achieve. The difficulties of using genetic algorithm to deal with the path planning of robot on raster map mainly include: 1. guaranteeing that the path is uninterrupted, 2. guaranteeing that the path does not cross obstacles. The steps of genetic algorithm in solving optimization problems are fixed, that is, population initialization, selection, crossover, mutation, fitness calculation. Then I will talk about the problems, difficulties and solutions of genetic algorithm in each step of robot path planning in raster map.)

语音处理的短时时域处理技术中的短时中值滤波(voice when dealing with the short-time domain processing technology of short-term median filtering)