搜索资源列表
lmi
- D-S.Kim, Y.S.Lee, W.H.Kwon, and H.S.Park, \"Maximum Allowable Delay Bounds in Networked Control Systems\", Control Engineering Practice (Elsvier Science) (Simulation Example - Matlab Code), PP.1301-1313, Vol.11, Issue 11, December, 2003
Morse_W.rar
- 莫尔斯电报代码的mp3声音练习文件W.MP3,Morse telegraph code practice mp3 sound file W.MP3
2
- 分布式异步传感器无源定位中，使用窗口函数为w，定位估计的CRLB-Distributed asynchronous passive location sensor, use the window function for w, targeting the estimated CRLB
W-CDMA_and_cdma2000_for_3G_Mobile_Networks
- W-CDMA and cdma2000 for 3G Mobile Networks M.R. Karim and M. Sarraf McGraw-Hill New York Chicago San Francisco Lisbon London Madrid Mexico City Milan New Delhi San Juan Seoul Singapore Sydney Toronto
3GPP
- 主要说明了3G网络W/TD制式协议内容，具有导读的作用，方便找到相关内容-Mainly to explain the 3G network W/TD standard agreement, with the role of a navigable, easy to find relevant content
w-CDMa-3G-network
- The goal of this paper is to comprehensively review the handover policies in wideband code division multiple access (WCDMA) system. Mobile cellular communication becomes more and more important in today’s communication. In a cellular network, the r
buffer-only
- We use simulation results to show the performance of the water filling algorithm. Simplify this question into a OFDM based communication network with one transmitter and one receiver. It is assumed that the total power of Pmax = 1 w and the total ban
PdfEstimation
- 已知观测数据为A+W(n)，其中A为直流信号，W为复高斯噪声，服从CN（0， ），在统计N次下，计算X的统计平均值 ，求T(x)= 的pdf：p(T(x)|H0)、p(T(x)|H1)。 H0： W H1： A+W -Known observation data A+W (n), where A is the DC signal, W is the complex Gaussian noise, subject CN (0,), N times in the statistics,
zhao_srsk_honig
- users and link gains generation FIXED POWER FOR EACH SU LINK NO POWER CONTROL FOR SUs WITH ON OFF activity for PUs and SUs d_00=start of franhaufer zone d_0=radius of cell, d_su=radius of pairwise adhoc N/W - users and link gains genera
GenerateUG
- 根据点之间的Manhattan Length把方格图转换成无向带权图UG，并获得各边的权值矩阵W-According to the point of the Length Manhattan between the square map into a non- weighted graph UG, and access to the edge of the weight matrix W