-
adaptive mmse space-time multiuser detection algor
adaptive mmse space-time multiuser detection algorithm.m是自适应MMSE空时多用户检测算法 dec multiuser.m是空时解相关多用户检测算法 cd multiuser.m是空时匹配滤波器 ber.m是误码率计算 conver.m是空时PN码产生文件(adaptive space-time multiuser detec tion is algorithm.m MMSE space-time adaptive multi-user detection algorithm dec multi user.m solution when space is multi-user detection algorithm cd multiuser.m was empty when matched filter ber.m error rate is calculated conver.m was empty at the PN code generated)
- 2007-06-04 13:40:35下载
- 积分：1
-
code
function [r_path, r_cost] = dijkstra(pathS, pathE, transmat)
The Dijkstra s algorithm, Implemented by Yi Wang, 2005
This version support detecting _cyclic-paths_
- 2009-04-27 19:49:50下载
- 积分：1
-
svpwm3
基于matlab的异步电动机仿真控制，控制方式为svpwm波，输出结果理想。(Based on simulation matlab induction motor control, control of svpwm wave output ideal.)
- 2013-11-25 10:09:55下载
- 积分：1
-
相控阵波束扫描“动图”的Matlab仿真
说明： 利用matlab相控阵工具，对相控阵进行仿真，有三个实用例子。(There are three practical examples to simulate the phased array with MATLAB phased array tool)
- 2020-04-22 16:16:34下载
- 积分：1
-
matlab(3)
说明： 基于matlab的正弦波仿真
有波行和频谱，有m函数，程序经过调试(based on Matlab simulation of a sine wave Bank and the spectrum m functions, procedures after debugging)
- 2006-04-16 11:44:43下载
- 积分：1
-
3-2
Fisher判别实现鸢尾花数据集中三类特性两类样本情况下的分类(Fisher discriminant achieve Iris dataset classified into three categories characteristic of the two kinds of case)
- 2014-10-29 19:44:02下载
- 积分：1
-
1001-0548(2012)02-0208-04
宽带CIC抽取滤波器的一种改进方法1001-0548(2012)02-0208-04(Improved Method for Wideband CIC Decimation Filters
)
- 2014-02-01 23:32:08下载
- 积分：1
-
zmax2005
ZEMAX是美国 Radiant Zemax 公司所发展出的光学设计软件，可做光学组件设计与照明系统的照度分析，也可建立反射，折射，绕射等光学模型，并结合优化，公差等分析功能，是套可以运算sequential及Non-Sequential的软件。(ZEMAX is a wonderful too for designing light .)
- 2013-12-27 20:23:00下载
- 积分：1
-
2
说明： 有一个长度为整数L(1<=L<=10000)的马路，可以想象成数轴上长度为L的一个线段，起点是坐标原点，在每个整数坐标点有一棵树，即在0,1,2，...，L共L+1个位置上有L+1棵树。
现在要移走一些树，移走的树的区间用一对数字表示，如 100 200表示移走从100到200之间（包括端点）所有的树。
可能有M(1<=M<=100)个区间，区间之间可能有重叠。现在要求移走所有区间的树之后剩下的树的个数。
输入：
两个整数L(1<=L<=10000)和M(1<=M<=100)。
接下来有M组整数，每组有一对数字。
输出：
可能有多组输入数据，对于每组输入数据，输出一个数，表示移走所有区间的树之后剩下的树的个数。(Has a length of integer L (1 < = L < = 10000) of the road, one can imagine a number line segment of length L, the starting point is the coordinate origin, each integer coordinate points in a tree, i.e. 0,1 , 2, ..., L total has L+1 L+1 positions on the tree. Now to remove some trees, tree removed by a range of digitally represented, such as 100 200 represents removed (inclusive) between 100 and 200 all the trees. There may be M (1 < = M < = 100) intervals, there may be overlap between the intervals. Now, after the number of trees require the removal of all remaining sections of the tree. Input: two integer L (1 < = L < = 10000) and M (1 < = M < = 100). Then there is an integer M groups, each with a pair of numbers. Output: there may be multiple sets of input data, for each set of input data, the output of a number indicating the number of the removal of all remaining sections of the tree after tree.)
- 2015-03-22 23:35:47下载
- 积分：1
-
watrmak
source code for watermark
- 2010-03-09 21:38:48下载
- 积分：1
