PerformanceEvaluationIEEE802.15.4PHY_Matlab

移动通信中的多用户检测算法的实现与比较，很实用的matlab程序(Mobile Communications in the realization of multi-user detection algorithm and comparison, it is useful matlab program)

平板光波导归一化频率和传播模式计算与图解(Planar optical waveguide owned by one frequency and mode of transmission and illustrations )

说明：  This is a time series analysis matlab under the ARMA model and prediction procedures. ARMA algorithm by using a series of data to predict and analyze the prediction rule

永磁直驱风机相关文献，对于初学者，你值得一看(PMSG paper)

farsi common component very easy persian

我们可以用这个程序来计算信息论中的一个重要的概念，即数据的冗余度(we can use it to calculate the recedency)

西蒙赫金的《自适应滤波原理》一书的matlab程序，现在继续上传第7章的程序， 大家学习交流，觉得有用的自己下载，(西蒙赫payment principle of adaptive filtering, one book matlab procedure, we shall now continue From Chapter 7 of the procedure, we study the exchange of their own find useful downloads,)

基于铌酸锂光波导中飞秒光参量放大过程中的脉宽变化及各光波的传播三维图matlab源代码(Based on lithium niobate waveguide femtosecond optical parametric amplification process changes and the light pulse propagation three-dimensional map matlab source code)

PID仿真程序，且带有扰动信号，仿真结果理想，PID的抗扰动能力好(PID simulation program, and with the disturbance signal, the ideal simulation, PID good anti-disturbance)

MMT is a Matlab toolbox implementing the multi-task Lasso models, including: (i) the Lasso (ii) the standard multi-task Lasso, i.e. the group Lasso (iii) the structured input-output multi-task Lasso, a.k.a. the two-graph guided multi-task Lasso proposed in [1]. The last case (iii) subsumes the special cases: tree-guided and the feature-graph guided multi-task Lasso. The core optimization algorithm for solving this model is developed in C to enhance greater computational efficiency. In particular, current scalability of the coefficient matrix that has been tested for MMT is 104*104! The structured input-output multi-task Lasso model is well-suited for addressing the expression quantitative trait loci (eQTL) mapping problems which are of the intrinsic high-dimensional nature. Details can be found in [1].