登录
首页 » Matlab » matlab信道仿真模型

matlab信道仿真模型

于 2022-05-12 发布 文件大小:303.23 kB
0 19
下载积分: 2 下载次数: 1

代码说明:

channel simulation model for matlab

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

发表评论

0 个回复

  • Simulink
    压缩文件中是simulink的教程文件,简单介绍了matlab的simulink仿真用法(Compressed file is simulink tutorial files, a brief introduction of the use of matlab simulation in simulink)
    2010-02-27 11:27:24下载
    积分:1
  • WatermarkingVedio3
    视频水印matlab源码,此为第三个压缩包,在水印领域的爱好者可以下载作为参考(Video Watermarking Matlab source, which is the third-compressed, Watermark in the field of lovers can download as a reference)
    2006-10-13 17:34:33下载
    积分:1
  • wavemarksvd
    本函数将完成W—svd模型下数字水印的嵌入,即经典的W-SVD数字水印算法(This function will finish W- SVD model under the embedded watermark, namely classic W- SVD watermarking algorithm is proposed)
    2011-05-30 19:06:01下载
    积分:1
  • public_code_ST
    结构张量来进行自适应正则化图像重建,单幅图像重建(Structure tensor adaptive regularized image reconstruction, a single image reconstruction)
    2016-11-29 12:09:57下载
    积分:1
  • SCUC
    unit commitment solver
    2016-12-28 20:28:05下载
    积分:1
  • Matlab06
    摘要:计算机动态仿真是混沌应用研究的重要方法"该文介绍了环境下的可视化建模与动态仿真步骤(Abstract: The computer simulation is a chaotic dynamic applied research an important means of )
    2008-05-16 10:47:53下载
    积分:1
  • OFDM
    ofdm系统仿真用QAM调制的,有信号传输后的频谱图(ofdm simulation using QAM modulation)
    2010-05-24 10:15:36下载
    积分:1
  • grey-theory
    根据灰色预测理论,用程序实现预测,效果较好(According to the gray prediction theory, use the program predicts better)
    2014-08-11 22:20:09下载
    积分:1
  • NRLF
    this code is a generalized form of newton raphson method for finding the power flow in an interconnected system. it is by default designed for 3 bus system bus system it can also be changed for other type of system.
    2013-03-18 02:32:38下载
    积分:1
  • tsp
    说明:  TSP问题指的是从一个节点开始遍历其他所有节点并回到初始节点,构成一个哈密顿回路,节点与节点之间距离不同,目标是找到一条回路使得总路程最短,也即就是走最短的路遍历所有节点回到起点。(TSP problem refers to traversing all other nodes from one node and returning to the initial node to form a Hamiltonian loop. The distance between nodes is different. The goal is to find a loop to make the total distance shortest, that is to say, traversing all nodes back to the starting point in the shortest way.)
    2019-05-29 15:00:32下载
    积分:1
  • 696519资源总数
  • 104213会员总数
  • 32今日下载