Accurate estimation of capacities and cross-traffic of all links in a path using ICMP timestamps

The estimation of the link capacity and its available bandwidth in an end-to-end path is crucial for network management, admission control and flow control for adaptive applications. This paper introduces an estimation mechanism able to accurately estimate the available bandwidth of all links in an end-to-end path, through its capacity and cross-traffic estimation. The estimation procedures resort to the dispersions of packet pairs and trains using the concepts of ICMP Timestamp and Traceroute that, efficiently used together, enable the measurement of the dispersions in all links in the path. These mechanisms were evaluated through simulation experiments, where we analyzed the influence of the several network parameters on each estimation mechanism. The results show that these estimation methods are able to accurately estimate both the capacity and the cross-traffic of all links in a path with moderate length and with low overhead.     

基于矢量平均的信道估计算法

提出一种适用于DS-CDMA无线通信系统的低计算量而性能良好的信道估计算法。在DS-CDMA系统中，当接收信号经过解扩或多用户检测等时域预处理后，可以认为干扰大大减弱、期望信号在处理后的信号中占主要地位。这样，用预处理后信号相关阵的最大特征值对应的特征矢量可以很好地近似期望信号的信道矢量。但是，直接特征分解需要很大的计算量，特征跟踪计算量较低，但瞬态性能较差。本文提出一种基于相关矩阵列矢量平均的信道估计算法，该算法不需要特征分解或跟踪。仿真结果表明：新算法在降低计算量的情况下可以获得同直接特征分解方法几乎相同的性能。     

Characteristic Features of the Optimal Processing of the Results of Measurements in the Case of a Random Observation Function

An analysis is made of the characteristic features and problems of the optimal processing of the results of measurements in the case of a random observation function utilizing a nonlinear Kalman filter. A method is proposed for increasing the convergence domain of the filter with additional processing of measurements in the frequency domain.     

Estimation and Optimization of the Principal H-Maser Parameters

The scale along the coordinate axes in the equations of motion hitherto used for an H-maser (in relative units) is shown to depend on Q as the quality factor for an H-maser. This hinders both analysis of the operation of the H-maser and optimization of its parameters. The modified equations of motion proposed here do not have that shortcoming. We determine the atomic flux into the bulb that gives the H-maser the best metrological characteristics.     

异步DS-CDMA系统中基于矩阵点除算法的DOA估计

针对异步DS-CDMA系统中的多用户环境,本文提出了一种低复杂度的DOA估计算法——矩阵点除算法。该算法通过对感兴趣信息的逐次分离,实现了DOA的逐路径估计。算法具有两方面显著优势:(1)克服了传统的DOA估计算法在路径总数大于天线阵元数时不能工作这一缺陷:(2)避免了计算复杂的特征值分解运算,大大降低了算法复杂度。仿真实验验证了算法的有效性。     

Non-resonant RF and microwave response: A novel technique for the characterization of superconducting materials

When examined using continuous wave electron paramagnetic resonance and nuclear magnetic resonance spectrometers, the highT _c superconductors give rise to intense, low field, ‘non-resonant’ absorption signals in the superconducting state. This phenomenon can be used as a highly sensitive, contactless technique for the detection and characterization of superconductivity even in samples containing only minute amounts of the superconducting phase. Further, it can also be applied to the determination of material parameters of interest such asJ _c andH _c2 in addition to being a powerful way of distinguishing between weak-link superconductivity and bulk superconductivity. The details of these aspects are discussed.     

基于EDGE系统信道估计实现方案的研究

研究了基于ＥＤＧＥ系统接收机中信道估计的实现方案，并对算法的各项性能做出评估。首先论述了算法的采用及其理论依据。接着，说明了信道预估计的原理及方法。最后，针对ＭＡＴ－ＬＡＢ及 ＤＳＰ上的仿真结果，比较了各项系数对于系统性能改善所具有的影响和作用，对系统特性作了较为详细的分析总结。     

相干源二维波达方向估计

本文分析了平面阵接收信号的协方差矩阵，发现它可分解为一个广义对称矩阵与一个非广义对称矩阵之和，利用信号协方差矩阵的这一结构特征，重点研究了相干源二维波达方向（DOA）估计．该方法通过构造一个差矩阵，求出其本特征值对应的任一特征向量，利用谱函数估计相干源二维DOA．简要分析了二维DOA估计的分维处理。     

心电地图仪中工频干扰的一种滤除方法

在心电地图仪中记录到的体表心电信号往往由于电磁的影响而引进工频干扰．基于体表心电信号中工频干扰的特点，作者提出了一种滤除工频干扰的方法，即就单独—胸导联信号通过提高频谱的分辨率来估计工频干扰的频率；基于最小均方误差准则来估计各导联信号中工频干扰的幅度和相位。文中还给出了该算法的流程图和滤波性能分析。模拟结果表明了该算法的有效性。应用该算法对心电地图仪中的工频干扰进行对消，取得了满意的结果。     

存在噪声和未建模动态系统传递函数的渐近无偏估计

存在未建模动态时，如何去除系统传递函数估计中噪声引起的偏差是系统辨识关心的重要问题。本文将我们已提出的ＢＥＬＳ方法进行推广得出：当系统未建模动态可用－ＦＩＲ模型描述时，应用本文的方法可得到系统传递函数的无偏辨识，而不需知道有关噪声和未建模动态概率分布函数的先验知识。