Soft-output sphere decoding: algorithms and VLSI implementation

Multiple-input multiple-output (MIMO) detection algorithms providing soft information for a subsequent channel decoder pose significant implementation challenges due to their high computational complexity. In this paper, we show how sphere decoding can be used as an efficient tool to implement soft-output MIMO detection with flexible trade-offs between computational complexity and (error rate) performance. In particular, we provide VLSI implementation results which demonstrate that single tree-search, sorted QR-decomposition, channel matrix regularization, log-likelihood ratio clipping, and imposing runtime constraints are the key ingredients for realizing soft-output MIMO detectors with near max-log performance at a chip area that is only 58% higher than that of the best-known hard-output sphere decoder VLSI implementation.

[1]  Helmut Bölcskei,et al.  Space-Time Wireless Systems: From Array Processing to MIMO Communications , 2008 .

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

[3]  Gerhard Fettweis,et al.  Smart candidate adding: A new low-complexity approach towards near-capacity MIMO detection , 2005, 2005 13th European Signal Processing Conference.

[4]  Zhi-Quan Luo,et al.  Soft quasi-maximum-likelihood detection for multiple-antenna channels , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[5]  Mong-Suan Yee.  Max-log-MAP sphere decoder , 2005, Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005..

[6]  B. Ottersten,et al.  Parallel Implementation of a Soft Output Sphere Decoder , 2005, Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005..

[7]  K. Kammeyer,et al.  Efficient algorithm for decoding layered space-time codes , 2001 .

[8]  Helmut Bölcskei,et al.  Advanced receiver algorithms for MIMO wireless communications , 2006, Proceedings of the Design Automation & Test in Europe Conference.

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

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

[11]  U. Fincke,et al.  Improved methods for calculating vectors of short length in a lattice , 1985 .

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

[13]  Joachim Hagenauer,et al.  Iterative decoding of binary block and convolutional codes , 1996, IEEE Trans. Inf. Theory.

[14]  Helmut Bölcskei,et al.  On the capacity of OFDM-based spatial multiplexing systems , 2002, IEEE Trans. Commun..

[15]  V. Erceg,et al.  TGn Channel Models , 2004 .

[16]  Mohamed Oussama Damen,et al.  Lattice code decoder for space-time codes , 2000, IEEE Communications Letters.

[17]  K.-D. Kammeyer,et al.  MMSE extension of V-BLAST based on sorted QR decomposition , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

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

[19]  E. Biglieri,et al.  A universal decoding algorithm for lattice codes , 1993 .

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

[21]  Georgios B. Giannakis,et al.  Approaching MIMO channel capacity with reduced-complexity soft sphere decoding , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[22]  A. Burg,et al.  Soft-Output Sphere Decoding: Performance and Implementation Aspects , 2006, 2006 Fortieth Asilomar Conference on Signals, Systems and Computers.

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