登录
首页 » Visual C++ » IEEE802.15.4_opnet_simulation_model_v2.1

IEEE802.15.4_opnet_simulation_model_v2.1

于 2011-03-02 发布 文件大小:153KB
0 134
下载积分: 1 下载次数: 3

代码说明:

  zsdgsdfnhdnmg zxdvbdfngdf shbdfb

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

发表评论

0 个回复

  • Project1
    TCP 发送模块 一点小代码`````` 仅仅当做参考(TCP Send Module)
    2010-09-10 22:05:17下载
    积分:1
  • chap5
    雷达系统设计MATLAB仿真一书里的第五章所有的程序,对于学习非常有用。(Radar system design MATLAB simulation in the fifth chapter of the book, all the procedures, very useful for learning.)
    2012-09-11 01:07:54下载
    积分:1
  • synchronizeusingchirp
    关于chirp信号的频率估计和定时估计的论文,对研究chirp信号有一定的帮助(About the frequency of the chirp signal estimation and timing estimation of thesis, has the certain help to the study of chirp signal)
    2015-10-30 10:44:33下载
    积分:1
  • check_counter
    vc查看计数器值的程序源码,希望对大家有所帮助(vc view the source code program counter value, we hope to help)
    2011-06-05 23:15:12下载
    积分:1
  • BWChess
    C++开发的BWChess黑白棋游戏,界面差不多,功能挺多的,可以与电脑下棋也可以人与人对战,可以提醒,记录对战排行榜。(C++ development BWChess Reversi game, the interface is similar to the挺多function, you can play chess with the computer can also be against people can be reminded to record against the list.)
    2009-07-12 11:13:40下载
    积分:1
  • biometrics
    基于人脸和语音双通道的生物认证算法,已经通过编译,效果较好。(based on human face and voice of biological dual-channel authentication algorithms, compiler has been passed, the result is better.)
    2006-11-02 22:01:27下载
    积分:1
  • INORDER_PRE_POST_TRAVERSE
    PRE IN POST OREDER TRAVERSAL C++ CODE VISUAL
    2016-05-11 20:58:00下载
    积分:1
  • 456
    1990年—adaptive multi-band CFAR detection of an optical pattern with unknown spectral distribution.pdf
    2013-01-13 20:06:47下载
    积分:1
  • MuGuard
    MuGuard Official base source
    2015-03-14 08:48:33下载
    积分:1
  • lab
    对于初始给定的数组,通常存在多个长度大于1的已自然排好序的子数组段.例如,若数组a中元素为{4,8,3,7,1,5,6,2},则自然排好序的子数组段有{4,8},{3,7},{1,5,6},{2}.用一次对数组a的线性扫描就足以找出所有这些排好序的子数组段.然后将相邻的排好序的子数组段两两合并,构成更大的排好序的子数组段({3,4,7,8},{1,2,5,6}).继续合并相邻排好序的子数组段,直至整个数组已排好序。(For the initial given array, usually present multiple sub-array section has a length greater than a natural sorted. For example, if the array of elements for a {4,8,3,7,1,5,6,2} then naturally sorted subarray segment has {4,8}, {3,7}, {1,5,6}, {2}. used once on a linear array scanning is sufficient to identify all these rows subarray segments good sequence is then sub-arrays adjacent segments sorted pairwise merge to form larger sub-segments sorted array ({3,4,7,8}, {1, 2, 5,6}). Continue merge adjacent sorted subarray section until the entire array is sorted.)
    2014-12-21 20:08:05下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载