Babak Hassibi

Research interests

Publications

• Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices

  IEEE Transactions on Information Theory · 2015 · 10.1109/tit.2015.2401574

• The Secrecy Capacity of the MIMO Wiretap Channel

  IEEE Transactions on Information Theory · 2011 · 10.1109/tit.2011.2158487

• Peer Effects and Stability in Matching Markets

  Lecture notes in computer science · 2011 · 10.1007/978-3-642-24829-0_12

• On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements

  IEEE Transactions on Signal Processing · 2009 · 10.1109/tsp.2009.2020754

• The secrecy capacity of the MIMO wiretap channel

  · 2008 · 10.1109/isit.2008.4595041

• Optimal LQG control across packet-dropping links

  Systems & Control Letters · 2007 · 10.1016/j.sysconle.2006.11.003

• A Comparison of Time-Sharing, DPC, and Beamforming for MIMO Broadcast Channels With Many Users

  IEEE Transactions on Communications · 2007 · 10.1109/tcomm.2006.887480

• Capacity of wireless erasure networks

  IEEE Transactions on Information Theory · 2006 · 10.1109/tit.2005.864424

• Distributed Space-Time Coding in Wireless Relay Networks

  IEEE Transactions on Wireless Communications · 2006 · 10.1109/twc.2006.256975

• On the sphere-decoding algorithm I. Expected complexity

  IEEE Transactions on Signal Processing · 2005 · https://doi.org/10.1109/tsp.2005.850352

• On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage

  Automatica · 2005 · 10.1016/j.automatica.2005.09.016

• On the sphere-decoding algorithm II. Generalizations, second-order statistics, and applications to communications

  IEEE Transactions on Signal Processing · 2005 · 10.1109/tsp.2005.850350

• On the capacity of MIMO broadcast channels with partial side information

  IEEE Transactions on Information Theory · 2005 · https://doi.org/10.1109/tit.2004.840897

• Iterative Decoding for MIMO Channels Via Modified Sphere Decoding

  IEEE Transactions on Wireless Communications · 2004 · 10.1109/twc.2004.837271

• How much training is needed in multiple-antenna wireless links?

  IEEE Transactions on Information Theory · 2003 · https://doi.org/10.1109/tit.2003.809594

• Multiple-antennas and isotropically random unitary inputs: the received signal density in closed form

  IEEE Transactions on Information Theory · 2002 · 10.1109/tit.2002.1003835

• High-rate codes that are linear in space and time

  IEEE Transactions on Information Theory · 2002 · https://doi.org/10.1109/tit.2002.1013127

• Optimal Brain Surgeon and general network pruning

  · 2002 · 10.1109/icnn.1993.298572

• An efficient square-root algorithm for BLAST

  · 2002 · 10.1109/icassp.2000.859065

• Cayley differential unitary space-time codes

  IEEE Transactions on Information Theory · 2002 · 10.1109/tit.2002.1003836

• Representation theory for high-rate multiple-antenna code design

  IEEE Transactions on Information Theory · 2001 · 10.1109/18.945251

• H/sup ∞/ optimality of the LMS algorithm

  IEEE Transactions on Signal Processing · 1996 · 10.1109/78.485923

• Linear estimation in Krein spaces. II. Applications

  IEEE Transactions on Automatic Control · 1996 · 10.1109/9.481606

• Blind channel identification based on second-order statistics: a frequency-domain approach

  IEEE Transactions on Information Theory · 1995 · 10.1109/18.370088

• Second Order Derivatives for Network Pruning: Optimal Brain Surgeon

  CaltechAUTHORS (California Institute of Technology) · 1993

Current projects

No projects listed.