基于数据重用的集员滤波拟仿射投影盲均衡算法

传统常模盲均衡算法应用广泛但是其收敛速率很慢.为了满足在短突发数据条件下的信道盲均衡,提出一种基于数据重用的集员滤波拟仿射投影盲均衡算法.该算法将仿射投影思想结合到常模算法中,利用多数据向量同时提取信道信息,再附加改进的集员滤波算法有效减小了运算量,并结合数据重用思想重新设计所匹配的数据重用方式.仿真结果证明所提算法具有较快的收敛速率,与同类算法相比能提前700个迭代点收敛,且在信噪比为10 dB以上的信道环境中也有较好的效果,能够在短突发数据信道均衡中有效发挥作用.     

加权部分更新仿射投影算法

从数据重用因子出发,得到了基于部分更新仿射投影算法（SR-APA）的改进算法。该算法通过加权改变了SR-APA的数据筛选规律,从而降低了等效数据重用因子,并且通过对未加权原始数据的重新利用巧妙地避免了加权带来的条件数增加问题,最终达到了降低稳态均方误差（MSE）的效果。仿真结果表明,该算法不仅MSE比SR-APA低,收敛速度也比SR-APA快。在收敛速度相同时,该算法计算量只有SR-APA计算量的50%左右。     

不定阶变步长仿射投影算法

变步长仿射投影算法因结构简单、收敛速度快等优点而得到广泛重视。然而此算法由于计算量大,其应用受到一定限制。为了降低算法复杂度,利用变阶思想,在迭代过程中对投影阶数进行控制,文章提出一种新的变步长仿射投影算法——不定阶变步长仿射投影算法。该算法根据均方偏差的收敛条件,在迭代过程中不断减小投影阶数。仿真结果表明,该算法在减小计算量的同时还能保证很快的收敛速度和低的失调。     

改进仿射投影算法及其在电子回声消除中的应用

在电子回声消除应用中,为提高自适应算法的收敛速度,提出一种改进的仿射投影算法及其快速实现形式.新算法利用回声路径的稀疏结构特征,通过收敛步长控制矩阵,按滤波器各系数幅值大小,等比例地为其指定相应收敛步长,以加快大系数收敛,最终达到加快滤波器整体收敛速度的目的.对新算法进行的统计学分析,为其快速收敛于目标系统的算法特性提供了理论依据.仿真实验表明与传统自适应算法相比,新算法能减小稳态失调并大幅提高收敛速度,其低计算复杂度亦保证了系统的实时性.     

一种改进的自适应波束赋形算法

为了弥补传统的LMS算法采用固定步长无法解决收敛速度和稳态误差之间矛盾的缺陷,改进了失调系数,提出了一种改进的LMS算法用于求解自适应波束赋形的最佳权值。理论分析证实归一化的LMS算法可以通过采用一个可变因子使瞬时输出误差最小化。仿真结果表明,归一化的LMS算法采用了可变步长比传统LMS算法收敛快,稳态误差和失调相对于LMS都有所改善。     

一种指数型变步长仿射投影算法

可变平滑因子的变步长仿射投影算法需要根据投影误差范数的变化确定＂触发点＂,并切换平滑因子,实现较为复杂。为此这里提出了一种改进的指数型变步长仿射投影算法。该方法直接将投影误差的范数通过指数函数映射得到平滑因子,有效降低了实现复杂度。仿真结果表明该算法的均方偏差性能优于变步长仿射投影算法和常规的仿射投影算法。     

基于VSSAP算法的自适应干扰对消技术研究

针对雷达干扰机收发天线之间存在的同频干扰问题,文中研究了基于变步长仿射投影(VSSAP)算法的自适应干扰对消技术。该算法针对仿射投影(AP)算法的定步长因子进行改进,建立了以高斯分布函数为基础改进的步长函数,同时利用误差信号的自相关作为步长函数的自变量,得到步长因子随误差信号变化的函数表达式,从而在加快算法收敛速度的同时改善稳态误差。最终的实验结果证明：该算法的收敛速度和稳态误差明显优于最小均方误差(LMS)及其改进算法,且与参考算法相比,收敛速度大大加快,对消比提高了10 dB左右。在转发式雷达干扰机中,欺骗干扰与压制干扰得到有效抑制,使得目标信号得以较好还原。     

基于集员滤波的宽带有源噪声控制算法

子带结构是提高宽带噪声控制的有效方法,归一化子带自适应滤波(NSAF)结构消除了传统子带结构在输出端产生混叠分量的问题,但由于在每个子带上采用相同的全带自适应滤波器,使得计算量高于传统子带结构,集员滤波(SMF)技术具有数据选择更新的特点,可有效降低计算量,且在收敛速度和稳态均方误差之间具有较好的折中性。在此引入集员滤波技术,建立基于NSAF结构的无延迟前馈有源噪声控制系统,降低计算量,最后仿真验证了该算法对宽带噪声具有更优的降噪效果。     

一种新自适应滤波快速算法及其 在多路回波消除中的应用

本文提出了一种新的自适应滤波算法,该算法结构简单、计算量适中且收敛速度快,弥补了一般变步长LMS自适应算法计算量小但收敛速度欠佳,以及仿射投影算法(APA)收敛速度快但计算量非常大的缺陷.该算法计算量与一般LMS算法相当,而收敛速度却与APA算法相当,其结构比APA及相应的改进算法要简单得多.我们不仅对所提算法的收敛性及性能进行了分析,而且将它用于多路回波消除中获得了成功,仿真结果表明,该算法与Sankaran(1997)所提NLMS-OCF算法及Benesty(1996)所提APA-MC算法比较,在收敛速度和收敛精度相当的情况下,其计算复杂度大大减少.从而新算法具备更好的实时性.     

分布式子带自适应滤波算法

为了解决分布式最小均方算法在输入信号相关性较高时收敛速度较慢、分布式仿射投影算法计算复杂度较高等问题,本文提出了两种分布式子带自适应滤波算法,即递增式和扩散式子带自适应滤波算法.分布式子带自适应滤波算法将节点信号进行子带分割来降低信号的相关性,从而加快收敛速度.由于用于子带分割的滤波器组中包含了抽取单元,所以分布式子带自适应滤波算法和对应的分布式最小均方算法的计算复杂度相近.仿真结果表明,与分布式最小均方算法相比,分布式子带自适应滤波算法具有更好的收敛性能.     

Steady-State MSE Performance of the Set-Membership Affine Projection Algorithm

The set-membership affine projection (SM-AP) algorithm has many desirable characteristics such as fast convergence speed, low power consumption due to data-selective updates, and low misadjustment. The main reason hindering the widespread use of the SM-AP algorithm is the lack of analytical results related to its steady-state performance. In order to bridge this gap, this paper presents an analysis of the steady-state mean square error (MSE) of a general form of the SM-AP algorithm. The proposed analysis results in closed-form expressions for the excess MSE and misadjustment of the SM-AP algorithm, which are also applicable to many other algorithms. This work also provides guidelines for the analysis of the whole family of SM-AP algorithms. The analysis relies on the energy conservation method and has the attractive feature of not assuming a specific model for the input signal. In addition, the choice of the upper bound for the error of the SM-AP algorithm is addressed for the first time. Simulation results corroborate the accuracy of the proposed analysis.     

Convergence Performance of the Simplified Set-Membership Affine Projection Algorithm

Set-membership (SM) adaptive filtering is appealing in many practical situations, particularly those with inherent power and computational constraints. The main feature of the SM algorithms is their data-selective coefficient update leading to lower computational complexity and power consumption. The set-membership affine projection (SM-AP) algorithm does not trade convergence speed with misadjustment and computation complexity as many existing adaptive filtering algorithms. In this work analytical results related to the SM-AP algorithm are presented for the first time, providing tools to setup its parameters as well as some interpretation to its desirable features. The analysis results in expressions for the excess mean square error (MSE) in stationary environments and the transient behavior of the learning curves. Simulation results confirm the accuracy of the analysis and the good features of the SM-AP algorithms.     

A two-stage affine projection algorithm with mean-square-error-matching step-sizes

This paper proposes a two-stage affine projection algorithm (APA) with different projection orders and step-sizes. The proposed algorithm has a high projection order and a fixed step-size to achieve fast convergence rate at the first stage and a low projection order and a variable step-size to achieve small steady-state estimation errors at the second stage. The stage transition moment from the first to the second stage is determined by examining, from a stochastic point of view, whether the current error reaches the steady-state value. Moreover, in order to prevent the sudden drop of convergence rate on switching from a high projection order to a low projection order, a matching step-size method has been introduced to determine the initial step-size of the second stage by matching the mean-square errors (MSEs) before and after the transition moment. In order to continuously reduce steady-state estimation errors, the proposed algorithm adjusts the step-size of the second stage by employing a simple algorithm. Because of the reduced projection orders and variable step-size in the steady-state, the algorithm achieves improved performance as well as extremely low computational complexity as compared to the existing APAs with selective input vectors and APAs with variable step-size.     

一种改进的变步长LMS算法

LMS算法由于简单而获得了广泛的应用,大量的深入研究不断地改善了它的性能。LMS算法存在收敛速度和稳态失调之间的固有冲突,变步长因子可以获得二者之间的有效平衡。对已有的一些变步长LMS自适应滤波算法进行了分析,在此基础上提出一种改进的变步长LMS算法,步长因子同时考虑了指数为预测误差的一次和二次幂的2项。算法在保持较快收敛速度的同时,获得更优的稳态预测误差。对比仿真实验证明了算法的优越性。     

一种变正则化矩阵的改进多带结构子带自适应滤波算法

定正则化因子的改进多带结构子带自适应滤波(IMSAF)算法在取得收敛速度快和稳态失调误差小之间存在冲突.根据系统噪声抵消原理,设定子带后验误差功率等于子带噪声功率,本文提出了变正则化矩阵的IMSAF算法来解决这一问题.仿真结果证明,所提算法可以同时达到收敛速度快、稳态失调误差小以及追踪速度快等优势.     

用于稀疏系统辨识的低复杂度集员NLMS算法

针对现有的稀疏集员(SM,Set-Membership)自适应滤波算法,普遍存在稳态均方偏差(MSD,Mean Square Deviation)的稳定性较低及运算复杂度较高等问题,提出了一种新颖的稀疏集员NLMS(NLMS,Normalized Least Mean Square)算法.该方案提出一种运算复杂度更低的...     

Set-membership binormalized data-reusing LMS algorithms

This paper presents and analyzes novel data selective normalized adaptive filtering algorithms with two data reuses. The algorithms [the set-membership binormalized LMS (SM-BN-DRLMS) algorithms] are derived using the concept of set-membership filtering (SMF). These algorithms can be regarded as generalizations of the previously proposed set-membership NLMS (SM-NLMS) algorithm. They include two constraint sets in order to construct a space of feasible solutions for the coefficient updates. The algorithms include data-dependent step sizes that provide fast convergence and low-excess mean-squared error (MSE). Convergence analyzes in the mean squared sense are presented, and closed-form expressions are given for both white and colored input signals. Simulation results show good performance of the algorithms in terms of convergence speed, final misadjustment, and reduced computational complexity.     

Low-Complexity Non-Uniform Penalized Affine Projection Algorithm for Sparse System Identification

In this paper, an improved sparse-aware affine projection (AP) algorithm for sparse system identification is proposed and investigated. The proposed sparse AP algorithm is realized by integrating a non-uniform norm constraint into the cost function of the conventional AP algorithm, which can provide a zero attracting on the filter coefficients according to the value of each filter coefficient. Low complexity is obtained by using a linear function instead of the reweighting term in the modified AP algorithm to further improve the performance of the proposed sparse AP algorithm. The simulation results demonstrate that the proposed sparse AP algorithm outperforms the conventional AP and previously reported sparse-aware AP algorithms in terms of both convergence speed and steady-state error when the system is sparse.     

Distributed Estimation Over an Adaptive Incremental Network Based on the Affine Projection Algorithm

We study the problem of distributed estimation based on the affine projection algorithm (APA), which is developed from Newton's method for minimizing a cost function. The proposed solution is formulated to ameliorate the limited convergence properties of least-mean-square (LMS) type distributed adaptive filters with colored inputs. The analysis of transient and steady-state performances at each individual node within the network is developed by using a weighted spatial-temporal energy conservation relation and confirmed by computer simulations. The simulation results also verify that the proposed algorithm provides not only a faster convergence rate but also an improved steady-state performance as compared to an LMS-based scheme. In addition, the new approach attains an acceptable misadjustment performance with lower computational and memory cost, provided the number of regressor vectors and filter length parameters are appropriately chosen, as compared to a distributed recursive-least-squares (RLS) based method.     

Set-Membership Adaptive Algorithms Based on Time-Varying Error Bounds for CDMA Interference Suppression

This paper presents set-membership (SM) adaptive algorithms based on time-varying error bounds for code-division multiple-access (CDMA) interference suppression. We introduce a modified family of SM adaptive algorithms for parameter estimation with time-varying error bounds. The considered algorithms include modified versions of the SM normalized least mean square (SM-NLMS), the affine projection (SM-AP), and the bounding ellipsoidal adaptive constrained (BEACON) recursive least-square technique. The important issue of error-bound specification is addressed in a new framework that takes into account parameter estimation dependency, multiaccess, and intersymbol interference (ISI) for direct-sequence CDMA (DS-CDMA) communications. An algorithm for tracking and estimating the interference power is proposed and analyzed. This algorithm is then incorporated into the proposed time-varying error bound mechanisms. Computer simulations show that the proposed algorithms are capable of outperforming previously reported techniques with a significantly lower number of parameter updates and a reduced risk of overbounding or underbounding.