signal-denoising

有关于mimo系统的多用户检测的仿真，分别对1发4收、2发4收、3发4收、4发4收的情况进行的仿真，并给出了误码率曲线图(Mimo systems on the detection of multi-user simulation, respectively, close to 1 made 4, 2 fat, 4 close, 3 fat, 4 close, 4 fat, 4 close to the situation of the simulation, and gives a bit error rate curves)

3-Dimension FDTD代码PEC边界(3-Dimension FDTD code PEC boundary)

CS_MRI:压缩感知（CS）在MRI领域的应用.程序实现展示了CS在MRI的重要作用和明显效果。对于那些CS初学者有着极大的帮助。(CS_MRI:Compressive Sensing s application in MRI field. Codes realize and show the great significance of CS in MRI field.It can be of great help to those fresh in CS field.)

baker（面包师变换）的混沌图像，面包师变换是混沌的一种，是一维的混沌映射。vanderpol混沌系统的图像(baker (baker transform) of chaotic image, the baker's transformation is a chaotic, is a dimension of chaotic maps. Vanderpol chaotic system image)

在一个MIMO系统里对ZF，MF，MMSE三种不同预编码准则和滤波器进行了仿真，并比较其不同。(In a MIMO system for ZF, MF, MMSE precoding three different criteria and filter simulation, and compare its different.)

MATLAB中文帮助文档，初学者的好帮手，方便随时查阅各类函数。(Chinese MATLAB help files, a good helper for beginners, convenient access to various types of functions at any time.)

说明：  对弹丸飞行稳定性进行了分析,文中提出利用M GAERO 气动软件计算弹丸的气动力参数,以减少采 用经验公式估算气动力系数和压心位置等参数带来的误差,可为弹丸飞行稳定性分析和总体参数设计提供 参考依据。(For projectile flight stability analysis, this paper proposes the use of software to calculate projectile M GAERO aerodynamic aerodynamic parameters to reduce the use of empirical estimates of aerodynamic coefficients and parameters such as pressure center position error caused by, for projectile flight stability analysis and overall parameters of the design of reference.)

weather prediction using ANFIS

说明：  国外牛人写得背景分割程序，供大家参考！………………(background)

For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).