ch3

利用floyd算法能解决最短路径的选择功能还有最短路径的距离(Use of Floyd algorithm can solve the shortest path choice function and the shortest path distance)

利用matlab将excel文件中的数据导入或导出，介绍相应函数的用法(Using matlab to excel file import or export data to introduce the usage of the corresponding function)

Calculates the result of Euler s Phi funtion for any natural number less than 10^18.

a*算法与d算法的路径规划基于MATLAB的实现(Realization of Path Planning of a* and D Algorithms in MATLAB)

图像特征提取 特征提取 matlab 特征提取 图像特征 (Image feature extraction feature extraction feature extraction matlab image features)

说明：  包括有维纳滤波器设计等离散随机信号分析的matlab程序(Matlab program for discrete random signal analysis including Wiener filter design)

在使用MATLAB完成小波变换程序和通过阈值来压缩图像的过程中，我和许多同学都是边学边用，是从一个接一个的问题中逐步理解小波和MATLAB编写程序的。因此我愿意就个人遇到和解决问题的经验与大家讨论，希望能够对遇到同样问题的人有所帮助。(using MATLAB completed wavelet transform procedures and through the threshold to compress images of the process, I and many of my classmates are used to learn while, is a problem then a gradual understanding of wavelet and MATLAB preparation procedures. Therefore I am willing to personally encounter and the experience to solve the problem with us, it is hoped to have the same problem of some help.)

用巴特沃斯方法和切比雪夫方法做的数字带通滤波器(Bandpass filter using the method of Butterworth and cut the number of Chebyshev method )

里面是关于通信中同步技术的一些试验模型，主要有bpsk和qpsk的simulink仿真(Which is about the communication synchronization of some experimental models, mainly bpsk and qpsk the simulink simulation)

迭代法是解线性代数方程组的另一类方法，特别适用于解大型稀疏线性方程组。它的基本思想是针对求解问题预先设计好某种迭代格式，从而产生求解问题的近似解迭代序列，在迭代序列收敛于精确解的情况下，按精度要求取某个迭代值作为问题解的近似值。迭代法具有原始系数举证始终不变，算法简单，编写程序较方便，所需存储单元较少的优点。(iterative method was the linear algebraic equations of the other methods, particularly applicable to the large sparse linear equations. The basic idea is to solve the problem in advance against the design iteration some good format, thereby creating problems for the approximate solution of iterative sequence, the iterative sequence converges to the exact solution, precision demanded by a certain value as a question iterative solution approximation. Iteration with the original proof coefficient remains unchanged, the algorithm is simple, the preparation process more convenient, less required storage unit advantages.)