登录
首页 » matlab » nrz

nrz

于 2013-03-07 发布 文件大小:86KB
0 269
下载积分: 1 下载次数: 1

代码说明:

  generate nrz code of given binary data

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

发表评论

0 个回复

  • recfil2
    waveguide filter mode matching
    2013-04-12 17:20:50下载
    积分:1
  • c80_SNR
    this program estimate cumulant order (8,0) for mqam modulation classification and plot them
    2013-12-26 21:18:07下载
    积分:1
  • final
    simulink model for optical cdma system which uses orthogonal code.
    2009-04-24 00:52:42下载
    积分:1
  • xiangguan
    matlab中的相关算法已通过验证,以及声音谱的对比(matlab related algorithms have been validated, as well as the voice of spectral contrast)
    2008-07-02 21:58:30下载
    积分:1
  • matlabpgram
    matlab 追赶法解33.c(catch up with the method of Matlab 33.cppddddddddddddddddddd )
    2006-09-14 20:05:36下载
    积分:1
  • emd
    matlab上的EMD源程序,无需任何调试,可以直接运行,方便好用!(EMD on matlab source, without any debugging, you can run directly, easy to use!)
    2015-04-15 16:59:12下载
    积分:1
  • 5
    说明:  DC MOTOR SPEED CONTROL 4
    2010-10-14 01:14:27下载
    积分:1
  • OFDM_channel_estimation
    matlab中不同信道估计的对比,对学习通信专业的学生很有帮助,主要介绍的是MIMO-OFDM系统下的信道估计。(matlab in the comparison of different channel estimation)
    2010-12-03 13:12:58下载
    积分:1
  • CG
    说明:  求解系数矩阵由16阶Hilbert方程组构成的线性方程组, 3、共轭梯度法;(Solving the linear equations consisting of 16-order Hilbert equations of coefficient matrix. 3. Conjugate gradient method;)
    2019-04-11 23:40:38下载
    积分:1
  • Dijkstra
    说明:  最短路径的Dijkstra算法程序。Dijkstra算法是典型最短路算法,用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展,直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解,但由于它遍历计算的节点很多,所以效率低。   Dijkstra算法是很有代表性的最短路算法,在很多专业课程中都作为基本内容有详细的介绍,如数据结构,图论,运筹学等等。 (The Dijkstra shortest path algorithm for the procedure. Dijkstra algorithm is a typical shortest path algorithm, used to calculate a node to all other nodes of the shortest path. The main characteristics is the starting point as the center outward expansion layers, until the end date be extended to. Dijkstra shortest path algorithm can arrive at the optimal solution, but because of its calculation of the node traversal, so inefficient. Dijkstra algorithm is very representative of the shortest path algorithm, in many professional courses in the basic content as described in detail, such as data structures, graph theory, operational research and so on.)
    2008-11-26 22:27:45下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载