An Efficient Fixed-Complexity Sphere Decoder with Quantized Soft Outputs

In practical multiple-input multiple-output bit-interleaved-coded-modulation (MIMO-BICM) systems, demodulators have to deliver finite word-length (quantized) log-likelihood-ratios (LLRs). In this letter, we propose an efficient modification of the fixed-complexity sphere decoder for MIMO-BICM systems working with quantized LLRs. Our approach reduces the complexity of previously proposed schemes via pruning strategies that exploit the clipping and quantization of LLRs. Numerical results confirm that our scheme achieves a significant complexity reduction (by 37% for the case of 2 bits per LLR and by 31% for the case of 3 bits per LLR) with negligible degradation in bit error rate performance.

[1]  Tharmalingam Ratnarajah,et al.  A low-complexity soft-MIMO detector based on the fixed-complexity sphere decoder , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.

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

[3]  Gerhard Fettweis,et al.  A Fixed-Complexity Smart Candidate Adding Algorithm for Soft-Output MIMO Detection , 2009, IEEE Journal of Selected Topics in Signal Processing.

[4]  John S. Thompson,et al.  A Fixed-Complexity Soft-MIMO Detector via Parallel Candidate Adding Scheme and its FPGA Implementation , 2011, IEEE Communications Letters.

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

[6]  Gerald Matz,et al.  Quantization for soft-output demodulators in bit-interleaved coded modulation systems , 2009, 2009 IEEE International Symposium on Information Theory.

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