Geosphere: consistently turning MIMO capacity into throughput

This paper presents the design and implementation of Geosphere, a physical- and link-layer design for access point-based MIMO wireless networks that consistently improves network throughput. To send multiple streams of data in a MIMO system, prior designs rely on a technique called zero-forcing, a way of "nulling" the interference between data streams by mathematically inverting the wireless channel matrix. In general, zero-forcing is highly effective, significantly improving throughput. But in certain physical situations, the MIMO channel matrix can become "poorly conditioned," harming performance. With these situations in mind, Geosphere uses sphere decoding, a more computationally demanding technique that can achieve higher throughput in such channels. To overcome the sphere decoder's computational complexity when sending dense wireless constellations at a high rate, Geosphere introduces search and pruning techniques that incorporate novel geometric reasoning about the wireless constellation. These techniques reduce computational complexity of 256-QAM systems by almost one order of magnitude, bringing computational demands in line with current 16- and 64-QAM systems already realized in ASIC. Geosphere thus makes the sphere decoder practical for the first time in a 4 × 4 MIMO, 256-QAM system. Results from our WARP testbed show that Geosphere achieves throughput gains over multi-user MIMO of 2× in 4 × 4 systems and 47% in 2 × 2 MIMO systems.

[1]  Alexei Gorokhov,et al.  Field Results on MIMO Performance in UMB Systems , 2008, VTC Spring 2008 - IEEE Vehicular Technology Conference.

[2]  Chintha Tellambura,et al.  An efficient generalized sphere decoder for rank-deficient MIMO systems , 2004, IEEE 60th Vehicular Technology Conference, 2004. VTC2004-Fall. 2004.

[3]  Andreas Peter Burg,et al.  Area- and throughput-optimized VLSI architecture of sphere decoding , 2010, 2010 18th IEEE/IFIP International Conference on VLSI and System-on-Chip.

[4]  Erik Agrell,et al.  Faster Recursions in Sphere Decoding , 2009, IEEE Transactions on Information Theory.

[5]  Emre Telatar,et al.  Capacity of Multi-antenna Gaussian Channels , 1999, Eur. Trans. Telecommun..

[6]  S. Nagaraj,et al.  A MIMO zero forcing receiver with interference cancellation for BICM , 2005, IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005..

[7]  Helmut Bölcskei,et al.  Soft-input soft-output sphere decoding , 2008, 2008 IEEE International Symposium on Information Theory.

[8]  Wei Wang,et al.  SAM: enabling practical spatial multiple access in wireless LAN , 2009, MobiCom '09.

[9]  Loïc Brunel,et al.  Soft-input soft-output lattice sphere decoder for linear channels , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[10]  Gerd Ascheid,et al.  A 772Mbit/s 8.81bit/nJ 90nm CMOS soft-input soft-output sphere decoder , 2011, IEEE Asian Solid-State Circuits Conference 2011.

[11]  Tracey Ho,et al.  Statistical Pruning for Near Maximum Likelihood Detection of MIMO Systems , 2007, 2007 IEEE International Conference on Communications.

[12]  Gerd Ascheid,et al.  A 2.78 mm2 65 nm CMOS gigabit MIMO iterative detection and decoding receiver , 2012, 2012 Proceedings of the ESSCIRC (ESSCIRC).

[13]  Inkyu Lee,et al.  A new reduced-complexity sphere decoder for multiple antenna systems , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[14]  Moe Z. Win,et al.  MMSE reception and successive interference cancellation for MIMO systems with high spectral efficiency , 2005, IEEE Transactions on Wireless Communications.

[15]  Babak Hassibi,et al.  Further Results on Speeding up the Sphere Decoder , 2006, 2006 IEEE International Conference on Acoustics Speech and Signal Processing Proceedings.

[16]  Gerhard Fettweis,et al.  Search sequence determination for tree search based detection algorithms , 2009, 2009 IEEE Sarnoff Symposium.

[17]  Gerhard Fettweis,et al.  A 335Mb/s 3.9mm2 65nm CMOS flexible MIMO detection-decoding engine achieving 4G wireless data rates , 2012, 2012 IEEE International Solid-State Circuits Conference.

[18]  Andrea J. Goldsmith,et al.  On the optimality of multiantenna broadcast scheduling using zero-forcing beamforming , 2006, IEEE Journal on Selected Areas in Communications.

[19]  Byonghyo Shim,et al.  Sphere Decoding With a Probabilistic Tree Pruning , 2008, IEEE Transactions on Signal Processing.

[20]  Andreas Peter Burg,et al.  Reduced-complexity mimo detector with close-to ml error rate performance , 2007, GLSVLSI '07.

[21]  Shuangshuang Han,et al.  Probability-Distribution-Based Node Pruning for Sphere Decoding , 2013, IEEE Transactions on Vehicular Technology.

[22]  Thomas L. Marzetta,et al.  Multiple-antenna channel hardening and its implications for rate feedback and scheduling , 2004, IEEE Transactions on Information Theory.

[23]  John S. Thompson,et al.  Fixing the Complexity of the Sphere Decoder for MIMO Detection , 2008, IEEE Transactions on Wireless Communications.

[24]  Mikel Mendicute,et al.  Implementation of complex enumeration for multiuser MIMO vector precoding , 2011, 2011 19th European Signal Processing Conference.

[25]  Georgios B. Giannakis,et al.  Reduced complexity closest point decoding algorithms for random lattices , 2006, IEEE Transactions on Wireless Communications.

[26]  Byonghyo Shim,et al.  On further reduction of complexity in tree pruning based sphere search , 2010, IEEE Transactions on Communications.

[27]  Tong Zhang,et al.  Relaxed $K$ -Best MIMO Signal Detector Design and VLSI Implementation , 2007, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[28]  Björn E. Ottersten,et al.  The Error Probability of the Fixed-Complexity Sphere Decoder , 2009, IEEE Transactions on Signal Processing.

[29]  S. Roger,et al.  Combined K-Best sphere decoder based on the channel matrix condition number , 2008, 2008 3rd International Symposium on Communications, Control and Signal Processing.

[30]  Ender Ayanoglu,et al.  Reduced complexity sphere decoding via a reordered lattice representation , 2009, IEEE Transactions on Communications.

[31]  Giuseppe Caire,et al.  On maximum-likelihood detection and the search for the closest lattice point , 2003, IEEE Trans. Inf. Theory.

[32]  P. Glenn Gulak,et al.  Scalable VLSI architecture for K-best lattice decoders , 2008, 2008 IEEE International Symposium on Circuits and Systems.

[33]  A. Burg,et al.  VLSI implementation of MIMO detection using the sphere decoding algorithm , 2005, IEEE Journal of Solid-State Circuits.

[34]  Zhan Guo,et al.  Algorithm and implementation of the K-best sphere decoding for MIMO detection , 2006, IEEE Journal on Selected Areas in Communications.

[35]  Devavrat Shah,et al.  Spinal codes , 2012, CCRV.

[36]  T. Kailath,et al.  Iterative decoding for MIMO channels via modified sphere decoding , 2004, IEEE Transactions on Wireless Communications.

[37]  Michael D. Zoltowski,et al.  User Selection With Zero-Forcing Beamforming Achieves the Asymptotically Optimal Sum Rate , 2008, IEEE Transactions on Signal Processing.

[38]  Alexander Vardy,et al.  Closest point search in lattices , 2002, IEEE Trans. Inf. Theory.

[39]  Franz Hlawatsch,et al.  Efficient detection algorithms for MIMO channels: a geometrical approach to approximate ML detection , 2003, IEEE Trans. Signal Process..

[40]  Ming-Syan Chen,et al.  Rate Adaptation for 802.11 Multiuser MIMO Networks , 2012, IEEE Transactions on Mobile Computing.

[41]  Ahmed M. Eltawil,et al.  Design and Implementation of a Sort-Free K-Best Sphere Decoder , 2010, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[42]  G. Strang Introduction to Linear Algebra , 1993 .

[43]  Ian J. Wassell,et al.  A new ordering for efficient sphere decoding , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[44]  KyungHi Chang,et al.  Fixed-complexity sphere encoder for multi-user MIMO systems , 2011, Journal of Communications and Networks.

[45]  David Tse,et al.  Fundamentals of Wireless Communication , 2005 .

[46]  A. Lee Swindlehurst,et al.  A vector-perturbation technique for near-capacity multiantenna multiuser communication-part I: channel inversion and regularization , 2005, IEEE Transactions on Communications.

[47]  Erwin Kreyszig,et al.  Advanced Engineering Mathematics, Maple Computer Guide , 2000 .

[48]  Rainer Leupers,et al.  A Scalable VLSI Architecture for Soft-Input Soft-Output Single Tree-Search Sphere Decoding , 2009, IEEE Transactions on Circuits and Systems II: Express Briefs.

[49]  A. Lee Swindlehurst,et al.  A vector-perturbation technique for near-capacity multiantenna multiuser communication-part II: perturbation , 2005, IEEE Transactions on Communications.

[50]  Stephan ten Brink,et al.  Achieving near-capacity on a multiple-antenna channel , 2003, IEEE Trans. Commun..

[51]  Dina Katabi,et al.  Interference alignment and cancellation , 2009, SIGCOMM '09.

[52]  Gerald Matz,et al.  Low-Complexity and Full-Diversity MIMO Detection Based on Condition Number Thresholding , 2007, 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07.

[53]  Chiung-Jang Chen,et al.  On the performance of the zero-forcing receiver operating in the multiuser MIMO system with reduced noise enhancement effect , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[54]  P. Glenn Gulak,et al.  A pipelined scalable high-throughput implementation of a near-ML K-best complex lattice decoder , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.

[55]  Claus-Peter Schnorr,et al.  Lattice basis reduction: Improved practical algorithms and solving subset sum problems , 1991, FCT.

[56]  Abu B. Sesay,et al.  Spatial correlation and capacity measurements for wideband MIMO channels in indoor office environment , 2008, IEEE Transactions on Wireless Communications.

[57]  Kate Ching-Ju Lin,et al.  Random access heterogeneous MIMO networks , 2011, SIGCOMM 2011.

[58]  Wai Ho Mow,et al.  A VLSI architecture of a K-best lattice decoding algorithm for MIMO channels , 2002, 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353).

[59]  E. Kreyszig,et al.  Advanced Engineering Mathematics. , 1974 .

[60]  Qing Yang,et al.  BigStation: enabling scalable real-time signal processingin large mu-mimo systems , 2013, SIGCOMM.

[61]  Babak Hassibi,et al.  Statistical Pruning for Near-Maximum Likelihood Decoding , 2007, IEEE Transactions on Signal Processing.

[62]  Zhongfeng Wang,et al.  Improved k-best sphere decoding algorithms for MIMO systems , 2006, 2006 IEEE International Symposium on Circuits and Systems.

[63]  M. O. Damen,et al.  Generalised sphere decoder for asymmetrical space-time communication architecture , 2000 .

[64]  Andreas Peter Burg,et al.  K-best MIMO detection VLSI architectures achieving up to 424 Mbps , 2006, 2006 IEEE International Symposium on Circuits and Systems.

[65]  Gerd Ascheid,et al.  Complexity-efficient enumeration techniques for soft-input, soft-output sphere decoding , 2010, IEEE Communications Letters.

[66]  Sachin Katti,et al.  Strider: automatic rate adaptation and collision handling , 2011, SIGCOMM 2011.