Vinay Chakravarthi Gogineni

Learn More
Distributed multi-task adaptive strategies are useful to estimate multiple parameter vectors simultaneously in a collaborative manner. The existed distributed multi-task strategies use diffusion mode of cooperation in which during adaptation step each node gets the cooperation from it neighborhood nodes but not in the same cluster and during combining step(More)
Distributed adaptive networks achieve better estimation performance by exploiting temporal and as well spatial diversity while consuming few resources. Recent works have studied the single task distributed estimation problem, in which the nodes estimate a single optimum parameter vector collaboratively. However, there are many important applications where(More)
—This paper presents a new VLSI friendly framework for scalable video coding based on Compressed Sensing (CS). It achieves scalability through 3-Dimensional Discrete Wavelet Transform (3-D DWT) and better compression ratio by exploiting the inherent sparsity of the high frequency wavelet sub-bands through CS. By using 3-D DWT and a proposed adaptive(More)
For real-time sparse systems identification applications, Proportionate-type Least Mean Square (Pt-LMS) algorithms are often preferred to their normalized counterparts (Pt-NLMS) due to lower computational complexity of the former algorithms. In this paper, we present the convergence analysis of Pt-LMS algorithms. Without any assumptions on input, both first(More)
In this paper, we present the convergence analysis of proportionate-type least mean square (Pt-LMS) algorithm that identifies the sparse system effectively and more suitable for real time VLSI applications. Both first and second order convergence analysis of Pt-LMS algorithm is studied. Optimum convergence behavior of Pt-LMS algorithm is studied from the(More)
In general, one often encounters the systems that have sparse impulse response, with time varying system sparsity. Conventional adaptive filters which perform well for identification of non-sparse systems fail to exploit the system sparsity for improving the performance as the sparsity level increases. This paper presents a new approach that uses an(More)
Recently proposed Hard Thresholding based Adaptive Filtering (HTAF) algorithm provides an on-line counterpart of a compressed sensing based greedy sparse recovery algorithm called iterative hard thresholding (IHT) by constructing a sliding-window based cost function. This leads to an adaptive algorithm with data reuse gradient term (i.e. with(More)
  • 1