-
OFDM Simulation
说明: OFDM通信系统的仿真。PDF文件,包括OFDM原理、程序讲解及运行结果。(OFDM communications system simulation. PDF documents, including OFDM principles, procedures and operations on the results.)
- 2006-01-01 18:16:07下载
- 积分:1
-
slkz
说明: matlab矢量控制系统仿真图,电机数字模块,三相转两相模块(vector control system
)
- 2010-04-29 11:35:00下载
- 积分:1
-
two_way_relay
two-way-relay场景下,中继处理矩阵的设计,仿真分析了DPC-ZF及DPC-MMSE算法的性能要由于AF与ZF算法性能。(In the two-way-relay scenario,simulation show that both DPC-ZF and DPC-MMSE have a higher throughput and lower BER performance compared with the traditional AF algorithm and ZF algorithm.)
- 2020-12-06 19:09:21下载
- 积分:1
-
the-iamge-matting-with-new-ways
采用一种新的方法,对图像进行matting,并取得良好的效果(the image matting with good approach)
- 2013-10-02 21:23:32下载
- 积分:1
-
Matlab-handbook
matlab使用手册,基本教程,从零开始学matlab(matlab handbook)
- 2013-03-18 18:50:06下载
- 积分:1
-
holeofdiffraction
完整的1X1mm大小的方孔衍射程序...............................
可以运行,会有点慢(Complete 1 x1mm square hole the size of the diffraction process)
- 2013-09-12 13:35:00下载
- 积分:1
-
分支定界法
说明: 分支定界法(branch and bound)是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划,还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法,选择不同的分支变量和子问题进行分支。
对于两个变量的整数规划问题,使用网格的方法有时更为简单。 [1]
通常,把全部可行解空间反复地分割为越来越小的子集,称为分支;并且对每个子集内的解集计算一个目标下界(对于最小值问题),这称为定界。在每次分枝后,凡是界限超出已知可行解集目标值的那些子集不再进一步分枝,这样,许多子集可不予考虑,这称剪枝。这就是分枝定界法的主要思路。(Branch and bound method is one of the most commonly used algorithms to solve integer programming problems. This method can solve not only pure integer programming but also mixed integer programming. Branch and bound algorithm is a method of search and iteration, which selects branches with different branch variables and sub problems.
For integer programming problems with two variables, the grid method is sometimes simpler[ 1]
Generally, all feasible solution spaces are divided into smaller and smaller subsets repeatedly, which is called bifurcation; And a lower bound of the objective (for the minimum value problem) is calculated for the solution set in each subset, which is called the bound. After each branch, those subsets whose bounds exceed the objective value of the known feasible solution set will not be further branched, so many subsets can not be considered, which is called pruning. This is the main idea of branch and bound method.)
- 2021-04-26 12:21:14下载
- 积分:1
-
C_C
用c-c方法求相空间重构,计算关联积分时间延迟的程序设计(With the cc method, to calculate phase-space reconstruction to calculate the time delay associated with integration of program design)
- 2009-11-13 16:38:19下载
- 积分:1
-
hopfield
this is a matlab implementation for hopfield network
- 2010-11-24 04:11:34下载
- 积分:1
-
super-MATLAB
很实用的教程,和大家一起分享,内含多所高校数学建模培训内容(Very useful tutorial to share with everyone, many colleges and universities included mathematical modeling training)
- 2011-09-10 04:03:19下载
- 积分:1