eur_call_dw

CLAHE: contrast limited adaptive histogram equalization is one of the most famous algorithm in image enhancement

AWGN Channel simulation with hamming coding. Modulation scheme is BPSK. BER curve is provided. (AWGN Channel simulation with hamming coding. Modulation scheme is BPSK. BER curve is provided.)

说明：  一个关于西安交大的蚁群算法源程序，希望有用。(ACS)

适用于一维EWT的变换文件，所有文件齐全，有测试文件，以及参数解释和帮助word文档，亲测可用。(For one-dimensional EWT transformation files, all the files are complete, there are test files, as well as parameter interpretation and help word documents, pro-test available.)

说明：  随机切换系统稳定性和利用matlab线性矩阵不等式工具箱求可行解(Stability of stochastic switched systems using MATLAB LMI toolbox to find feasible solutions)

Algorithm that solves the Multiple Travelling Salesman Problem (MTPSo) The salesman do not return to their starting location in this algorithm.

说明：  直接使用摄像头检测人脸的程序，正确率还不是很准确(Directly face the camera detection procedure, the correct rate is not very accurate)

说明：  分支定界法（branch and bound）是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划，还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法，选择不同的分支变量和子问题进行分支。 对于两个变量的整数规划问题，使用网格的方法有时更为简单。 [1] 通常，把全部可行解空间反复地分割为越来越小的子集，称为分支；并且对每个子集内的解集计算一个目标下界（对于最小值问题），这称为定界。在每次分枝后，凡是界限超出已知可行解集目标值的那些子集不再进一步分枝，这样，许多子集可不予考虑，这称剪枝。这就是分枝定界法的主要思路。(Branch and bound method is one of the most commonly used algorithms to solve integer programming problems. This method can solve not only pure integer programming but also mixed integer programming. Branch and bound algorithm is a method of search and iteration, which selects branches with different branch variables and sub problems. For integer programming problems with two variables, the grid method is sometimes simpler[ 1] Generally, all feasible solution spaces are divided into smaller and smaller subsets repeatedly, which is called bifurcation; And a lower bound of the objective (for the minimum value problem) is calculated for the solution set in each subset, which is called the bound. After each branch, those subsets whose bounds exceed the objective value of the known feasible solution set will not be further branched, so many subsets can not be considered, which is called pruning. This is the main idea of branch and bound method.)

simulation of communication systems and software defined radio from the book chapter 5

MUSIC算法[1] 是一种基于矩阵特征空间分解的方法。从几何角度讲，信号处理的观测空间可以分解为信号子空间和噪声子空间，显然这两个空间是正交的。信号子空间由阵列接收到的数据协方差矩阵中与信号对应的特征向量组成，噪声子空间则由协方差矩阵中所有最小特征值（噪声方差）对应的特征向量组成。MUSIC算法就是利用这两个互补空间之间的正交特性来估计空间信号的方位。噪声子空间的所有向量被用来构造谱，所有空间方位谱中的峰值位置对应信号的来波方位。MUSIC算法大大提高了测向分辨率，同时适应于任意形状的天线阵列，但是原型MUSIC算法要求来波信号是不相干的。(clear all clc List0= E:DOA估计仿真 List00=[ 2013-10-31_12_44_31 ] for Li=1:1 List1=strcat(List0,List00(Li,:), Data ) In_p=[List1, ChanData ] 输入数据目录 Out_p=strcat([List1, DataDOA ]) 输出数据目录 NLen=10000 分段长度 M=16 r=15 c=299792458 List=List1(end-19:end-1) 选择目录 if(~exist(Out_p, )) mkdir(Out_p) end )