Speeding up the Sphere Decoder With H SDP Inspired Lower Bounds (2010)
Mihailo Stojnic, Haris Vikalo, Babak Hassibi
Abstract—It is well known that maximum-likelihood (ML) decoding in many digital communication schemes reduces to solving an integer least-squares problem, which is NP hard in the worstcase. On the...
On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements (2009)
Stojnic, Mihailo, Parvaresh, Farzad, Hassibi, Babak
Let A be an M by N matrix (M < N) which is an instance of a real random Gaussian ensemble. In compressed sensing we are interested in finding the sparsest solution to the system of equations A x = y...
Various thresholds for $\ell_1$-optimization in compressed sensing (2009)
Recently, \cite{CRT,DonohoPol} theoretically analyzed the success of a polynomial $\ell_1$-optimization algorithm in solving an under-determined system of linear equations. In a large dimensional and...
Block-length dependent thresholds in block-sparse compressed sensing (2009)
One of the most basic problems in compressed sensing is solving an under-determined system of linear equations. Although this problem seems rather hard certain $\ell_1$-optimization algorithm appears...
Compressed sensing - probabilistic analysis of a null-space characterization (2008)
Stojnic, Mihailo, Xu, Weiyu, Hassibi, Babak
It is well known that compressed sensing problems reduce to solving large under-determined systems of equations. To assure that the problem is well defined, i.e., that the solution is unique the...
Xu, Weiyu, Stojnic, Mihailo, Hassibi, Babak
The demand for high data rate reliable communications poses great challenges to the next generation wireless systems in highly dynamic mobile environments. In this paper, we investigate the joint...
On the reconstruction of block-sparse signals with an optimal number of measurements (2008)
Stojnic, Mihailo, Parvaresh, Farzad, Hassibi, Babak
Let A be an M by N matrix (M < N) which is an instance of a real random Gaussian ensemble. In compressed sensing we are interested in finding the sparsest solution to the system of equations A x = y...
Speeding up the Sphere Decoder With ℋ∞ and SDP Inspired Lower Bounds (2008)
Stojnic, Mihailo, Vikalo, Haris, Hassibi, Babak
It is well known that maximum-likelihood (ML) decoding in many digital communication schemes reduces to solving an integer least-squares problem, which is NP hard in the worst-case. On the other...
Optimization algorithms in wireless and quantum communications (2007)
Since the first communication systems were developed, the scientific community has been witnessing attempts to increase the amount of information that can be transmitted. In the last 10--15 years...
Rate maximization in multi-antenna broadcast channels with linear preprocessing (2006)
Stojnic, Mihailo, Vikalo, Haris, Hassibi, Babak
The sum rate capacity of the multi-antenna broadcast channel has recently been computed. However, the search for efficient practical schemes that achieve it is still ongoing. In this paper, we focus...
Optimal quantum detectors for unambiguous detection of mixed states (2003)
Eldar, Yonina C., Stojnic, Mihailo, Hassibi, Babak
We consider the problem of designing an optimal quantum detector that distinguishes unambiguously between a collection of mixed quantum states. Using arguments of duality in vector space...