-
configfs_example_explicit
This file is a demonstration module containing a number of configfs subsystems.
- 2014-10-14 10:03:32下载
- 积分:1
-
ZF-MMS-BD-SLNR
迫零预编码算法 最小均方误差预编码算法 块对角化预编码算法 信号泄露噪声比预编码算法的误码率和系统容量的比较(Forced zero precoding algorithm of minimum mean square error (mse) precoding algorithm block diagonalization precoding algorithm signal leak noise than the precoding algorithm of bit error rate and system capacity)
- 2021-05-14 17:30:02下载
- 积分:1
-
对数正态pdf
说明: 关于可见光通信信道建模的有关对数正态pdf的MATLAB代码。(MATLAB code of lognormal PDF for modeling of visible light communication channel.)
- 2020-05-10 20:52:36下载
- 积分:1
-
RGB2GRAY
To convert a Color image to a gray image
- 2010-06-22 15:40:53下载
- 积分:1
-
comb
MATLAB function to calculate combination
- 2010-05-22 02:49:33下载
- 积分:1
-
sparseMRI_v0.2
Sparse MRI Sparse MRI reconstruction based compressed sensing(Sparse MRI reconstruction based compressed sensing Sparse MRI reconstruction based compressed sensing)
- 2013-10-09 18:11:56下载
- 积分:1
-
ofdm-matlab
基于matlab 的ofdm调制,主要采用bpsk的调制方式,有误码率测试(Ofdm matlab-based modulation, mainly bpsk modulation, there is a bit error rate test)
- 2015-04-19 16:52:03下载
- 积分:1
-
Multiple-Sensor
program is used to transfer data in a secure manner in wireless sensor network
- 2013-08-22 12:55:10下载
- 积分:1
-
juanji
离散卷积计算
实验步骤:
主界面下进入实验五的“离散卷积计算”子实验,
输入有限长序列 x(n)
输入有限长序列 h(n)
鼠标单击确定按钮,以数值和图形两种方式显示卷积结果 (Discrete convolution calculation of the experimental steps: the main interface into the experiment five " convolution calculation of discrete" sub-experiment, the entry of a limited length sequence x (n) input sequence of finite length h (n) the mouse button to click OK to both numerical and graphical ways shows the results of convolution)
- 2009-05-01 20:33:52下载
- 积分:1
-
01bagProblemGreedy
0/1背包问题的贪心优化解法 邓宏涛朱蜘
(江汉大学数学与计算机学院武汉430056)
摘要:介绍了0/1背包问题的基本贪心算法的解决策略,通过对贪心算法的改进和优化,找出0/1背包问题的最优解
的很好近似。(0/1 knapsack problem greedy optimization method of邓宏涛Zhu spider (Jianghan University, Mathematics and Computer Science, Wuhan 430056) Abstract: 0/1 knapsack problem of the greedy algorithm to solve the basic strategy of the greedy algorithm through the improvement and optimization, to find 0/1 knapsack problem of the optimal solution of a very good approximation.)
- 2009-05-28 17:28:47下载
- 积分:1