mgene

A fast Fourier transform (FFT) is an algorithm to compute the discrete Fourier transform (DFT) and its inverse. Fourier analysis converts time (or space) to frequency and vice versa an FFT rapidly computes such transformations by factorizing the DFT matrix into a product of sparse (mostly zero) factors.

一个简单EMD程序 可以很好使用于对EMD分解的初学者，程序中有文字解释(EMD program)

说明：  稀疏的牛顿法潮流程序，谢谢。请下载使用。(Sparse Newton Flow program, thank you. Please download.)

Modify C to get right with smaller another Hamilton circle. The modification methods improved algorithm called circle

这是一个关于全变分的盲复原算法，该算法在实际应用了取得了很好的效果，希望对大家有好处。(This is a variation on the whole of blind image restoration algorithm in the practical application of the good results obtained, we hope to benefit.)

光子晶体matlab程序，有图像表示！比较长；可以仔细研究！(Photonic crystals matlab program, have images that!)

采用Matlab仿真的OFDM链路代码，可以运行并生成性能曲线(maltab code for OFDM communication system,and performance is good)

本文通过理论分析，仿真实现了模拟退火算法。(Through theoretical analysis, simulation to achieve a simulated annealing algorithm.)

该仿真模型是基于matlab的三电平空间矢量整流器，模型由本人自己搭建。运行结果良好。(The simulation model is a three-level space vector rectifier based on matlab.The result is good.)

线性系统理论中对线性系统的可加性齐次性的验证仿真(Linear system theory of linear systems can be added to the homogeneity of the validation of simulation)