-
Tflmsziph
该程序用matlab实现FLLMS算法，并绘出了收敛曲线。
(The program using matlab achieve FLLMS algorithms, and plot the convergence curve.)
- 2012-07-26 15:40:34下载
- 积分：1
-
power-flow
网络的三相计算机潮流案例，基于MATLAB 的计算机潮流及其可视化(Three-phase current case computer networks, computer-based trend MATLAB and Visualization)
- 2015-05-29 12:57:53下载
- 积分：1
-
TurboDecodeAlgorithm
3GPP标准Turbo码编码译码仿真Matlab6.5及VC6.0源代码，并包含Turbo码编码译码原理的介绍文档。(3GPP standard Turbo coding and decoding simulation VC6.0 Matalab 6.5 source code , and includes Turbo Encoder Decoder description of the principle of documentation.)
- 2006-10-11 00:53:04下载
- 积分：1
-
Object-oriented-programming-(OOP)
Object-oriented programming (OOP) - Simple sales
- 2015-03-14 22:49:48下载
- 积分：1
-
Recursive_integer_division
递归法求解整数划分。
整数划分，是指把一个正整数n写成如下形式：
n=m1+m2+…+mi （其中mi为正整数，并且1 <= mi <= n），则{m1,m2,...,mi}为n的一个划分。
如果{m1,m2,...,mi}中的最大值不超过m，即max(m1,m2,...,mi)<=m，则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )
- 2014-02-06 14:21:38下载
- 积分：1
-
1133671672316
1133671672316介绍matlab的应用(1133671672316 introduced the application of matlab)
- 2008-01-04 17:21:40下载
- 积分：1
-
DDEServerSample
DDE服务器编写例程，实用DDEML类库实现，简单易用。(DDE server to prepare routines, practical implementation DDEML class, easy to use.)
- 2009-03-03 19:57:51下载
- 积分：1
-
MatLabmingling
MATLAB命令大全，收录庞大的MATLAB命令，令你在进行数值分析计算时更加方便(MATLAB command Daquan, contains a large MATLAB commands, so that you are going through is more convenient for numerical analysis and calculation)
- 2009-10-07 15:50:43下载
- 积分：1
-
Licenta
This is my whole part of visual basic my licence project!
- 2014-12-03 04:17:40下载
- 积分：1
-
viterbi-matlab
卷积编码器g1=111,g2=101
x为输入的待译码序列
x=[1,0,1,0,0,1,0,0,0,1,0,1,1,1]
x=[1,1,0,1,0,1,1,0,0,1]
x=[1,1,1,0,0,0,1,0,1,1]
a=size(x) 输入序列的长度
s=a(2)/2 译码后的m序列长度为x的一半
m=zeros(1,s) 最终结果存放
ma=zeros(1,s+1) 存放Fa路径的
mb=zeros(1,s+1) 存放Fb路径的
mc=zeros(1,s+1) 存放Fc路径的
md=zeros(1,s+1) 存放Fd路径的(viterbi decoder)
- 2015-04-20 17:06:18下载
- 积分：1
