Sphere Decoding for Multiprocessor Architectures

Motivated by the need for high throughput sphere decoding for multiple-input-multiple-output (MIMO) communication systems, we propose a parallel depth-first sphere decoding (PDSD) algorithm that provides the advantages of both parallel processing and rapid search space reduction. The PDSD algorithm is designed for efficient implementation on programmable multi-processor platforms. We investigate the trade-off between the throughput and computation overhead when the number of processing elements is 2, 4 and 8, for a 4 × 4 16-QAM system across a wide range of SNR conditions. Through simulation, we show that PDSD can offer significant throughput improvement without incurring substantial computation overhead by selecting the appropriate number of processing elements according to specific SNR conditions.

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

[2]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[3]  Björn E. Ottersten,et al.  An exponential lower bound on the expected complexity of sphere decoding , 2004, 2004 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[4]  Michael E. Pohst,et al.  On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications , 1981, SIGS.

[5]  Amir K. Khandani,et al.  A near maximum likelihood decoding algorithm for MIMO systems based on semi-definite programming , 2005, ISIT.

[6]  Gerard J. Foschini,et al.  Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas , 1996, Bell Labs Technical Journal.

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

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

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

[10]  Nikos D. Sidiropoulos,et al.  A Semidefinite Relaxation Approach to MIMO Detection for High-Order QAM Constellations , 2006, IEEE Signal Processing Letters.

[11]  Keshab K. Parhi,et al.  Probabilistic List Sphere Decoding for LDPC-Coded MIMO-OFDM Systems , 2006, 2006 IEEE International Conference on Acoustics Speech and Signal Processing Proceedings.

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

[13]  Hyunseok Lee,et al.  SODA: A Low-power Architecture For Software Radio , 2006, 33rd International Symposium on Computer Architecture (ISCA'06).

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

[15]  Tong Zhang,et al.  Relaxed tree search MIMO signal detection algorithm design and VLSI implementation , 2006, 2006 IEEE International Symposium on Circuits and Systems.

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