-
schmsv6
fundamentals of digital modulations
- 2010-07-04 02:44:32下载
- 积分：1
-
viterbi
维特比译码的Matlab程序，摘自短波无线电台项目(Viterbi decoding of the Matlab program)
- 2010-09-15 16:26:54下载
- 积分：1
-
178rengongmianyisuanfa
78rengongmianyisuanfa
- 2008-06-02 22:29:54下载
- 积分：1
-
MATLAB_1
说明： 本書完整的說明與充分的網路支援，可以使讀者能充分地掌握MATLAB的脈動，擁有解決工程問題的最佳利器,1-10章(A complete description of the book and the full network support, will enable readers to fully grasp the pulse of MATLAB, has to solve engineering problems in the best weapon, 1-10 Chapter)
- 2008-08-26 20:57:08下载
- 积分：1
-
matlabcontrol
几个控制理论的小程序，可以方便学习自动控制理论这门课(Can easily end the camera to the image transmitted matlab program for the software called.)
- 2010-05-06 01:30:41下载
- 积分：1
-
dvrthreelevel
which gives the DC-DC boost converter explanation
- 2015-03-24 22:47:28下载
- 积分：1
-
kcsj_liwen
现代信号处理 一个序列为 ，使用FFT分析其频谱：
1） 使用不同宽度的矩形窗截短该序列为M点长度，取M分别为： a) M=20 b) M=40 c)M=160 ；观察不同长度的窗对谱分析结果的影响；
2）使用汉宁窗、哈明窗重做1）
3）对三种窗的结果进行理论分析及比较。并绘出相应的幅频特性曲线
(Modern signal processing a sequence, using FFT analysis of the spectrum: 1) the width of the rectangular windows with different truncated point of the sequence length of M, take M, respectively: a) M = 20 b) M = 40 c) M = 160 observation windows of different lengths affect the results of spectral analysis 2) Hanning window, Hamming window redo 1) 3) the results of three windows and compare the theoretical analysis. And draw the corresponding amplitude-frequency characteristic curve)
- 2011-10-20 20:41:33下载
- 积分：1
-
array-antenna-of-MATLAB
天线的方向性实现，请大家指导指导，共同探讨antenna(array antenna of matlab)
- 2015-01-04 20:04:52下载
- 积分：1
-
VC+Matlab
这是关于MATLAB与VC
实现卫星照片三维显示(This is on the MATLAB and VC realize satellite photos of three-dimensional display)
- 2008-04-09 17:02:31下载
- 积分：1
-
Question1
说明： C++源代码，递归实现。原问题描述：鼓上蚤时迁到一个山洞里去盗宝，里面有n件宝贝，价值分别是a1,a2......an，并且满足ai大于a1+a2+....+a(i-1)的和。他身上有一个背包，能装的东西最大价值是K，他只能进洞一次，请问他最多能带出多少？
要求：输入K，n，a1，a2......an
输出：他能最多带出的宝物价值
(C++ Source code Recursive achieve. The original problem description: drum when flea盗宝going to move in a cave, there are n pieces of treasure, valued are a1, a2 ...... an, and to meet ai than a1+ A22B !....+ a (i-1) and. Him to have a backpack, things can hold the greatest value is K, he could only hole once, to ask him to bring out the maximum number of? Requirements: Enter K, n, a1, a2 ...... an output: he can bring out the maximum value of the treasures)
- 2008-12-02 21:07:25下载
- 积分：1
