matlab_pipe

BPSK QPSK 16QAM BFSK 在高斯信道下，瑞丽信道下，多径（三条径）下的误码率仿真对比，(BPSK QPSK 16QAM BFSK in Gaussian channel, under Ruili Channel, multipath error rate (three diameter) under the simulation comparison,)

显示梯度图像，寻找图像中最大像素值并找出边界。(show the gradient of a picture,find the edge of big pixel in a picture)

很好的matlab书籍，最好的是：书中的文本可以选择，对编程极为有利(Matlab good books, the best is: the text of the book to choose from, be extremely beneficial to the program)

writing function files with Matlab

基于小波变换和OMP算法的稀疏表示,不仅包括适用于黑白图片的程序，也包括适用于彩色图片的程序。(the sparse representation basing on wavelet and omp,not only for the gray image,but also color image )

DecayWav.txt输入下冲激响应，应用最小二乘算法对ARMA模型参数进行估计(DecayWav.txt input impulse response, using the least square algorithm to estimate the parameters of the ARMA model)

It is project report for MATLAB GUI designed for performance evaluation of three phase induction motor. This report illustrated the implementation and use of the GUI

说明：  matlab code OFDM SC FDMA OFDMA PAPR matlab code OFDM SC FDMA OFDMA PAPR matlab code OFDM SC FDMA OFDMA PAPR matlab code OFDM SC FDMA OFDMA PAPR

Matlab入门手册，解压后是word版本。适合初学者学习入门(Matlab Getting Started manual, after extracting word version. Suitable for beginners learning portal)

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.)