Sphere Decoding Complexity Exponent for Decoding Full-Rate Codes Over the Quasi-Static MIMO Channel

In the setting of quasi-static multiple-input multiple-output channels, we consider the high signal-to-noise ratio (SNR) asymptotic complexity required by the sphere decoding (SD) algorithm for decoding a large class of full-rate linear space-time codes. With SD complexity having random fluctuations induced by the random channel, noise, and codeword realizations, the introduced SD complexity exponent manages to concisely describe the computational reserves required by the SD algorithm to achieve arbitrarily close to optimal decoding performance. Bounds and exact expressions for the SD complexity exponent are obtained for the decoding of large families of codes with arbitrary performance characteristics. For the particular example of decoding the recently introduced threaded cyclic-division-algebra-based codes—the only currently known explicit designs that are uniformly optimal with respect to the diversity multiplexing tradeoff—the SD complexity exponent is shown to take a particularly concise form as a non-monotonic function of the multiplexing gain. To date, the SD complexity exponent also describes the minimum known complexity of any decoder that can provably achieve a gap to maximum likelihood performance that vanishes in the high SNR limit.

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

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

[3]  Mohamed Oussama Damen,et al.  Universal space-time coding , 2003, IEEE Trans. Inf. Theory.

[4]  Babak Hassibi,et al.  On the sphere-decoding algorithm II. Generalizations, second-order statistics, and applications to communications , 2005, IEEE Transactions on Signal Processing.

[5]  Helmut Bölcskei,et al.  Performance and Complexity Analysis of Infinity-Norm Sphere-Decoding , 2010, IEEE Transactions on Information Theory.

[6]  Lei Zhao,et al.  Diversity and Multiplexing Tradeoff in General Fading Channels , 2006, IEEE Transactions on Information Theory.

[7]  Cong Ling,et al.  Decoding by Sampling: A Randomized Lattice Algorithm for Bounded Distance Decoding , 2010, IEEE Transactions on Information Theory.

[8]  Helmut Bölcskei,et al.  Soft–Input Soft–Output Single Tree-Search Sphere Decoding , 2009, IEEE Transactions on Information Theory.

[9]  Amir Dembo,et al.  Large Deviations Techniques and Applications , 1998 .

[10]  Gregory W. Wornell,et al.  Structured space-time block codes with optimal diversity-multiplexing tradeoff and minimum delay , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[11]  B. Sundar Rajan,et al.  Full-diversity, high-rate space-time block codes from division algebras , 2003, IEEE Trans. Inf. Theory.

[12]  Andrew C. Singer,et al.  Efficient Soft-Input Soft-Output Tree Detection via an Improved Path Metric , 2011, IEEE Transactions on Information Theory.

[13]  Roger F. Woods,et al.  Real-Valued Fixed-Complexity Sphere Decoder for High Dimensional QAM-MIMO Systems , 2011, IEEE Transactions on Signal Processing.

[14]  Emanuele Viterbo,et al.  The golden code: a 2 x 2 full-rate space-time code with non-vanishing determinants , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[15]  P. Vijay Kumar,et al.  Perfect Space–Time Codes for Any Number of Antennas , 2007, IEEE Transactions on Information Theory.

[16]  G. Stewart.  On the Perturbation of Pseudo-Inverses, Projections and Linear Least Squares Problems , 1977 .

[17]  Giuseppe Caire,et al.  Asymptotic Performance of Linear Receivers in MIMO Fading Channels , 2008, IEEE Transactions on Information Theory.

[18]  Mohamed Oussama Damen,et al.  Lattice sequential decoder for coded MIMO channel: Performance and complexity analysis , 2010, 2010 IEEE International Symposium on Information Theory.

[19]  Michael P. Fitz,et al.  Iterative Sphere Detectors for Imperfect Channel State Information , 2011, IEEE Transactions on Communications.

[20]  Mohamed Oussama Damen,et al.  Lattice Sequential Decoding for LAST Coded MIMO Channels: Achievable Rate, DMT, and Complexity Analysis , 2011 .

[21]  Frédérique E. Oggier,et al.  Cyclic Division Algebras: A Tool for Space-Time Coding , 2007, Found. Trends Commun. Inf. Theory.

[22]  Michael P. Fitz,et al.  Reducing The Detection Complexity By Using 2×2 Multi-Strata Space-Time Codes , 2007, 2007 IEEE International Symposium on Information Theory.

[23]  Antonia Maria Tulino,et al.  Random Matrix Theory and Wireless Communications , 2004, Found. Trends Commun. Inf. Theory.

[24]  Olav Tirkkonen,et al.  Combined information and performance optimization of linear MIMO modulations , 2002, Proceedings IEEE International Symposium on Information Theory,.

[25]  B. Sundar Rajan,et al.  A novel MCMC algorithm for near-optimal detection in large-scale uplink mulituser MIMO systems , 2012, 2012 Information Theory and Applications Workshop.

[26]  Babak Hassibi,et al.  High-rate codes that are linear in space and time , 2002, IEEE Trans. Inf. Theory.

[27]  Mohammad Gharavi-Alkhansari,et al.  A 2×2 Space-Time Code with Non-Vanishing Determinants and Fast Maximum Likelihood Decoding , 2007, 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07.

[28]  Amir K. Khandani,et al.  On the Limitations of the Naive Lattice Decoding , 2010, IEEE Transactions on Information Theory.

[29]  Yi Hong,et al.  On Fast-Decodable Space–Time Block Codes , 2007, IEEE Transactions on Information Theory.

[30]  B. Sundar Rajan,et al.  STBC-schemes with nonvanishing determinant for certain number of transmit antennas , 2005, IEEE Transactions on Information Theory.

[31]  B. Sundar Rajan,et al.  STBC-schemes with non-vanishing determinant for certain number of transmit antennas , 2005, ISIT.

[32]  Frédérique E. Oggier,et al.  Perfect Space–Time Block Codes , 2006, IEEE Transactions on Information Theory.

[33]  Lei Zhao,et al.  Diversity and Multiplexing Tradeoff in General Fading Channels , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[34]  Giuseppe Caire,et al.  A unified framework for tree search decoding: rediscovering the sequential decoder , 2005, IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005..

[35]  P. Vijay Kumar,et al.  Explicit Space–Time Codes Achieving the Diversity–Multiplexing Gain Tradeoff , 2006, IEEE Transactions on Information Theory.

[36]  Amir K. Khandani,et al.  On the Complexity of Decoding Lattices Using the Korkin-Zolotarev Reduced Basis , 1998, IEEE Trans. Inf. Theory.

[37]  Helmut Bölcskei,et al.  Tail behavior of sphere-decoding complexity in random lattices , 2009, 2009 IEEE International Symposium on Information Theory.

[38]  Björn E. Ottersten,et al.  On the limits of sphere decoding , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[39]  Helmut Bölcskei,et al.  On the Complexity Distribution of Sphere Decoding , 2011, IEEE Transactions on Information Theory.

[40]  Joakim Jaldén,et al.  DMT Optimality of LR-Aided Linear Decoders for a General Class of Channels, Lattice Designs, and System Models , 2009, IEEE Transactions on Information Theory.

[41]  Jacob Goldberger,et al.  MIMO Detection for High-Order QAM Based on a Gaussian Tree Approximation , 2010, IEEE Transactions on Information Theory.

[42]  Björn E. Ottersten,et al.  On the complexity of sphere decoding in digital communications , 2005, IEEE Transactions on Signal Processing.

[43]  Jean-Claude Belfiore,et al.  Quaternionic lattices for space-time coding , 2003, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674).

[44]  Emanuele Viterbo,et al.  The golden code: a 2×2 full-rate space-time code with nonvanishing determinants , 2004, IEEE Trans. Inf. Theory.

[45]  Giuseppe Caire,et al.  Lattice coding and decoding achieve the optimal diversity-multiplexing tradeoff of MIMO channels , 2004, IEEE Transactions on Information Theory.

[46]  Alexandros G. Dimakis,et al.  Near-Optimal Detection in MIMO Systems Using Gibbs Sampling , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

[47]  Emanuele Viterbo,et al.  A universal lattice code decoder for fading channels , 1999, IEEE Trans. Inf. Theory.

[48]  Lutz H.-J. Lampe,et al.  On the Complexity of Sphere Decoding for Differential Detection , 2007, IEEE Transactions on Information Theory.

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

[50]  Lizhong Zheng,et al.  Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels , 2003, IEEE Trans. Inf. Theory.

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

[52]  I. Vaughan L Clarkson,et al.  Approximation of linear forms by lattice points with applications to signal processing , 1997 .

[53]  Charles R. Johnson,et al.  Topics in Matrix Analysis , 1991 .

[54]  Antonio Córdoba,et al.  Lattice points , 1997 .

[55]  Pramod Viswanath,et al.  Approximately universal codes over slow-fading channels , 2005, IEEE Transactions on Information Theory.

[56]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[57]  Yingbin Liang,et al.  Submitted to the IEEE Transactions on Information Theory , June 2006 Rate Regions for Relay Broadcast Channels 1 2 , 2006 .

[58]  Christopher Holden,et al.  Perfect Space-Time Block Codes , 2004 .

[59]  Babak Hassibi,et al.  On the Performance of Sphere Decoding of Block Codes , 2009, 2006 IEEE International Symposium on Information Theory.