MATLABDSSS

Introduce some main parametters of Radar

polarimetricImage matlabsad

Vedic maths in pdf formate.. easy to learn

此程序实现matlab中对一声音信号进行小波降噪处理。(This program is to achieve the matlab wavelet noise reduction processing a sound signal.)

JITTERBUG 是一个用来仿真线性控制系统的Matlab工具箱。通过JITTERBUG，我们能得到延时、数据丢失对系统的性能影响。同时，这个工具箱还能计算控制系统中信号的谱密度。(JITTERBUG [Lincoln and Cervin, 2002] is a MATLAB-based toolbox that allows the computation of a quadratic performance criterion for a linear control system under various timing conditions. Using the toolbox, one can easily and quickly assert how sensitive a control system is to delay, jitter, lost samples, etc., without resorting to simulation. The tool is quite general and can also be used to investigate jitter-compensating controllers, aperiodic controllers, and multi-rate controllers. As an additional feature, it is also possible to compute the spectral density of the signals in the control system. The main contribution of the toolbox, which is built on well-known theory (LQG theory and jump linear systems), is to make it easy to apply this type of stochastic analysis to a wide range of problems.)

说明：  分支定界法（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.)

bmp to Yuv, DCT transform and quantization 4x4 compression

BPSK 解调 调制方式：BPSK 主要是解调模块的实现(BPSK DEMODULATION)

信号在采集和输送过程中往往会参杂着噪声和干扰，将自适应神经网络与信号处理结合起来，采用最小均方（LSM）算法设计的线性自适应滤波器将信号中的杂波成分滤除。用matlab进行仿真,证实线性自适应滤波器具有良好的滤波功能。(Signal acquisition and delivery process often mingled with the noise and interference, the adaptive neural network combined with signal processing, with a minimum mean square (LSM) linear adaptive filter algorithm designed to signal noise filter components In addition. Using matlab simulation confirms linear adaptive filter has a good filtering.)

combining kalman & imm