systemblockdiagram.pdf

小波奇异性检测代码,利用小波多分辨率的特性将突变信号进行多尺度分解，然后通过分解后的信号来确定突变信号的变位置.(This is a study on the Matlab wavelet)

QPSK调制解调误码率及误符号率，相干解调，输出的bitber是误码率，symber是误符号率(QPSK demodulator BER and misuse of the symbol rate, coherent demodulation, the output is bitber BER, symber mistakenly Symbol Rate)

利用LMS算法仿真了各种线性预测滤波器,并证明的该算法效率很高,能节省硬件资源.(LMS algorithm simulation using a variety of linear predictive filter, and demonstrate the high efficiency of the algorithm. can save hardware resources.)

This routine draws a circle with center defined as X_CENTER,,Y_CENTER, radius as a scaler RADIUS.

dfig system with pulse witdh modulation by simulink

：介绍了扩展卡尔曼滤波算法和无迹变换(unscented transformation，UT)算法，并对扩展卡尔曼滤波算法(EKF)和无 迹卡尔曼滤波算法(UKF)进行比较，阐明了UKF优于EKF。在此基础上，提出了一种基于Unscented变换(uT)的高斯和滤 波算法，该算法首先通过合并准则得到适当个数的混合高斯模型，逼近系统中非高斯噪声的概率密度(: Introduction of the extended Kalman filter algorithm and unscented transform (unscented transformation, UT) algorithm, the extended Kalman filter algorithm (EKF) and unscented Kalman filter (UKF) for comparison to clarify the UKF is superior to EKF. On this basis, we propose an approach based on Unscented Transform (uT) and the Gaussian filtering algorithm, which first of all, by merging the appropriate number of criteria to be a mixture of Gaussian model, which was close to the system of the Central African Gaussian noise probability density)

现代数字通信系统中的各种调制技术的和高斯白噪传输的matlab实现。(Modern digital communication systems in a variety of modulation techniques and transmission of Gaussian white noise matlab achieve.)

与Field_II配套使用，提供了一个基于matlab平台的gui界面，可自由定制参数，选择成像方式，功能强大。(This tutorial is designed to give you an introduction to Field_II, an acoustic pressure field simulation package written by Dr. Joergen Jensen. is the method for you. To run this tutorial, you will need to have MATLAB available on your computer. Download the Field_II source code and the Field_II_GUI files to your machine,and then run through the tutorial.)

load flow solution for ieee 14 bus system is attached

遗传算法解决 TSP 问题:已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市只能访问一次，最后又必须返回出发城市(Known n the distance between cities, a salesman must visit the n city, and each city can only visit once, and finally must return to the starting city )