spatialfiltering

buttreworth filters

Advanced correlation filter synthesis algorithms to achieve rotation invariance are described. We use a specified form for the filter as the rotation invariance constraint and derive a general closed-form solution for a multiclass rotation-invariant filter that can recognize a number of different objects. By requiring the filter to minimize the average correlation plane energy, we produce a multiclass rotation invariant (RI) RI-MACE filter, which controls correlation plane sidelobes and improves discrimination against false targets. To improve noise performance, we require the filter to minimize a weighted sum of correlation plane signal and noise energy. Initial test results of all filters are provided

Pe rceptron, con ve rgence, and gene rali zati on Recall tha t we ar e dealing with linear classifiers throug h origin, i.e.

Gold序列是基于m序列优选对产生的，是由两个长度相同、速率相同、但码字不同的m序列优选对模2加后得到的，一对长度为N的m序列优选对可以产生N＋2条Gold码。(Gold sequence is based on the optimization of m sequences generated by both the length of the same, the same rate, but different m codeword sequence optimization of mode 2 increases obtained, a pair of length N of the m sequence optimization can generate N 2 Article Gold code.)

用与自适应波束合成DBF的波形仿真与功能实现(Adaptive beamforming using DBF waveform synthesis and function of the realization of simulation)

运用最小二乘向量机，去拟合边界。可以较好的拟合边界(The use of least squares vector machines to fit the boundary)

一种新型的信道编码的仿真程序，在下一代无线通信中比较有用(a new channel coding of the simulation program in the next generation of wireless communications more useful)

智能天线技术Matlab版本的源码，方便对照学习(Smart antenna technology versions of Matlab source code, easy to learn controls)

基于LMS算法的两路信号的典型自适应噪声对消求解，程序已调试可运行，结果准确。(Adaptive Noise LMS algorithm based on a typical two-way signal cancellation solving, debugging procedure has been run, results are accurate.)

说明：   模拟退火算法求函数 f(x)的最小值点， 且 l <= x <= u f为待求函数，x0为初值点，l，u分别为搜索区间的上下限，kmax为最大迭代次数 q为退火因子，TolFun为函数容许误差 算法第一步根据输入变量数，将某些量设为缺省值( Simulated annealing algorithm of a function f (x) the minimum point, and l &lt = x &lt = u f is the unknown function, x0 as the initial point, l, u, respectively, lower and upper limits for the search interval, kmax is the maximum q iterations for the annealing factor, TolFun as a function of allowable error algorithm is the first step according to the number of input variables, set default values for certain amount of)