-
myGaussSeidel
用高斯赛德尔迭代法解椭圆型方程，这是一种差分解法(High Sisaideer iterative method for solving elliptic equations, which is a differential solution)
- 2013-12-08 12:27:40下载
- 积分：1
-
Ultra_wide_Fundamental_test
说明： uwb各种程序，可以产生信号、冲激响应等等各类仿真任务完美完成(UWB programs can generate signals, impulse response and other simulation tasks to complete perfectly)
- 2020-06-25 04:20:02下载
- 积分：1
-
shangbiao
商标的matlab分割源程序。并附matlab画心函数实现程序。(Trademark matlab segmentation source. Together with Matlab painting heart function program.
)
- 2012-05-05 12:33:29下载
- 积分：1
-
090
sliding mode control 3
- 2012-07-08 21:36:05下载
- 积分：1
-
DIT_FFT_WAWS-for-tower
针对塔架建立的谐波叠加法模拟风速，计算时间长(Long calculation time simulation of wind tower to establish harmony superposition method)
- 2013-04-26 17:15:11下载
- 积分：1
-
decoder_EMS
多进制LDPC扩展最小和译码（EMS），已经成功
希望对后面研究的小伙伴有帮助(GF(q) LDPC decoding the minimum and extended (EMS), has successfully)
- 2014-07-29 16:33:33下载
- 积分：1
-
fano
设有离散无记忆信源X,P(X)．二进制费诺编码为：1.将信源符号按概率从大到小的顺序排列2.将信源分成两组――按两组概率之差为最小分．3.上面一组编码为0，下面一组编码为1，一直分到一组只有一个信源为止．4.将一个信源分组得到的0和1全部连接起来，组成该信源的码字，信源即得到自己的费诺编码．(There be no X remembering the message source in case that having being scattered, binary Feinuo of P (X) code is: 1. Will believe that the source sign orders 2 according to probability is minor from arriving at greatly sequence. Will believe that the source divides into two part being allotted 3 according to two set of bad of probability for the minimum. A group of code is 0 above , a group of code is 1 underneath, till dividing till a group only when one believes a source 4. Get up with a 0 and 1 all connection believing that the source is divided into groups and , be composed of the codon owing message a source , believe that the source is to get self Feinuo code
Powered )
- 2009-11-27 12:04:44下载
- 积分：1
-
znpidtuning
Z-N算法，我做了几个事例，希望对大家有用。(ZN algorithm, I do a few examples of the hope that useful.)
- 2012-05-28 21:01:50下载
- 积分：1
-
GA
说明： 本程序运行需一个小时左右。优化准则是旁瓣电平最小。取栅格间距为lemda/2,阵元间距为栅格间距的整数倍。放阵元的位置放1，否则放0(This program should be running an hour or so. Rule of optimization is side-lobe level minimum. Take grid spacing for lemda/2, spacing for grid spacing array (integer times. Put the position of the array (put 1, otherwise put 0
)
- 2011-12-19 15:44:30下载
- 积分：1
-
Win32GUI
windows gui wrapper for fb
- 2013-12-12 15:44:33下载
- 积分：1
|
联系客服（QQ：3324461878）
