wave1

In this simulink model , QPSK modulation and demodulation is simulated .A square root raised cosine pulse shaped signal is modulated and given as input to the demodulator.The received signal is demodulated and given to the detector where it is matched filtered and down-sampled .The effects of symbol timing offset can be seen by varying the phase of down-sampling operation.The signal transmitted is recovered at the detector output.

该程序用matlab写成，已包含vof（根据Hirt的方法）内容，但该部分尚不成熟。对于不包含自由面的计算比较成功。(The program written with matlab, included vof (according to Hirt' s method) content, but that part is not yet mature. For the calculation of the free surface does not contain more successful.)

能够实现Simulink 简单的pm调制解调(Implementation of Simulink PM modem)

：独立成分分析 ( I C A)在国内尚属一门新型的方法 介绍了I C A的原理及其算法 ，然后介绍了该算法在盲源 信号分离中的具体应用，并将此方法 与主成分方洼 ( P C A)进行了比较(: Independent Component Analysis (ICA) in China is a new method to introduce the principle of the ICA and its algorithm, and then introduced the algorithm for blind source separation in the concrete application of this method and with the principal component to depression ( PCA) were compared)

可以用该程序来学习simulink,是最基础的东西(you can use it to study simulink)

matlab vide the examined window into cells (e.g. 16x16 pixels for each cell). For each pixel in a cell, compare the pixel to each of its 8 neighbors (on its left-top, left-middle, left-bottom, right-top, etc.). Follow the pixels along a circle, i.e. clockwise or counter-clockwise. Where the center pixel s value is greater than the neighbor s value, write 1 . Otherwise, write 0 . This gives an 8-digit binary number (which is usually converted to decimal for convenie

说明：  matlab实现： ①用乘同余数法产生白噪声 ②遗忘因子递推最小二乘参数估计（FFRLS）③M序列及逆M序列的产生④批处理最小二乘参数估计（LS）⑤产生m序列(Use by remnant produce white noise with law )

matlab实现目前常用的数据融合的方法(matlab data fusion)

编程经验的总结，教导我们如何编写高效无错的优质代码，包括编码习惯以及程序检错等(Programming and experience to teach us how to write high-quality and efficient error-free code, including coding practices, and procedures for error detection, etc.)

For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).