登录
首页 » matlab » Rician_model_fz_1

Rician_model_fz_1

于 2014-10-19 发布 文件大小:1KB
0 126
下载积分: 1 下载次数: 26

代码说明:

  有关移动通信中莱斯(Rician)信道衰减的仿真,对信道的理解有一定的帮助(About mobile communications (Rician) Rice fading channel simulation, the channel has some help understanding)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • sxspwm0506
    三相SPWM逆变器仿真分析,可以出正确波形(Three-phase SPWM inverter simulation analysis, the correct waveform)
    2013-07-17 19:09:31下载
    积分:1
  • contoh
    this is exemple simple modulation psk and bpsk
    2015-04-19 09:23:35下载
    积分:1
  • bpMATLABstock
    本程序采用MATLAB实现神经网络对股票预测的功能,带有实验数据以及输出结果(The program uses MATLAB neural network stock prediction to achieve the function, with experimental data and output results)
    2010-09-19 16:46:52下载
    积分:1
  • try2
    costas 环的simulik建模与仿真(costas Central simulik Modeling and Simulation)
    2007-05-02 11:30:04下载
    积分:1
  • fcest_bfsk
    该工程实现2fsk的载频估计,返回2fsk两个载频估计结果。(The project is estimated to achieve 2fsk carrier frequency, return 2fsk two carrier frequency estimation results.)
    2013-12-25 19:07:04下载
    积分:1
  • MATLAB simulation of the Brown movement
    布朗运动的MATLAB模拟,动态图形的一个简单学习例程。txt文件,粘贴到matlab中就可以运行。(The MATLAB simulation of the Brown movement, a simple learning routine for dynamic graphics. Txt files, paste into the Matlab can run.)
    2018-02-09 23:12:31下载
    积分:1
  • matlabAndFiniteElementMethod
    matlab与有限元算法书的程序,我改编过其中的算法,可以用其中“hang架算例文件”中我编的例子算,都正确,我算过了(Matlab finite element method and the procedures, which I adapted over the algorithm, which can "hang-count cases document" I count series of examples are correct, I counted the)
    2006-06-22 17:37:19下载
    积分:1
  • pcnn_basix
    基本PCNN演算法,處理圖像的基本類神經網路。(Basic PCNN algorithm, the basic image processing and neural networks.)
    2010-05-25 16:04:26下载
    积分:1
  • soundexample
    Realtime sound acquisiton and processing using matlab
    2010-08-31 19:22:26下载
    积分:1
  • cebk_tsp
    用离散数学或图论的术语来说,假设有一个图g=(v,e),其中v是顶点集,e是边集,设d=(dij)是由顶点i和顶点j之间的距离所组成的距离矩阵,旅行商问题就是求出一条通过所有顶点且每个顶点只通过一次的具有最短距离的回路。 (Discrete Mathematics or use the terminology of graph theory, assume that a graph g = (v, e), where v is the vertex set, e is the edge set, let d = (dij) is a vertex between i and vertex j formed from the distance matrix, a traveling salesman problem is obtained through all the vertices and each vertex only once has the shortest distance through the loop.)
    2011-05-22 08:12:37下载
    积分:1
  • 696518资源总数
  • 106148会员总数
  • 10今日下载