-
final64QAM
64 QAM final modulation
- 2010-10-23 04:25:23下载
- 积分:1
-
metropolis
matlab code for metropolis algorithm
- 2014-11-13 16:13:40下载
- 积分:1
-
weixingtongxindaima
卫星通信系统代码,主要是QPSK,MPSK相关通信代码(something about satellite communication)
- 2014-11-24 10:16:52下载
- 积分:1
-
kmanes2
k means clustering algorithm new 2 cluster
- 2013-11-04 05:00:43下载
- 积分:1
-
3DPie
VML画饼形图的一个小例子,供大家参考一下吧(VML-shaped graph画饼a small example for your reference yourself)
- 2008-01-23 10:46:42下载
- 积分:1
-
MATPOWER-OPF-slides-zimmerman
this is an explanation about matpower
- 2020-09-02 03:28:08下载
- 积分:1
-
matlab
隶属度函数 光伏电池最大功率点追踪的实现 模糊控制算法(Membership function of photovoltaic cells to achieve maximum power point tracking fuzzy control algorithm)
- 2013-03-04 15:50:20下载
- 积分:1
-
PDE
MATLAB PDE的一个例子 源程序
可以了解MATLAB在处理二阶偏微分方程时的一些有用思路(MATLAB PDE An example of MATLAB source code can be understood when dealing with second-order partial differential equations with some useful ideas)
- 2013-11-12 21:22:48下载
- 积分:1
-
recursion
说明: 递归,是函数实现的一个很重要的环节,很多程序中都或多或少的使用了递归函数。递归的意思就是函数自己调用自己本身,或者在自己函数调用的下级函数中调用自己。
递归之所以能实现,是因为函数的每个执行过程都在栈中有自己的形参和局部变量的拷贝,这些拷贝和函数的其他执行过程毫不相干。这种机制是当代大多数程序设计语言实现子程序结构的基础,是使得递归成为可能。(Recursion, is a function to achieve a very important part of many programs are more or less use the recursive function. Recursive mean that the function of its own call to themselves or subordinates in their own function calls a function to call their own. Recursion that can be achieved because the function of each execution in the stack has its own shape parameters and local variables of the copy, the copy and the implementation process has nothing to do other functions. This mechanism is the most modern programming language implementation subroutine structure of the foundation is to make recursion possible.)
- 2009-08-30 16:26:06下载
- 积分:1
-
MATLAB-Fibonacci
写一个MATLAB函数fibo.m来计算Fibonacci数列,其定义如下: fibo(n+2)=fibo(n+1)+fibo(n) 此数列的初始条件如下:fibo(1)=0,fibo(2)=1。(Fibo.m write a MATLAB function to calculate the Fibonacci sequence, which is defined as follows: fibo (n+2) = fibo (n+1)+fibo (n) the initial conditions in this series are as follows: fibo (1) = 0, fibo (2) = 1.)
- 2014-12-12 06:07:28下载
- 积分:1