ET-FSD: A feasible scheme of MIMO detection to exploit scalar effects

In this paper, the early-termination fixed-complexity sphere detector (ET-FSD) that is a channel-adaptive version of FSD, is developed to exploit scale effects for the multiple-antenna system which has to detect signals of multiple users under the constraint of sum complexity (e.g., the base-station systems always encounter the run-time limit of signal detection of all the users). In order to apply the concept of scale effects in microeconomics to the study of ET-FSD, the corresponding mathematic model primarily based on the large deviation principle is established. The key evidence that tells the existence of scale effects in ET-FSD is presented instead of the complete proof due to the space limitation. We also argue that within multiple-user systems the scale effects can be utilized to realize ET-FSD that has both the optimal performance in the point view of diversity order and the polynomial time unit complexity in the worst-case sense (one can think of unit complexity as the complexity per user in multiple-user scenario). Finally, we provide the numerical results to support the theoretical analysis.

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

[2]  Yuan Qi,et al.  Scale effects oriented MIMO detector , 2011, 2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications.

[3]  Xing Zhang,et al.  Performance Analysis of Multiuser Diversity in MIMO Systems with Antenna Selection , 2008, IEEE Transactions on Wireless Communications.

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

[5]  Ravi Narasimhan,et al.  Spatial multiplexing with transmit antenna and constellation selection for correlated MIMO fading channels , 2003, IEEE Trans. Signal Process..

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

[7]  Björn E. Ottersten,et al.  Full Diversity Detection in MIMO Systems with a Fixed-Complexity Sphere Decoder , 2007, 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07.

[8]  Xiaodong Wang,et al.  Multiuser Diversity Gain in Cognitive Networks , 2010, IEEE/ACM Transactions on Networking.

[9]  Amir K. Khandani,et al.  On the limitations of the naive lattice decoding , 2010, IEEE Trans. Inf. Theory.

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

[11]  Yuan Qi,et al.  On the scale effects oriented MIMO detector: Diversity order, worst-case unit complexity and scale effects , 2013, Signal Process..

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

[13]  Rohit U. Nabar,et al.  Introduction to Space-Time Wireless Communications , 2003 .

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

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

[16]  John S. Thompson,et al.  Performance Analysis of a Fixed-Complexity Sphere Decoder in High-Dimensional Mimo Systems , 2006, 2006 IEEE International Conference on Acoustics Speech and Signal Processing Proceedings.

[17]  Joakim Jaldén,et al.  Sphere Decoding Complexity Exponent for Decoding Full-Rate Codes Over the Quasi-Static MIMO Channel , 2011, IEEE Transactions on Information Theory.

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

[19]  Ashutosh Sabharwal,et al.  On Diversity and Multiplexing Gain of Multiple Antenna Systems with Transmitter Channel Information , 2004 .

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