CRC16

SIMULATION AND IMPLEMENTATION OF TWOLEVEL AND THREE-LEVEL INVERTERS BY MATLAB AND RT-LAB

基于短时窗能量的自适应语言端点检测程序。具有一定的抗噪声能力。输入WAV文件名，输出端点检测结果，包括数据和画图显示。(Adaptive voice activitie detection program，resistant to noice .Input with the name of wave file,output with the VAD result ,including data and figure display.)

使用yalmip调用CPLEX求解器求解优化问题(Using yalmip to call CPLEX solver to solve optimization problems)

本程序是根据3gpp中tdd协议中的下行导频码的结构构造的导频码捕获的程序，在该程序中针对导频码的结构独创性的提出了加功率窗法的捕获，比普通的方法效率搞 用matlab编的(This procedure is based on 3GPP TDD agreement in the downlink pilot code structure of the pilot code acquisition procedure, in the pilot program code for the structure of original proposed law plus power window capture, than the ordinary efficient method to engage with matlab series)

D = DISTMAT(X,Y) for matrices X and Y returns the distance matrix where the (i,j)th entry is the d-norm distance between the ith and jth row of X and Y respectively.

全相位陷波器是全相位数字信号处理体系中一个很有特色的技术，在通信、军事等抗强干扰场合中应用及其广泛，因而研究全相位陷波器并仿真建模实现其滤波功能，具有很高的意义。(All-phase notch filter is a very distinctive technique in the all-phase of digital signal processing system. In communications，military and such resistance interference are widely used. Therefore, it is of high significance to the study of All-phase notch filter and simulate the modeling to realize the filter function)

MATLAB实现循环码的编译码，信源为随机产生数，并且计算码间的汉明距离(MATLAB recycling code encryption, the source randomly generated number, and calculates the Hamming distance between the code)

OFDM记忆多项式功率放大器模型。能够精确的完成对功率放大器的建模，无任何错误。(To achieve the wiener model pre-distortion, the effect is very good, the program checked for any errors)

本程序为EEMD分解程序，用于信号的EEMD分解(This procedure for the EEMD decomposition process, a signal for EEMD decomposition)

说明：  利用蚁群算法解决TSP问题，本例涉及了31个城市并将其坐标化，每个城市只能拜访一次，而且最后要回到初始城市，所选路径为所有路径之中的最小值。(Using ant colony algorithm to solve TSP problem, this example involves 31 cities and coordinates them, each city can only visit once, and finally return to the initial City, the selected path is the minimum of all paths.)