activity
20052024
most citedCollaborative Beamforming for Distributed Wireless Ad Hoc Sensor Networks

613 citations · 2k across the 113 of their papers we have counts for

collaborators
Showing cs.ITShow all

19 papers · 1 filter

cs.IT2017

Pseudo-Wigner Matrices

Ilya Soloveychik, Yu Xiang, Vahid Tarokh

We consider the problem of generating pseudo-random matrices based on the similarity of their spectra to Wigner's semicircular law. We introduce the notion of an r-independent pseu…

cs.IT2015★ 1 cited

Comment on "Asymptotic Achievability of the Cramér-Rao Bound for Noisy Compressive Sampling"

Behtash Babadi, Nicholas Kalouptsidis, Vahid Tarokh

In [1], we proved the asymptotic achievability of the Cramér-Rao bound in the compressive sensing setting in the linear sparsity regime. In the proof, we used an erroneous closed-f…

cs.IT2015

Capacity of Hexagonal Checkerboard Codes

Zhun Deng, Jie Ding, Mohammad Noshad +1

In this paper, we propose a new method to bound the capacity of checkerboard codes on the hexagonal lattice. This produces rigorous bounds that are tighter than those commonly know…

cs.IT2015★ 14 cited

Complementary Lattice Arrays for Coded Aperture Imaging

Jie Ding, Mohammad Noshad, Vahid Tarokh

In this work, we consider complementary lattice arrays in order to enable a broader range of designs for coded aperture imaging systems. We provide a general framework and methods…

cs.IT2015★ 1 cited

The Number of Independent Sets in Hexagonal Graphs

Zhun Deng, Jie Ding, Mohammad Noshad +1

A new method is proposed to derive rigorous bounds on η, the growth rate of the logarithm of the number of independent sets on a hexagonal lattice. Specifically, we prove that 1.54…

cs.IT2013★ 12 cited

New Conditions for Sparse Phase Retrieval

Mehmet Akçakaya, Vahid Tarokh

We consider the problem of sparse phase retrieval, where a -sparse signal is measured as ${\bf y} = |{\bf Ax}|…