HMMtools

有关协作通信的仿真程序，有助于学习协作通信基础知识。(The simulation program of collaborative communication, help study of collaborative communication infrastructure knowledge.)

ScopeMath_v2.5 - Matlab Libraries for Scope

一篇很好的关于PDE的文章，涉及到了基本理论，实现方法，技术路线，值得看看(A very good article on the PDE, relate to the basic theory, methodology, technical line, is worth a look)

两通道滤波器组的设计，包括正交镜像fb,仿酉fb,准确重建fb.(two channel filter design, including the orthogonal images fb, fake Unitary fb, accurate reconstruction fb.)

光伏电池的数学模型，用最常见的数学模型进行编程，仿真效果良好(The mathematical model of photovoltaic cells, with the most common mathematical model for programming, simulation results good)

语音参数提取：短时过零率、短时能量、短时平均幅度、自相关序列、傅里叶分析(Speech parameters extraction: short-time zero-crossing rate, short-time energy, short-term average autocorrelation sequence, Fourier analysis)

说明：  ansys matlab 联合优化，进行 传递txt，进行告知优化应力结果，以便传递数据(Joint optimization, transfer txt, inform optimization stress results, so as to transfer data)

基于小波分析的信号奇异检测和去噪。。。。。。。。。。。。。。。(Based on wavelet analysis and signal singularity detection denoising. . . . . . . . . . . . . . .)

旅行商问题（Travelling Salesman Problem, 简记TSP):假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 此处使用蚁群算法求解TSP问题(Suppose a business trip to visit n cities, he must choose the path to go, pass through the restriction is to visit each city only once, and finally go back to the original departure city. Path selection objective is to get the path distance to the minimum value among all paths.Here,we use the procedure of ant colony algorithm to work out the TSP.)

In this paper, we have proposed a new PAPR reduction technique in MIMO-OFDM systems. It achieves the result which proves the PAPR of 2×2 MIMO-OFDM systems. The parameters of the simulation are determined by standard IEEE 802.11n. From the simulation results, it is shown the proposed method has better PAPR performance in this system. Additionally, when the number of sub-blocks is increased, high PAPR reduction performance can be obtained.