-
75448192saperate3
说明: 进行等时延分段,并对等间隔段的两个时延矩阵分别求取均值,采用类似联合近似对角化,估计出最优化的酉矩阵,(ing second-order statistics (different time-delay correlation matrix) of non-stationary and structural characteristics of the signal timing can roughly estimate that the instantaneous linear mixture of blind source signal. With the time delay increasing, only using a single delay covariance equalization and ignoring the time-varying characteristics of the signal, which difficult to ensure the performance of algorithm. Analysis of the average characteristics of ma)
- 2010-04-07 21:38:55下载
- 积分:1
-
OFDM-QPSK-Modulation
对于OFDM初学者很有帮助,是很好的学习程序哦,可以学会用matlab仿真(the study of )
- 2011-05-05 20:46:02下载
- 积分:1
-
panyue2
基于matlab的激光课程设计,例子,福克斯里迭代法对矩形腔激光器,圆形镜面激光器等的仿真。(laser design)
- 2012-03-21 17:05:09下载
- 积分:1
-
ga_lm_bp
4-9-1的结构ga-lm的bp算法 有示例数值 不是拟合而是预测(4-9-1 structure of ga-lm bp algorithm is not fit but there are examples of numerical prediction)
- 2013-12-23 21:25:22下载
- 积分:1
-
BPSK
C编写的BPSK调制解调,很有用,值得学习,代码编写很规范(Written in C BPSK modulation and demodulation, very useful, it is worth learning, very standardized coding)
- 2014-08-08 14:40:41下载
- 积分:1
-
VBMatlab
基于VB与Matlab的谷物霉变识别系统的开发,希望对研究的朋友提供帮助。(VB and Matlab-based identification system for cereal mildew development, want to study a friend to help.)
- 2009-10-20 12:00:50下载
- 积分:1
-
hipr
使用push-relabel方法求解最大流问题,是国外的一个研究机构编写的,速度很快。(This is an efficient implementation of the push-relabel method.
See
Goldberg and Tarjan, "A New Approach to the Maximum Flow Problem,"
J. ACM Vol. 35, 921--940, 1988
and
Cherkassky and Goldberg, "On Implementing Push-Relabel Method for the
Maximum Flow Problem," Proc. IPCO-4, 157--171, 1995.)
- 2009-11-23 11:00:19下载
- 积分:1
-
MixFigure
很有用的关于VC和matlab混合编程的例子,值得大家学习(Very useful on the VC and matlab examples of hybrid programming, what is worth learning)
- 2007-11-23 11:19:29下载
- 积分:1
-
beiyisi
时间序列的贝叶斯突变检测算法MATLAB源码.rar
- 2010-08-20 22:03:48下载
- 积分:1
-
beibaowenti
有N件物品和一个容量为V的背包。第i件物品的费用是c,价值是w。求解将哪些物品装入背包可使这些物品的费用总和不超过背包容量,且价值总和最大。(There are N items and a knapsack capacity of V' s. No. i is the cost of items c, the value of w. Solving items into the backpack which will enable the cost of these items does not exceed the sum of the capacity of backpack, and the sum of the maximum value.)
- 2009-05-07 22:10:10下载
- 积分:1