matlab_yichuangongjuxiang

fisher 图片处理报告，程序搜索Fisher program(fisher image processing reports, program searches Fisher program)

matlab下可以直接使用的小程序 包括各种常用算法 对应书籍为《matlab宝典》(matlab can be directly used for small programs, including such popular books as the corresponding algorithm " matlab Collection" )

mimi_ofdm multipath channel emulation, including waveform shape,

BRC MATLAB code for BRC.fig BRC, by itself, creates a new BRC or raises the existing singleton*. H = BRC returns the handle to a new BRC or the handle to the existing singleton CALLBACK ,hObject,eventData,handles,...) calls the local function named CALLBACK in BRC.M with the given input arguments.BRC Property , Value ,...) creates a new BRC or raises the existing singleton.Starting from the left, property value pairs are applied to the GUI before BRC_OpeningFcn gets called.An unrecognized property name or invalid value makes property application stop. All inputs are passed to BRC_OpeningFcn via varargin.See GUI Options on GUIDE s Tools menu. Choose "GUI allows only one.instance to run (singleton)".Edit the above text to modify the response to help.Begin initialization code - DO NOT EDIT

说明：  基于色彩的图像分割，可用于车牌检测，基于matlab编写。(Image segmentation based on color, license plate can be used to detect)

这是一本有关MATLAB的参考书，适合于使用MATLAB或正在打算使用MATLAB的读者。其中还附有书中相关的源代码，很实用，需要的可以看看(This is a reference book about MATLAB, suitable for use or are planning to use MATLAB MATLAB readers. Which is also associated with the book s source code, it is useful, it needs to look at)

圆阵列信号测向算法，圆阵列信号测向算法，(Circular array signal direction finding algorithm)

FDTD 2D with PML based on Sullivan 2D + PML and Lazzi 2D code Carlos J. Cela, March 2012

FM调频广播simulink仿真，各参数已经设置好了，大家尽管用就好了(FM radio simulink, various parameters have been set up, though everyone use it)

说明：  禁忌（Tabu Search）算法是一种亚启发式(meta-heuristic)随机搜索算法，它从一个初始可行解出发，选择一系列的特定搜索方向（移动）作为试探，选择实现让特定的目标函数值变化最多的移动。为了避免陷入局部最优解，TS搜索中采用了一种灵活的“记忆”技术，对已经进行的优化过程进行记录和选择，指导下一步的搜索方向，这就是Tabu表的建立。(Tabu Search algorithm is a meta-heuristic random search algorithm. It starts from an initial feasible solution, chooses a series of specific search directions (movement) as a trial, and chooses to achieve the movement that makes the most changes in the value of a specific objective function. To avoid falling into local optimum, TS search uses a flexible "memory" technology to record and select the optimization process that has been carried out, and to guide the next search direction, which is the establishment of Tabu table.)