132 citations · 1.3k across the 52 of their papers we have counts for
16 papers · 1 filter
Generalized Geometric Programming for Rate Allocation in Consensus
Ryan Pilgrim, Junan Zhu, Dror Baron +1
Distributed averaging, or distributed average consensus, is a common method for computing the sample mean of the data dispersed among the nodes of a network in a decentralized mann…
Design and Analysis of Sparsifying Dictionaries for FIR MIMO Equalizers
Abubakr O. Al-Abbasi, Ridha Hamila, Waheed U. Bajwa +1
In this paper, we propose a general framework that transforms the problems of designing sparse finite-impulseresponse linear equalizers and non-linear decision-feedback equalizers,…
Minimax Lower Bounds on Dictionary Learning for Tensor Data
Zahra Shakeri, Waheed U. Bajwa, Anand D. Sarwate
This paper provides fundamental limits on the sample complexity of estimating dictionaries for tensor data. The specific focus of this work is on th-order tensor data and the ca…
Minimax Lower Bounds for Kronecker-Structured Dictionary Learning
Zahra Shakeri, Waheed U. Bajwa, Anand D. Sarwate
Dictionary learning is the problem of estimating the collection of atomic elements that provide a sparse representation of measured/collected signals or data. This paper finds fund…
Design and Analysis Framework for Sparse FIR Channel Shortening
Abubakr O. Al-Abbasi, Ridha Hamila, Waheed U. Bajwa +1
A major performance and complexity limitation in broadband communications is the long channel delay spread which results in a highly-frequency-selective channel frequency response.…
A General Framework for the Design and Analysis of Sparse FIR Linear Equalizers
Abubakr O. Al-Abbasi, Ridha Hamila, Waheed U. Bajwa +1
Complexity of linear finite-impulse-response (FIR) equalizers is proportional to the square of the number of nonzero taps in the filter. This makes equalization of channels with lo…