New_IFFT

实现不同模式之间可分性的分析，找到两类特征区别于彼此的特征点/段，以用于分类。(Separability between different modes to achieve the analysis)

Computing the BER for MIMO system with MINIMUM MEAN SQUARE ERROR Equalization in a Rayleigh fading channel.

完成复杂网络基本操作，基于网络图模型，可与图论算法及其matla实现配套使用(Complete complex network basic operation, based on network graph model)

说明：  基于MATLAB完成的神经网络源程序,可以利用该程序完成有关神经网络的应用。(MATLAB based on the completion of the neural network source code, you can use the program to complete the neural network applications.)

内螺旋覆盖搜索的一个算法实现，运行为plotdmap（a,b,c,d）a,b,c,d为数字，a,b为栅格地图的长宽，c为搜索目标的数量，位置自动随机出现杂地图上，d为搜索车辆的数量，位置分布在地图最外围。(Cover a spiral search algorithm, run for the plotdmap (a, b, c, d) a, b, c, d for the number, a, b for the grid map of the length and width, c is the number of search targets, location Auto randomly mixed map, d the number of vehicles for the search, location map of the distribution in the outermost.)

matlab实现爱趣无穷控制，不错的，希望大家喜欢。(matlab infinite control to achieve love interest, good, hope you like it.)

数字水印在linux下面运行的代码，内有详细的注释说名(a watermarking program which can run under Linux. Attached with clear instructions.)

用matlab/simulink搭建的铅酸蓄电池充电模型。(Using matlab/simulink model to build the lead-acid battery charging.)

The Z-source converter (ZSC) is a new topology in power conversion, which has unique features that can overcome the limitations of VSI and CSI [5]. Figure 2.1 shows the ZSC implemented as a 3-phase DC/AC converter (inverter). Although DC/AC conversion is the most common application of the Z-source topology, it can also be applied to AC/DC and AC/AC power conversions [24-25]. The X shape impedance is the Z-source network which is composed of two split inductors and two capacitors to provide a coupling between the DC source and the inverter bridge

说明：  最大流问题，一种组合最优化问题，就是要讨论如何充分利用装置的能力，使得运输的流量最大，以取得最好的效果。求最大流的标号算法最早由福特和福克逊于1956年提出，20世纪50年代福特、福克逊建立的“网络流理论”，是网络应用的重要组成成分。(Maximum flow problem, a combinatorial optimization problem, is to discuss how to make full use of the capacity of the device to maximize the flow of transport in order to achieve the best results. The labeling algorithm for maximum flow was first proposed by Ford and Fulkerson in 1956. The network flow theory established by Ford and Fulkerson in 1950s is an important component of network application.)