-
repliement
Program of signal processing
- 2013-09-17 02:35:37下载
- 积分：1
-
matlabyingao
matalab的线性语音编码的相关程序，很好的，可以用的(matalab linear speech coding procedures, very good, can be used)
- 2010-08-30 22:35:23下载
- 积分：1
-
leverset
水平分割相关文档 可实现定位边缘检测等功能(lever-set)
- 2009-07-10 21:57:53下载
- 积分：1
-
Rosenbrockfunc
rosenbroc function. extract and check for correctness
- 2014-09-09 21:49:22下载
- 积分：1
-
MatlabDIPinBrief
about matlab image processing toolbox
- 2009-12-08 23:46:30下载
- 积分：1
-
dcv
关于盲辨识方面，讨论关于盲辨识方法所能起到的效果，很好的例子(On blind identification, the discussion of blind identification method that can be played on the effect of good example)
- 2010-12-28 11:09:53下载
- 积分：1
-
Untitled1
基于FFT谱连续细化算法的高精度频率估计，这种算法可以精确到小数点后两位，这种算法与MUSIC法和ESPRIT法相比，计算量大大降低，而且精度非常高。(This procedure is based on the FFT spectrum continual refinement algorithm s high accuracy frequency， this algorithm may precisely to decimal point latter two, compared the MUSIC algorithm and the ESPRIT algorithm, the computation complexity reduces greatly, moreover the precision is high.)
- 2010-11-25 11:20:42下载
- 积分：1
-
zero-watermarking-based-on-wavelet
对水印图像进行置乱，然后嵌入到载体图像小波域中的细节子带中(the watermark image is Scrambled, and then embedded into the details of wavelet sub-band domain)
- 2011-05-26 21:18:52下载
- 积分：1
-
FIR
1、系统仅处于训练状态。训练序列为2cos(2π×f1×n/fs)，
干扰为sin(2π×f2×n/fs)；序列长度为100个样点。
其中n=0…99，f1=1kHz，f2=2kHz，fs=8kHz。
2、采用LMS算法，均衡器输入为训练序列加上干扰，均衡器阶数为21阶，步长因子β=0.01。
3、在Matlab中编写浮点LMS算法，绘制均衡器的输出波形，并与训练序列进行对比。
(1, the system only in the training status. The training sequence is 2cos (2πf1n/fs), interference sin (2πf2n/fs) sequence length of 100 samples. Where n = 0 ... 99, f1 = 1kHz, f2 = 2kHz, fs = 8kHz. 2, using LMS algorithm, the input to the equalizer training sequence plus interference equalizer order is 21 bands, step factor β = 0.01. 3, the preparation of the floating-point LMS algorithm in Matlab, draw the output waveform equalizer, and with the training sequence comparison.)
- 2013-12-05 14:53:23下载
- 积分：1
-
danchunxingfa
用单纯形法解线性规划 根据单纯形法的原理，在线性规划问题中，决策变量（控制变量）x1，x2，…x n的值称为一个解,满足所有的约束条件的解称为可行解。使目标函数达到最大值（或最小值）的可行解称为最优解。这样，一个最优解能在整个由约束条件所确定的可行区域内使目标函数达到最大值（或最小值）。求解线性规划问题的目的就是要找出最优解。 (According to the principle of the simplex method, in linear programming problem, the decision variables (control variable) x1, x2,... X n value is called a solution, meet all of the constraint conditions of the solution of the called feasible solution. The objective function to achieve maximum (or minimum) feasible solution of the optimal solution is called. So, an optimal solution by constraint conditions throughout the feasible region determined the objective function to achieve maximum or minimum value). To solve the linear programming problem is to find out the purpose of the optimal solution.
)
- 2011-12-19 15:39:08下载
- 积分：1
