svmstephan

Approximate Genetic Algorithm

载波调制的数字传输：载波相位调制和代码实现 (Modulation of the Digital Transmission: Carrier-phase modulation and code implementation)

偏微分方程PDE的求解，一维无源扩散，使用数值计算求解中的插值法。(this is a program to solve a partial differential eqution using inserting methods. The PDE is 1 Dimensional)

SCMA译码仿真，做毕业设计的时候写的。可能效果不是最理想的(SCMA decoding simulation)

详细介绍了ofdm的发送模块、接收模块及信道估计(Ofdm described in detail the transmission module, receiver module and Channel Estimation)

在matlab中实现兴趣点检测，简单易用，效果较好(This package implements the interest point detector in Matlab)

说明：  Signal system and Matlab courses in the series of high-level programming and engineering applications

libsvm, a classical svm toolbox

Principal component analysis (PCA) is a mathematical procedure that uses an orthogonal transformation to convert a set of observations of possibly correlated variables into a set of values of linearly uncorrelated variables called principal components. The number of principal components is less than or equal to the numbe

DTW算法的程序，申请两个n*m的矩阵D、d,分别为累积距离和帧匹配距离。这里n和m为测试模版与参考模版的帧数。然后通过一个循环计算两个模版的帧匹配距离d。接下来进行动态规划，为每个格点 （i，j）都计算其三个可能的前续格点的累积距离D1，D2，D3。考虑到边界问题，有些前续格点可能不存在，因此加入一些判断条件最后利用最小值函数min()，找到三个前续格点的累积 距离作为累积距离，与当前帧的匹配距离d（i，j）相加，作为当前格点的累积距离。该计算过程一直达到格点（n，m），并将D（n，m）输出，作为模版匹配的结果。(DTW algorithm procedures, apply two n* m matrix D, d, respectively, accumulated distance and frame matching distance. Where n and m is a reference test pattern and the template frames. Then through a loop to calculate two frames template matching distance d. Next, dynamic programming, for each grid point (i, j) are calculated from the cumulative D1 before the renewal of its three possible lattice point, D2, D3. Taking into account the boundary problem, some former continued grid point may not exist, so add some conditions to determine the final use of the minimum function min (), found three former continued accumulation of grid points cumulative distance as the distance from the current frame to match the d (i, j) added, and a current cumulative distance grid. This calculation has reached the grid (n, m), and D (n, m) output, as a result of template matching.)