Geosphere: An Exact Depth-First Sphere Decoder Architecture Scalable to Very Dense Constellations

This paper presents the algorithmic design, experimental evaluation, and very large scale of integration (VLSI) implementation of Geosphere, a depth-first sphere decoder able to provide the exact maximum-likelihood solution in dense (e.g., 64) and very dense (e.g., 256, 1024) quadrature amplitude modulation (QAM) constellations by means of a geometrically inspired enumeration. In general, linear detection methods can be highly effective when the multiple input, multiple output (MIMO) channel is well-conditioned. However, this is not the case when the size of the MIMO system increases and the number of transmit antennas approaches the number of the receive antennas. Via our wireless open access research platform (WARP) testbed implementation, we gather indoor channel traces in order to evaluate the performance gains of sphere detection against zero-forcing and minimum mean-square errors (MMSE) in an actual indoor environment. We show that Geosphere can nearly linearly scale performance with the number of user antennas; in <inline-formula> <tex-math notation="LaTeX">$4\times 4$ </tex-math></inline-formula> multi-user MIMO for 256-QAM modulation at 30-dB SNR, there is a <inline-formula> <tex-math notation="LaTeX">$1.7\times $ </tex-math></inline-formula> gain over MMSE and <inline-formula> <tex-math notation="LaTeX">$2.4\times $ </tex-math></inline-formula> over zero-forcing and a 14% and 22% respective gain in <inline-formula> <tex-math notation="LaTeX">$2\times 2$ </tex-math></inline-formula> systems. In addition, by using a new node labeling-based enumeration technique, low-complexity integer arithmetic, and fine-grained clock gating, we implement for up to 1024-QAM constellations and compare in terms of area, delay, power characteristics, the Geosphere VLSI architecture, and the best-known best-scalable exact ML sphere decoder. Results show that Geosphere is twice as area-efficient and 70% more energy efficient in 1024-QAM. Even for 16-QAM, Geosphere is 13% more area-efficient than the best-known implementation for 16-QAM, and it is at least 80% more area-efficient than the state-of-the-art <inline-formula> <tex-math notation="LaTeX">$K$ </tex-math></inline-formula>-best detectors for 64-QAM.

[1]  K. Nikitopoulos.  Maximum likelihood detection of spatially multiplexed signals via loosely ordered depth-first sphere decoding , 2012 .

[2]  M. O. Damen,et al.  A unified framework for tree search decoding: rediscovering the sequential decoder , 2005, SPAWC 2005.

[3]  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..

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

[5]  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.

[6]  Claus-Peter Schnorr,et al.  Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems , 1991, FCT.

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

[8]  Babak Hassibi,et al.  On the sphere-decoding algorithm I. Expected complexity , 2005, IEEE Transactions on Signal Processing.

[9]  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.

[10]  N. Kita,et al.  Measurement of Demmel condition number for 2/spl times/2 MIMO-OFDM broadband channels , 2004, 2004 IEEE 59th Vehicular Technology Conference. VTC 2004-Spring (IEEE Cat. No.04CH37514).

[11]  Juan Zhou,et al.  Geosphere: consistently turning MIMO capacity into throughput , 2014, SIGCOMM.

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

[13]  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.

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

[15]  Helmut Bölcskei,et al.  Soft-output sphere decoding: algorithms and VLSI implementation , 2008, IEEE Journal on Selected Areas in Communications.

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

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

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

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

[20]  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).

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

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

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

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

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

[26]  Iain B. Collings,et al.  Transmitter Noise Effect on the Performance of a MIMO-OFDM Hardware Implementation Achieving Improved Coverage , 2008, IEEE Journal on Selected Areas in Communications.

[27]  Mojtaba Mahdavi,et al.  Novel MIMO Detection Algorithm for High-Order Constellations in the Complex Domain , 2013, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[28]  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.

[29]  Louay M. A. Jalloul,et al.  Reduced Complexity Soft-Output MIMO Sphere Detectors—Part II: Architectural Optimizations , 2014, IEEE Transactions on Signal Processing.

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

[31]  Ravi Jenkal,et al.  Architecture for Energy Efficient Sphere Decoding , 2006, 2006 IEEE International SOC Conference.

[32]  Andreas Peter Burg,et al.  VLSI implementation of pipelined sphere decoding with early termination , 2006, 2006 14th European Signal Processing Conference.

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

[34]  Ming-Syan Chen,et al.  Rate Adaptation for 802.11 Multiuser MIMO Networks , 2014, IEEE Trans. Mob. Comput..

[35]  Dionysios I. Reisis,et al.  Exact Max-Log MAP Soft-Output Sphere Decoding via Approximate Schnorr–Euchner Enumeration , 2015, IEEE Transactions on Vehicular Technology.

[36]  Tong Zhang,et al.  A 1.1-Gb/s 115-pJ/bit Configurable MIMO Detector Using 0.13- $\mu\hbox{m}$ CMOS Technology , 2010, IEEE Transactions on Circuits and Systems II: Express Briefs.

[37]  Gerd Ascheid,et al.  Approximate MIMO Iterative Processing With Adjustable Complexity Requirements , 2012, IEEE Transactions on Vehicular Technology.

[38]  Raymond Knopp,et al.  On the trade-off between feedback and capacity in measured MU-MIMO channels , 2009, IEEE Transactions on Wireless Communications.

[39]  Dejan Markovic,et al.  A Flexible DSP Architecture for MIMO Sphere Decoding , 2009, IEEE Transactions on Circuits and Systems I: Regular Papers.

[40]  L. G. Barbero,et al.  A Fixed-Complexity MIMO Detector Based on the Complex Sphere Decoder , 2006, 2006 IEEE 7th Workshop on Signal Processing Advances in Wireless Communications.

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

[42]  H. Jonathan Chao,et al.  A Novel Architecture for Queue Management in the ATM Network , 1991, IEEE J. Sel. Areas Commun..

[43]  Pei-Yun Tsai,et al.  Toward Multi-Gigabit Wireless: Design of High-Throughput MIMO Detectors With Hardware-Efficient Architecture , 2014, IEEE Transactions on Circuits and Systems I: Regular Papers.

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

[45]  Kang G. Shin,et al.  Scalable Hardware Priority Queue Architectures for High-Speed Packet Switches , 2000, IEEE Trans. Computers.

[46]  Gerd Ascheid,et al.  Combining orthogonalized partial metrics: Efficient enumeration for soft-input sphere decoder , 2009, 2009 IEEE 20th International Symposium on Personal, Indoor and Mobile Radio Communications.