neural_network_Matlab

modeling and simulation of differents technology of wind energy

Abstract—This paper investigates the performance of a 4-switch, 3-phase Z-source inverter (4S3P)

说明：  极化码编码中的scl译码算法，代码含有比较详细的注释(SCL decoding algorithm in polarization code coding with detailed comments)

一般的esprit算法计算复杂度高，在计算子空间是算法比较烦，改一些矩阵算法可以减少其复杂度。(Esprit general algorithm of high computational complexity in the calculation of subspace algorithms trouble is, some matrix algorithm can be changed to reduce its complexity.)

基于最小生成树算法的无线传感器网络数据分发协议的matlab仿真代码，对于传感器网络的研究有用(Based on the minimum spanning tree algorithm for wireless sensor networks matlab simulation data distribution protocol code, useful for the study of sensor networks)

lms算法仿真，及其主要性能分析。步长的影响与学习曲线的分析。(lms algorithm simulation, and its main performance analysis. Step of the analysis and the learning curve.)

有关太阳能集热器最佳倾角及最大接收辐射量的计算模型(Computational model of the solar collector inclination and the maximum received radiation)

OFDM调制模型，采用16QAM方式，并介绍了一种基于这种调制方式下的OFDM载波同步方法。每一步都有英文解释。(OFDM modulation model, using 16QAM mode and introduced an approach based on this modulation method under the OFDM carrier synchronization. English to explain every step.)

uniform quantizer , a quantizer for calcualting the quantized values of the output

说明：  最短路径的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.)