-
Finite_Difference_Beam_Propagation_Method
采用有限差分方法模拟计算高斯光束在自由空间传播过程。(Simulation using the finite difference method of Gaussian beams in free space propagation.)
- 2010-11-03 11:45:07下载
- 积分：1
-
MSKGMSK
导师传给我的关于MSK和GMSK的一些相关MATLAB仿真源码，希望对大家有用(Simulation program to realize GMSK transmission system)
- 2010-06-04 19:51:43下载
- 积分：1
-
mtetris
matlab编写的俄罗斯方块，很简单，但很好玩(matlab prepared by the Russian box, very simple, but very fun)
- 2007-11-23 16:39:13下载
- 积分：1
-
stc_matlab_codes
空时编码的matlab仿真程序，其中包括almouti，空时分组码仿真，空时格行码的设计仿真，不同信噪比下的比较，码长天线数的比较(the simulations of space-time coding are include in this rar file, adhered with the almouti scheme, space-time block cade sheme and space-time trill code sheme. )
- 2013-09-25 15:15:37下载
- 积分：1
-
yinpinchuli
对于一段有杂音的音频信号，用过多种方式去除，建立多种经典滤波器，并比较优劣。(For a period of noise audio signal, used a variety of ways to remove the establishment of a variety of classic filter, and compare the pros and cons.
)
- 2012-03-27 10:37:07下载
- 积分：1
-
QPSK
An all-optical regeneration scheme for DQPSK and QPSK signals using phase-sensitive amplifiers (PSAs) is studied and its effectiveness
is investigated through numerical simulations. By leveraging the ability of PSAs to provide phase and amplitude regenerative amplification,
we show significant simultaneous suppression of both phase and amplitude noises of (D)QPSK signals under optimized
conditions. The reduction in the phase noise variance of a noise-corrupted DQPSK signal obtained by one such regenerative amplification
can be as large as 5.5 folds, showing its good potential for distributed optical regeneration of (D)QPSK signals.
2008 Elsevier B.V. All rights reserved.
- 2015-03-23 12:52:39下载
- 积分：1
-
实验一 最大最小距离算法
MAX DISTANCE AND MIN DISTANCE OF CLUSTERING
- 2018-08-08 14:30:53下载
- 积分：1
-
gaotong
用双线性法设计巴特沃斯高通数字滤波器 基于汉宁窗的FIR数字高通滤波器设计(Method with bilinear Butterworth high-pass digital filter design based on Hanning window of FIR digital high-pass filter design)
- 2010-07-04 19:21:12下载
- 积分：1
-
kmedioids
[inds,cidx] = kmedioids(D,k)
Performs k-mediods clustering only requires a distance matrix D and
number of clusters k. Finds cluster assignments "inds" to minimize the
following cost function:
- 2011-12-22 19:41:56下载
- 积分：1
-
Monte
FBDF RF YR YRYYR YRY YYRY RSTYM
- 2012-01-20 22:43:13下载
- 积分：1
