11 April 2016 in IEEE/ACM Transactions on Audio, Speech, and Language Processing
The proportionate normalized least mean square (PNLMS) algorithm and its variants are by far the most popular adaptive filters that are used to identify sparse systems. The convergence speed of the PNLMS algorithm, though very high initially, however, slows down at a later stage, even becoming worse than sparsity agnostic adaptive filters like the NLMS. In this paper, we address this problem by introducing a carefully constructed l 1 norm (of the coefficients) penalty in the PNLMS cost function which favors sparsity. This results in certain zero attracting terms in the PNLMS weight update equation which help in the shrinkage of the coefficients, especially the inactive taps, thereby arresting the slowing down of convergence and also producing lesser steady state excess mean square error (EMSE). A rigorous convergence analysis of the proposed algorithm is presented that expresses the steady state mean square deviation of both the active and the inactive taps in terms of a zero attracting coefficient of the algorithm. The analysis reveals that further reduction of the EMSE is possible by deploying a variable step size (VSS) simultaneously with a variable zero attracting coefficient in the weight update process. Simulation results confirm superior performance of the proposed VSS zero attracting PNLMS algorithm over existing algorithms, especially in terms of having both higher convergence speed and lesser steady state EMSE simultaneously.
11 January 2017 in IEEE Transactions on Circuits and Systems II: Express Briefs
This brief aims to identify and track a sparse system with time varying sparseness by a convex combination of two adaptive filters, one based on the sparsity unaware normalized least mean square (NLMS) algorithm and the other based on the sparsity aware zero-attracting NLMS (ZA-NLMS) algorithm. An analysis of the proposed combination is carried out, which reveals that while the proposed combination converges to the ZA-NLMS or the NLMS-based filter for systems that are highly sparse or highly non-sparse, respectively (i.e., better of the two under the given sparsity condition), it may, however, lead to a filter that performs better than both the constituent filters in the case of systems that lie between moderately sparse to moderately non-sparse. The same is confirmed via detailed simulation studies under different sparsity conditions.
30 December 2019 in IEEE Transactions on Circuits and Systems I: Regular Papers
In this paper, we consider the problem of estimating multiple parameter vectors over a sensor network in a multitasking framework and under temporally-correlated input conditions. For this, an efficient clustered multitask diffusion affine projection algorithm (APA) is proposed that enjoys both intra-cluster and inter-cluster cooperation via diffusion. It is, however, shown that while collaboration in principle is a useful step to enhance the performance of a network, uncontrolled mode of inter-cluster collaboration can at times be detrimental to its convergence performance, especially near steady-state. To overcome this, a controlled form of inter-cluster collaboration is proposed by means of a control variable which helps in maintaining the collaboration in right direction. The proposed controlled multitask strategy attains improved performance in terms of both transient and steady-state mean square deviation (MSD) vis-a-vis existing algorithms, as also confirmed by simulation studies. We carry out a detailed performance analysis of the proposed algorithm, obtain stability bounds for its convergence in both mean and mean-square senses, and derive expressions for the network level MSD. Simulation results reveal that the proposed scheme performs consistently well even in the absence of cluster information.
24 September 2021 in IEEE Transactions on Signal Processing
Recovery of an unknown sparse signal from a few of its projections is the key objective of compressed sensing. Often one comes across signals that are not ordinarily sparse but are sparse blockwise. Existing block sparse recovery algorithms like BOMP make the assumption of uniform block size and known block boundaries, which are, however, not very practical in many applications. This paper addresses this problem and proposes a two step procedure, where the first stage is a coarse block location identification stage while the second stage carries out finer localization of a non-zero cluster within a window selected in the first stage. A detailed convergence analysis of the proposed algorithm is carried out by first defining a so-called pseudoblock-interleaved block RIP for the given generalized block sparse signal and then imposing upper bounds on the corresponding RIC. Simulation results confirm significantly improved performance of the proposed algorithm as compared to BOMP.
13 October 2023 in IEEE Transactions on Aerospace and Electronic Systems
Base line interferometer (BLI) is a popular direction of arrival (DOA) estimation technique for Electronic Warfare (EW) applications. For size, weight and power (SWaP) optimised realization of the BLI, switched mode of operation is preferred which uses fewer number of receiver channels than the number of antenna elements and switches them among the antenna-pairs in a phased manner. Such switched operation, however, results in sub-optimal performance, since, as shown in this paper, it reduces the tolerable phase-error margin and thus produces more erroneous DOA estimates. To overcome this, we propose a three antenna BLI algorithm named as Co-operative BLI (Co-BLI) triplet which provides more tolerable phase-error margin while maintaining high DOA estimation accuracy. This improvement comes at the cost of slight increase in implementation resources. To increase the estimation accuracy further, we next extend the proposed Co-BLI to the case of more number of antennas. For this, we also propose a way to reduce the number of antennas to form a higher-order array and derive the expressions for all inter-element distances. For real-time operation, we develop a Mapping based Co-operative Ambiguity Table (M-CAT) - a lookup-table based implementation scheme where we show that by storing just a few combinations of the input ranges, one can estimate any DOA within the given field-of-view accurately, thus facilitating high throughput hardware implementation avoiding complex computations. The proposed algorithm has been validated through extensive MATLAB simulation studies and implemented in FPGA based real-time hardware