Parallel Stack Decoding for MIMO Schemes

Classical ML decoders for multiple input multiple output (MIMO) systems like the sphere decoder, the Schnorr- Euchner algorithm, the Fano and the stack decoders suffer from high complexity for high number of antennas and large constellation sizes. In this paper, we propose the use of parallel processing for stack decoding, to decode signals transmitted on linear MIMO channels to reduce time consumption of hardware architecture. It will be shown that the parallel stack decoder allows a 50% less of run time compared to the classical stack decoder.

[1]  B. Hassibi,et al.  On the expected complexity of sphere decoding , 2001, Conference Record of Thirty-Fifth Asilomar Conference on Signals, Systems and Computers (Cat.No.01CH37256).

[2]  Robert Mario Fano,et al.  A heuristic discussion of probabilistic decoding , 1963, IEEE Trans. Inf. Theory.

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

[4]  Ender Ayanoglu,et al.  Reduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[5]  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..

[6]  F. Jelinek Fast sequential decoding algorithm using a stack , 1969 .

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