登录
首页 » C++ » OFDM

OFDM

于 2014-10-16 发布 文件大小:9KB
0 220
下载积分: 1 下载次数: 4

代码说明:

  OFDM的C++源代码,用于通信系统中信号的正交频分复用(The C++ OFDM source code for a communication system of an orthogonal frequency division multiplexing signal)

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

发表评论

0 个回复

  • demo_rbpf_gauss
    说明:  MIMO信道multinomal residual deterministic仿真(MIMO Channel multinomal residual deterministi c Simulation)
    2006-05-13 21:58:55下载
    积分:1
  • fuzzy-method
    详细介绍了模糊数学的基本原理,并附有详细的MATLAB程序,好用(Details the basic principles of fuzzy mathematics, along with a detailed MATLAB program, easy to use)
    2011-09-07 15:43:50下载
    积分:1
  • FTL
    is a matlab code for node interaction.....
    2013-04-06 17:08:32下载
    积分:1
  • pcm1
    MATLAB中用simulink搭建的完整的PCM通信系统模拟,可以完成PCM编码、解码的全过程(Complete PCM communication system simulation using MATLAB simulink structures can be completed PCM encoding and decoding of the entire process)
    2014-04-02 22:31:18下载
    积分:1
  • quad2dggen
    本程序是专门用来计算二重积分,可是需要工具箱的支撑(Calculation of double integrals)
    2010-09-11 09:19:57下载
    积分:1
  • genetic-to-optimize-lifetime-of-wsn
    there is a new approach Using in Wireless sensor network to Clustering, in this approach we use GA algorithm to optimize the lifetime of network.
    2012-12-31 05:40:46下载
    积分:1
  • [Book]-[MathLab]-[The-Math-Works]-[PDF]-MatLab-7-
    matlab 7 programming
    2013-11-07 10:07:58下载
    积分:1
  • webinar_walk_through
    1. Linear Model Estimation: using time and frequency domain data 2. Nonlinear Black Box Model Estimation 3. Nonlinear Grey Box Model Estimation
    2012-01-13 18:33:12下载
    积分:1
  • matlab数据做图
    说明:  主要是对数据做初级滤波和组合分析,其实就是对多路数据做了采集并组合做图(Primary filtering and combination analysis of data)
    2020-06-24 22:00:02下载
    积分: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今日下载