-
RZ-DPSK
光通信中归零型（占空比可调）差分相位调制信号建模与仿真分析(Optical Communication zero type (duty cycle adjustable) differential phase modulation signal modeling and simulation analysis)
- 2008-12-24 10:11:00下载
- 积分：1
-
Harris1
我在网上下载的，感觉不错，给大家推荐一下，希望能有所帮助(very good)
- 2010-05-07 16:17:39下载
- 积分：1
-
PBGBand2
用来计算光子晶体带结构，使用matlab开发。(Used to calculate the photonic band structure, the use of matlab development.)
- 2011-10-27 14:06:02下载
- 积分：1
-
saPSO
退火粒子群优化算法（SAPSO），matlab代码，仅供学习(Annealing particle swarm optimization (SAPSO), matlab code, only to learn)
- 2021-04-23 21:58:47下载
- 积分：1
-
ranliaodianchi
matlab中详细的燃料电池模型，适用于各种用到燃料电池的场合(Matlab detailed fuel cell model, suitable for all kinds of fuel cell applications)
- 2015-09-18 13:16:35下载
- 积分：1
-
beam_weight1122
各种加权下的波束图，包括 Uniform , Cosine , Hamming , Blackman 四种加权窗的波束形成算法(Under various weighted beam pattern, including the ' Uniform' , ' Cosine' , ' Hamming' , ' Blackman' four kinds weighted window Beamforming Algorithm)
- 2013-12-05 19:49:25下载
- 积分：1
-
OFDM(gms)
有关OFDM信号检测与估计的一篇文章，是IEEE上的，有需要的下！！(The OFDM signal detection and estimation of an article is on the IEEE there is a need for the next! !)
- 2009-09-07 09:19:55下载
- 积分：1
-
Vblast
The source code is a simulation of VERTICAL-BELL LABORATORIES LAYERED SPACE TIME
(V-BLAST) with QAM (Quadrature Amplitude Modulation)
- 2010-06-20 22:34:18下载
- 积分：1
-
digital-code-simulation
为数字仿真处理软件，包括BASK，BPSK和BFSK，包括coherent和non-coherent两种方式(Processing software for digital simulation, including the BASK, BPSK and BFSK, including coherent and non-coherent two ways to)
- 2010-01-24 23:00:43下载
- 积分：1
-
Matlab_zuixiaofeiyong
最小费用最大流算法通用Matlab函数
基于Floyd最短路算法的Ford和Fulkerson迭加算法 基本思路：把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条 自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流 量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新 确定,如此多次迭代,最终得到最小费用最大流.(Minimum cost maximum flow algorithm general Matlab functions The basic idea of the shortest path algorithm of Ford and Fulkerson superposition algorithm based on Floyd: the cost of unit flow on the arc as a certain length of Floyd and the shortest path method to determine the one percent self-V1 to the Vn the most short-circuit and then the this Article is the most short-circuit as a can be the expansion Lu, to use solving the method of the the the problem of the maximum flow will its on the stream the amount of increased to the maximum possible values while the the the the flow of of this Article of the shortest on the road increase, the costs of the unit of flow on each arc sure, so many iterations, the final minimum cost maximum flow.)
- 2012-07-27 14:55:22下载
- 积分：1
