A Least Squares Approach to Escalator Algorithms for Adaptive Filtering

In this paper, we introduce an escalator (ESC) algorithm based on the least squares (LS) criterion. The proposed algorithm is relatively insensitive to the eigenvalue spread ratio (ESR) of an input signal and has a faster convergence speed than the conventional ESC algorithms. This algorithm exploits the fast adaptation ability of least squares methods and the orthogonalization property of the ESC structure. From the simulation results, the proposed algorithm shows superior convergence performance.     

一种高精度的非平稳随机信号实时建模算法研究

针对传统的非平稳随机信号时变参数筹分模型算法的不足,论文把非平稳随机信号时变参数差分模型与一种带自适应遗忘因子的RLS算法结合起来,形成一种有效的非平稳随机信号实时建模算法,仿真分析表明该算法不仅能获得快的收敛速度而且能获得高的建模精度。     

一种变步长D-Rake多用户检测器

在时变多径衰落信道下,接收到的CDMA信号功率变化较大,此时D-Rake盲自适应多用户检测器性能显著下降,将变步长LMS算法与基于主分量的相干合并引入到D-Rake(DecorrelatingRake)检测器中,构成一种变步长D-Rake,称之为VD-Rake(Variablestep-sizeDecorrelatingRake)检测器。该检测器能克服原D-Rake检测器对信号功率变化较敏感等缺点,有效地改善了D-Rake检测器的性能。     

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

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

DSR的一种自适应路由自动缩短机制

动态源路由协议是无线自组织网络众多路由协议中被广泛关注的一种按需路由协议，目前，关于该协议的优化措施有很多。本文先分析了动态源路由协议的一种优化机制——路由自动缩短，该机制能动态缩短处于工作状态路由的跳数，但不保证缩短路由的质量，在此基础上，提出一种自适应路由自动缩短机制，新机制既可缩短路由．又能保证缩短路由质量．理论分析及仿真结果表明，自适应路由缩短机制的各项性能优于原路由缩短机制。     

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.     

传感器管理及其在相控阵雷达中的应用

传感器管理是数据融合的一部分。介绍了传感器管理的概念和框架 ,概述了国内外传感器管理算法的研究现状。主要工作是针对相控阵雷达这一传感器 ,通过对其不同工作模式以及不同参数的管理 ,来说明传感器管理的原理。提出了一种新的自适应采样周期算法 ,仿真结果表明该算法的优越性     

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

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

Bandwidth Adaptation Algorithms for Adaptive Multimedia Services in Mobile Cellular Networks

The fluctuation of available link bandwidth in mobilecellular networks motivates the study of adaptive multimediaservices, where the bandwidth of an ongoing multimedia call can bedynamically adjusted. We analyze the diverse objectives of theadaptive multimedia framework and propose two bandwidth adaptationalgorithms (BAAs) that can satisfy these objectives. The firstalgorithm, BAA-RA, takes into consideration revenue and``anti-adaptation' where anti-adaptation means that a user feelsuncomfortable whenever the bandwidth of the user's call ischanged. This algorithm achieves near-optimal total revenue withmuch less complexity compared to an optimal BAA. The secondalgorithm, BAA-RF, considers revenue and fairness, and aims at themaximum revenue generation while satisfying the fairnessconstraint defined herein. Comprehensive simulation experimentsshow that the difference of the total revenue of BAA-RA and thatof an optimal BAA is negligible. Also, numerical results revealthat there is a conflicting relationship between anti-adaptationand fairness.     

A robust adaptive pole‐placement controller without strictly positive real condition

This paper considers the adaptive pole‐placement control problem for system (1) with unmodelled dynamics η_n dominated by a small constant ε multiplied by a quantity independent of ε but tending to infinity as the past input, output, and noise grow. Using bounded external excitation and randomly varying truncation techniques, we give a design method of adaptive pole‐placement controller. It is shown that the closed‐loop system is globally stable, the estimation error for the parameter contained in the modelled part is of order ε, and the closed‐loop system under the adaptive pole‐placement control law is suboptimal in the sense of $$\mathop{\lim\sup}\limits_{{n\to\infty }}{1\over n}\mathop{\sum}\limits_{i=0}^n{\left({A^{*}(z)y_{n}‐L(z)C(z)w_{n}‐B(z)R(z)y_{n}^{*}}\right)^{2}{\leq}O({\varepsilon}^{2})+\gamma^{2}\mathop{\sum}\limits_{j=1}^q{b_{j}^{2}}}$$\nopagenumbers\end while the SPR condition used usually in other papers is replaced by a stability condition. Copyright © 2001 John Wiley & Sons, Ltd.