complex

牛顿环 杨氏双缝的MATLAB代码，很实用，很准确(Young' s double-slit Newton ring MATLAB code, very practical, very accurate)

omnet下leach算法，有助于omnet的初学者仿真练习(Under the omnet leach algorithm, omnet help beginners simulation practice)

基于FFT平面相控阵天线方向图快速计算 (Figure quickly calculate FFT-based planar phased array antenna direction)

梯度下降法是最早最简单，也是最为常用的最优化方法。梯度下降法实现简单，当目标函数是凸函数时，梯度下降法的解是全局解。一般情况下，其解不保证是全局最优解，梯度下降法的速度也未必是最快的。梯度下降法的优化思想是用当前位置负梯度方向作为搜索方向，因为该方向为当前位置的最快下降方向，所以也被称为是”最速下降法“。最速下降法越接近目标值，步长越小，前进越慢。(The gradient descent method is the earliest and most simple and most commonly used optimization method. The gradient descent method is simple to realize. When the objective function is a convex function, the solution of the gradient descent method is a global solution. In general, the solution is not guaranteed to be the global optimal solution, and the gradient descent method is not necessarily the fastest. The optimization idea of gradient descent method is to use the current position negative gradient direction as the search direction, because the direction is the fastest descending direction of the current position, so it is also called the steepest descent method. The faster the slowest descent approach is closer to the target, the smaller the step, the slower the progress.)

这是一个用于消除用户间干扰的MATLAB代码，利用了最小化干扰泄露的迭代优化算法，将用户接收到的干扰功率逼近于零来实现干扰消除。(This is a MATLAB code for eliminating interference between users, the use of iterative optimization algorithms minimize interference leaked, the user receives interference power approximation to zero to achieve interference cancellation.)

自己写的唯一可译码判定准则，可以准确判定码组是否为唯一可译码组(Write their own unique criteria DECODABLE can accurately determine whether the code group is the only decoding group)

Due to an increase in demand for and questions about direct disk access for Micrososft platforms, and due to the fact that Microsoft has no API for direct disk access, I am releasing this library much earlier than I intended at that start. I am still working on this code. (Due to an increase in demand for and questio ns about direct disk access for Micrososft plat forms, and due to the fact that Microsoft has no API for d Direct disk access, I am releasing this library much earlier than I i ntended at that start. I am still working on this code.)

马尔可夫的pdf资料，讲解详细。资源不错。希望大家和我一样能有所收获。(Markov pdf data, explain in detail. Good resources. I hope you like me can be harvested.)

根据DFT的基二分解方法，可以发现在第L（L表示从左到右的运算级数，L＝1，2，3…M）级中，每个蝶形的两个输入数据相距B=2^(L-1)个点，同一旋转因子对应着间隔为2^L点的2^(M-L)个蝶形。从输入端开始，逐级进行，共进行M级运算。在进行L级运算时，依次求出个2^(L-1)不同的旋转因子，每求出一个旋转因子，就计算完它对应的所有的2^(M-L)个蝶形。因此我们可以用三重循环程序实现FFT变换。同一级中，每个蝶形的两个输入数据只对本蝶形有用，而且每个蝶形的输入、输出数据节点又同在一条水平线上，所以输出数据可以立即存入原输入数据所占用的存储单元。这种方法可称为原址计算，可节省大量的存储单元。附件包含算法流程图和源程序。(err)

该仿真为MATLAB仿真，关于充电桩的仿真，简单，可以运行(it is model on charging system ，it is simple and easy to understang.)