-
rcosdomo
说明： 采用窗函数法设计一个可实现的数字FIR升余弦脉冲成形滤波器xtuanna(Use of window functions can be implemented to design a digital FIR raised cosine pulse shaping filter .xtuanna)
- 2010-04-22 10:56:17下载
- 积分：1
-
Untitled
生成白噪声信号：生成白噪声信号,生成白噪声信号(Generating a white noise signal)
- 2012-11-08 10:22:52下载
- 积分：1
-
bpNN
liangge xin hao 特征提取后用bp神经网络进行识别(BP feture extract)
- 2016-04-24 10:26:51下载
- 积分：1
-
TrabalhoRodrigo
This code show and explain (in portuguese) a simple Block Code to BSC channel.
- 2014-10-01 22:05:08下载
- 积分：1
-
ch5example14prg1
彩色全电视信号产生，原理实验，适合初学者，是彩色电视原理电路的一部分(Gray signal generation, theory test, suitable for beginners)
- 2010-06-12 04:50:50下载
- 积分：1
-
matlab自相关
此源文件包含了MATLAB两种自相关函数，并将其用于数字信号的处理，比较两种函数的不同(This source file contains two autocorrelation functions of MATLAB and is used for digital signal processing, comparing the two functions.)
- 2018-08-08 11:17:34下载
- 积分：1
-
1DCNN
说明： 在心电公开数据集MITBI中，基于心拍的心律失常疾病CNN智能分类心拍(In the open ECG data set mitbi, CNN intelligent classification of arrhythmia based on heart beat)
- 2020-05-10 08:34:38下载
- 积分：1
-
hashingToolbox0_1beta
图像认证中的Image Hashing技术，源码最新下载自美国名校The University of Texas at Austin的Brian L. Evans教授的实验室网站
(Matlab programs for image hashing downloaded from Professor Brian L. Evans in University of Texas at Austin in USA)
- 2010-11-02 16:49:39下载
- 积分：1
-
LFMRadar
通过对连续调频波进行数学建模进行发射波形与回波波形的仿真，从何获得目标的速度和距离(Through mathematical modeling of continuous FM wave, the simulation of waveform and echo waveform is carried out, and the speed and distance of the target are obtained.)
- 2018-01-12 16:30:05下载
- 积分：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
