-
Probabilityoferror
Probability of error with BPSK
- 2010-07-21 22:33:08下载
- 积分：1
-
ZCR
autocov computes the autocovariance between two column vectors X and Y with same length N using the Fast Fourier Transform algorithm from 0 to N-2.
The resulting autocovariance column vector acv is given by the formula:
acv(p,1) = 1/(N-p) * sum_{i=1}^{N}(X_{i} - X_bar) * (Y_{i+p} - Y_bar)
where X_bar and Y_bar are the mean estimates:
X_bar = 1/N * sum_{i=1}^{N} X_{i} Y_bar = 1/N * sum_{i=1}^{N} Y_{i}
It satisfies the following identities:
1. variance consistency: if acv = autocov(X,X), then acv(1,1) = var(X)
2. covariance consistence: if acv = autocov(X,Y), then acv(1,1) = cov(X,Y)
- 2013-05-26 22:12:50下载
- 积分：1
-
ivabss
Lee Teawon s independent vector analysis matlab program for blind source seperation.
- 2010-11-04 19:26:07下载
- 积分：1
-
frft
有关分数阶离散傅里叶变换的程序以及文章，文章详细介绍了离散傅里叶变换，有助于读者的学习(Fractional Fourier transform on the procedures and articles, the article introduces the discrete Fourier transform, to help readers learn)
- 2020-12-23 19:39:06下载
- 积分：1
-
deflection-curve
简支梁受均布荷载为常数。试用MATLAB编程，
1） 求剪力方程并绘出剪力图 ；
2） 求弯矩方程并绘出弯矩图 ；
3） 求转角方程并绘出转角图 ；
4） 求挠度方程并绘出挠度图 ；
(The Charpy by uniformly distributed load is constant. Trial MATLAB programming, 1) and shear equation and draw the shear diagram 2) Find the moment equation and draw the bending moment diagram 3) Find the angular equation and draw the corner Figure 4) Find the deflection equation and draw the deflection diagram )
- 2013-05-17 05:45:38下载
- 积分：1
-
awgn
说明： awgn的各种实现函数，以及每个函数实现的各种功能(awgn)
- 2010-04-16 11:58:32下载
- 积分：1
-
brent
Finds a root of f(x) = 0 by combining quadratic
interpolation with bisection (Brent s method).
- 2011-07-13 16:47:50下载
- 积分：1
-
数据集
本文件为常见聚类算法测试数据集 ，UCI上常用的聚类算法数据集(This document is a common clustering algorithm test data set.)
- 2021-04-25 21:38:46下载
- 积分：1
-
Desktop
说明： 最大流问题，一种组合最优化问题，就是要讨论如何充分利用装置的能力，使得运输的流量最大，以取得最好的效果。求最大流的标号算法最早由福特和福克逊于1956年提出，20世纪50年代福特、福克逊建立的“网络流理论”，是网络应用的重要组成成分。(Maximum flow problem, a combinatorial optimization problem, is to discuss how to make full use of the capacity of the device to maximize the flow of transport in order to achieve the best results. The labeling algorithm for maximum flow was first proposed by Ford and Fulkerson in 1956. The network flow theory established by Ford and Fulkerson in 1950s is an important component of network application.)
- 2019-06-28 10:29:03下载
- 积分：1
-
pid-b
tuning of pid parameter with fuzzy-method 2
- 2012-04-24 15:46:48下载
- 积分：1
