Assignment-2

Solves the incompressible Navier-Stokes equations in a rectangular domain with prescribed velocities along the boundary. The standard setup solves a lid driven cavity problem.

说明：  快速脊波逆变换。也称为伴随和伪逆。也成为快速三角波逆变换。(Fast Inverse Curvelet Transform.This is in fact the adjoint, also the pseudo-inverse)

利用matlab求QAM的一个程序实例，很实用(To seek QAM by matlab)

雷达系统分析与设计一书的部分matlab代码。《雷达系统分析与设计》是2008年由电子工业出版社编辑出版的马哈夫扎(MahafzaBassemR.美国)的电子通讯类专著。本书描述了雷达截面积、极化、匹配滤波器和雷达模糊函数及雷达波传播的最新进展，并给出了关于PRN码、多径和折射、高距离分辨率、杂波与MIT处理的有关内容。(Radar systems analysis and design of a part of the matlab code. Radar systems analysis and design in 2008 by the Electronic Press editor industrial publishing Mahafuzha (MahafzaBassemR. USA) electronic communications monographs. This book describes the radar cross section, polarization, and radar matched filter function fuzzy latest progress and radar transmission, and gives information about the PRN code, multipath and refraction, high range resolution, clutter and MIT-treated related content.)

Arnold Algorithm Source Code

实现ITU-R P.676中的天顶方向的大气衰减(the function to calculate the gas attenuation in ITU-R P.676)

在多径瑞利衰落信道下，采用理想信道估计，Rake接收，仿真该系统在不同SNR下的信源误比特率性能，分析系统性能(In multipath Rayleigh fading channels, using the ideal channel estimation, Rake reception, simulation of the system at the source under different SNR BER performance, analyze system performance)

brushless direct current motor

说明：  各种matlab 算法使用指南，及其相关命令的使用方法介绍.(guide for otimization method used in matlab)

说明：  最短路径的Dijkstra算法程序。Dijkstra算法是典型最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。 　　Dijkstra算法是很有代表性的最短路算法，在很多专业课程中都作为基本内容有详细的介绍，如数据结构，图论，运筹学等等。 (The Dijkstra shortest path algorithm for the procedure. Dijkstra algorithm is a typical shortest path algorithm, used to calculate a node to all other nodes of the shortest path. The main characteristics is the starting point as the center outward expansion layers, until the end date be extended to. Dijkstra shortest path algorithm can arrive at the optimal solution, but because of its calculation of the node traversal, so inefficient. Dijkstra algorithm is very representative of the shortest path algorithm, in many professional courses in the basic content as described in detail, such as data structures, graph theory, operational research and so on.)