main

包含心电数据的差分、小波、巴特沃思滤波器等滤波方法。(ECG data included differential, Wavelet, Butterworth filter, such as filtering method.)

This program uses the timers to trigger EDMA events. These events in turn * trigger linked EDMA parameter tables to fill a ping pong buffer structure. * Set a breakpoint on swiProcessFunc(int arg). Then open two memory windows. * Use ping as the address for one memory window and pong for the other. Then * run the application. You ll note that the program bounces between the ping * and pong buffers filling each with a value that comes from the source. The * source in this case is the SDRAM timer control register and it simulates * input data(This program uses the timers to trigger EDMA events. These events in turn* trigger linked EDMA parameter tables to fill a ping pong buffer structure.* Set a breakpoint on swiProcessFunc (int arg). Then open two memory windows.* Use ping as the address for one memory window and pong for the other. Then* run the application. You' ll note that the program bounces between the ping* and pong buffers filling each with a value that comes from the source. The* source in this case is the SDRAM timer control register and it simulates* input data)

一个实际的工程实验计算的matlab实例。力学和空气动力学(an actual calculation of the experimental project Matlab examples. Mechanics and aerodynamics)

线性调频信号的灵巧噪声卷积干扰matlab实现(Chirp signal dexterity the noise convolution interference matlab achieved)

用MATLAB编写的svm源程序，可以实现支持向量机，用于特征分类或提取(MATLAB svm prepared by the source, can achieve a support vector machine for the feature classification or extract)

发送CW编码脉冲，进行FSK编码，用自适应滤波器进行译码，经过仿真验证(CW sending coded pulses, FSK encoding and decoding using adaptive filters, through simulation)

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

In order to reproduce Figure 3 in the Replica Paper, do the following in order: 1. Run "Linear_test.m" 2. Run "Lasso_Optimal Regularization.m" 3. Run part 0,1 and 2 (not part 3) from "Lasso_test.m" 4. Run "Zero Norm Regularization_Optimal Regularization.m"

不同发射天线数目下，空时分组编码STBC的仿真(Under different number of transmit antennas, space-time block coding STBC simulation)

understand the triangul [voiceEmotionMP3.rar] - for Emotional Speech Recognition Software for the voice paper for the MP3 format, including sadness, anger, happiness, Panic, calm voice, and other in [speakerprotected1.rar] - Matlab procedure