mop_5_27_modified_a

对二维图像实现巴特沃斯低通和高通滤波，已经仿真，效果不错。(Pairs of two-dimensional image realization of Butterworth low-pass and high-pass filtering, has been simulation, good results.)

拥有副折射率介质的FDTD结果演示，包括FDTD程序,应用于微波吸收材料，天线等(Finite-Difference Time-Domains Method)

说明：  这是单相mmc最近电平调制的matlab simlink仿真(This is a simlink simulation of single-phase mmc recent level modulation)

一个简单的FIR滤波器实现编程，已经过调试，完全正确可用(A simple FIR filter programming, has been debugging, can be used entirely correct)

用有限差分法、多项式拟合方法和三次样条插值方法对离散数据进行数值微分(Using the finite difference method, polynomial fitting method and cubic spline interpolation method for numerical differentiation of discrete data)

基于FPGA的双口RAM实现及应用,对RAM有一个系统的介绍(The dual-port RAM-based FPGA Implementation and Application of RAM to have a systematic introduction)

里面一共有几个关于连续优化的matlab程序(First there were a few inside for about matlab optimization procedures)

The fusion of images is the process of combining two or more images into a single image retaining important features from each of the images. A scheme for fusion of multi-resolution 2D gray level images based on wavelet transform is presented in this paper. If the images are not already registered, a point-based registration, using affine transformation is performed prior to fusion. The images to be fused are first decomposed into sub images with different frequency and then information fusion is performed using these images under the proposed gradient and relative smoothness criterion. Finally these sub images are reconstructed into the result image with plentiful information. A quantitative measure of the degree of fusion is estimated by cross-correlation coefficient and comparison with some of the existing wavelet transform based image fusion techniques is carried out.

旅行商问题，即TSP问题（Travelling Salesman Problem）又译为旅行推销员问题、货郎担问题，是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路径的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。(Traveling Salesman Problem, or TSP problem (Travelling Salesman Problem) also translated as the traveling salesman problem, traveling salesman problem is one of the well-known problems in the field of mathematics. Suppose you have a travel business to visit n cities, he must choose which path to go, limiting the path is to visit each city only once, and the last to return to the original departure city. Select the destination path is the requirement for the minimum distance path was among all paths.)

this file shows DVBT using the matlab