登录
首页 » matlab » OFDM

OFDM

于 2010-04-25 发布 文件大小:22KB
0 185
下载积分: 1 下载次数: 1

代码说明:

说明:  使用matlab对ofdm系统进行仿真和误比特率的分析(Ofdm systems using matlab on simulation and analysis of bit error rate)

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

发表评论

0 个回复

  • folderFilessam
    Object MatLab implementation of the Robust Non-Linear Smoother (RNLS) for state-space models
    2013-08-18 03:36:55下载
    积分:1
  • multicoil
    石油管道环境下超长波发射器的电磁场建模,用于描述管道环境,包含边界条件。(Oil pipeline under long wave electromagnetic field transmitter model, used to describe the pipeline environment, including boundary conditions.)
    2010-06-17 21:07:58下载
    积分:1
  • MATLAB6.0_math_toolbox
    MATLAB数学工具箱,包含了MATLAB在工程数学应用中的函数及其用法(MATLAB Math Toolbox, MATLAB includes mathematical applications in engineering functions and their usage)
    2007-09-03 14:49:49下载
    积分:1
  • bearingdraw
    应用matlab绘制一个轴承运行的动画,可以设置轴承内外圈尺寸(draw a movie of bearing running)
    2013-10-15 18:13:56下载
    积分:1
  • shiyuzhuanpinyu
    这是一个滤波器,用来将时域信号转换位频域进行分析滤波后,再转为时域信号的小程序(This is a filter for converting the digital time domain signal analysis of the frequency domain filtering, a time domain signal of the small sub-program)
    2013-11-17 21:05:57下载
    积分:1
  • uniform-circular
    均匀圆阵部分阵元失效情况下的DOA估计方法(Part of uniform circular array element failure in case of DOA Estimation)
    2013-12-26 12:47:54下载
    积分:1
  • ARMA
    ARMA时间序列模型预测风电场风功率大小,matlab源代码特例分析(ARMA time series models to predict the size of wind farm wind power, matlab source code for exception analysi)
    2021-04-28 22:58:44下载
    积分:1
  • JnS_Jean-Francois_Cardoso
    由Jean-Francois Cardoso 提供的两个批处理的基于累积量的ica算法: JADE and SHIBBS (Jean-Francois Cardoso provided by the two batch algorithm based on the cumulative amount of ica: JADE and SHIBBS)
    2020-07-13 15:48:55下载
    积分:1
  • fre_domain
    本程序完成带噪声的功率谱分析,通过两次的功率谱分析得到信号的频谱。(This process is completed with a noise power spectrum analysis, power spectrum analysis by two get the signal spectrum.)
    2011-01-04 21:08:35下载
    积分:1
  • dijikstra
    For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).
    2012-04-12 21:01:48下载
    积分:1
  • 696516资源总数
  • 106409会员总数
  • 8今日下载