shuangbizhong

A fully implicit, finite volume, flow solver for the incompressible 3D Navier-Stokes equations with generic scalar transport, in block structured, non-orthogonal, body fitted grids.

AMPERMETER SIMULATION

data converters by maloberti

单相全桥逆变器模型，测试OK，直接运行，需要的参考(Single phase full bridge inverter model)

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

reda mohammed lahcene

说明：  伽罗瓦域中2^8变换乘法逆运算的matlab程序(Galois field multiplication of 2 ^ 8 inverse transform of the matlab program)

均匀线阵列数字波束形成matlaab程序，与大家一起分享 (Uniform linear array digital beamforming matlaab procedures, and shared with)

cloudsim a toolkit to simulate cloud computing

16QAM的误码率性能分析的matlab仿真 (These code are some matlab codes for BPSK modulator and demodulator in fading channels for wireless communications )