-
Boiler1
Boiler1 pid fuzzy controller wiyh details
- 2012-05-29 17:12:36下载
- 积分：1
-
ZF-STBC-MIMO
Zero Forcing 联合 STBC 编码仿真，自带STBC编码，很全的。(Zero Forcing joint STBC encoder emulation, comes with STBC encoding is complete.)
- 2011-11-05 20:29:00下载
- 积分：1
-
Programs
efficient transmit beamspace design for search-free based doa estimation in mimo radar
- 2015-03-10 19:31:15下载
- 积分：1
-
pwmzhengliu
给大家提供一个最基础的simulink仿真的列子
(To provide a most basic simulation simulink Liezi)
- 2009-04-26 15:24:41下载
- 积分：1
-
psool
PSO Code for finding out the minimum value of two variables in a function
- 2013-09-05 05:10:26下载
- 积分：1
-
wavelete
一种基于小波变换的图像编码算法采用整数平方阈值下的零树编码(Wavelet-based image coding algorithm uses integer square threshold of zero-tree coding)
- 2007-11-23 20:24:48下载
- 积分：1
-
ldpc_irrwbf
implementation efficient reliability ratio based weighted bit flipping
- 2010-11-24 22:16:30下载
- 积分：1
-
poincare
Poincare Index for singular point
- 2011-12-13 14:01:48下载
- 积分：1
-
murmatlab
摩尔边界的源码在计算电磁学中有很大应用大家好好学习！！！(Moore border in the calculation of electromagnetic source in the study have significant application study hard everyone! ! !)
- 2009-03-12 16:37:37下载
- 积分：1
-
adapQuad
迭代自适应Simpson，Lobatto积分
In almost every standard book on numerics quadrature algorithms like the adaptive Simpson or the adaptive Lobatto algorithm are presented in a recursive way. The benefit of the recursive programming is the compact and clear representation. However, recursive quadrature algorithms might be transformed into iterative quadrature algorithms without major modifications in the structure of the algorithm.
We present iterative adaptive quadrature algorithm (adaptiveSimpson and adaptiveLobatto), which preserves the compactness and the clarity of the recursive algorithms (e.g. quad, quadv, and quadl). Our iterative algorithm provides a parallel calculation of the integration function, which leads to tremendous gain in run-time, in general. Our results suggest a general iterative and not a recursive implementation of adaptive quadrature formulas, once the programming language permits parallel access to the integration function. For details the attached PDF file Conrad_08.pdf. (Iterative Adaptive Simpson, Lobatto Points In almost every standard book on numerics quadrature algorithms like the adaptive Simpson or the adaptive Lobatto algorithm are presented in a recursive way. The benefit of the recursive programming is the compact and clear representation. However, recursive quadrature algorithms might be transformed into iterative quadrature algorithms without major modifications in the structure of the algorithm.We present iterative adaptive quadrature algorithm (adaptiveSimpson and adaptiveLobatto), which preserves the compactness and the clarity of the recursive algorithms (eg quad, quadv, and quadl) . Our iterative algorithm provides a parallel calculation of the integration function, which leads to tremendous gain in run-time, in general. Our results suggest a general iterative and not a recursive implementation of adaptive quadrature formulas, once the programming language permits parallel access to the integration function. For details the attached PDF file Conrad_08.pdf.)
- 2008-08-14 22:44:04下载
- 积分：1
