mrc_ber

The software is capable to simulate space time code [1] for QPSK modulation using different number of state. Examples of generator matrix up to 256 stetes are provided. Variable signal to noise ratio (SNR) might be applied to produce bit error rate (BER) or frame error rate (FER) curves.(The software is capable to simulate space time code [1] for QPSK modulation using different number of state. Examples of generator matrix up to 256 stetes are provided. Variable signal to noise ratio (SNR) might be applied to produce bit error rate (BER ) or frame error rate (FER) curves.)

matlab编写的生源定位程序 采用十字阵型(matlab prepared students locate the program using cross formation)

This Matlab code implements an edge based geometric active contour model without reinitialization. MATLAB Release: R13SP1 This Matlab code implements the level set method in Chunming Li et al s paper "Level Set Evolution without Re-initialization: A New Variational Formulation", in IEEE Proc. of CVPR 2005. EVOLUTION.m: core function that performs level set evolution. Demo1.m: a demo for a real cell images Demo2.m: a demo for a synthetic noisy image Demo1_ManualBinaryInitial: demo for the same image in Demo1, allows manual initialization by the user Demo2_ManualBinaryInitial: demo for the same image in Demo2, allows manual initialization by the user

实现小波3级分解 构建3维跨频带矢量 然后LBG聚类 再重构原图像(Construction of wavelet decomposition to achieve three inter-band 3-D vector and then reconstruct the original image LBG clustering)

Bounded Distortion Mapping Spaces For Triangular Meshes 配套代码(Bounded Distortion Mapping Spaces For Triangular Meshes)

基线校正代码，包括小波基线校正及滤波器基线校正，可用于光谱数据的预处理。(Baseline correction codes, including wavelet baseline correction and filter baseline correction, can be used for preprocessing of spectral data.)

关于OFDMA资源分配的几种算法，具有较高的参考价值。(Some on the OFDMA resource allocation algorithm, has high reference value.)

说明：  matlab 图论 中所有程序 求最短路。。最小生成树。。网络最大流等。。。(matlab graph theory for the short-circuit all the procedures. . Minimum spanning tree. . Network, such as maximum flow. . .)

Dijkstra算法是典型最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止(Dijkstra' s algorithm is a typical shortest path algorithm used to calculate a node to all other nodes of the shortest path. Main features is the starting point for the center layers expand outward until the end date extended to)

入侵性杂草算法，连续型，多目标，多维函数优化。(invasive weed 0ptimization is a good optimal tools for any continual problem. IWO has been successfully applied to several electromagnetic optimization problems)