Effective reduction for sphere decoder in linear multi-input multi-output channel systems

Effective reduction for sphere decoder in linear multi-input multi-output channel systems

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

In linear multi-input multi-output channel systems, reduction process is employed to reduce the computational cost of sphere decoding (SD) algorithm. Usually a reduction process includes not only permutations but also unimodular transformations. However, owing to the box-constraint, the current reduction strategies are limited to only permutations, which makes SD algorithm still very time-consuming. In this study a theoretical complexity analysis on SD algorithm is first proposed to show what kind of criteria a reduction process should pursue. Then a new reduction strategy which combines permutations with unimodular transformations is presented to obtain a better reduced detection problem. Simulation results showed that this new reduction strategy can make SD algorithm much more efficient than those reduction strategies with only permutations.


    1. 1)
      • Boutros, J., Gresset, N., Brunel, L., Fossorier, M.: `Soft-input soft-output lattice sphere decoder for linear channels', Proc. IEEE 2003 Global Communications Conf., December 2003, San Francisco, USA.
    2. 2)
    3. 3)
    4. 4)
    5. 5)
    6. 6)
    7. 7)
    8. 8)
    9. 9)
    10. 10)
    11. 11)
      • Su, K., Wassell, I.J.: `A new ordering for efficient sphere decoding', Proc. IEEE Int. Conf. on Communications, 2005, 3, p. 1906–1910.
    12. 12)
      • Breen, S., Chang, X.-W.: `Column reordering for box-constrained integer least squares problems', Proc. IEEE GlobeCom Conf., Houston, Texas, USA, Dec. 2011.
    13. 13)
    14. 14)
    15. 15)
    16. 16)
      • Damen, M., El Gamel, H., Caire, G.: `MMSE-GDFE lattice decoding for solving under-determined linear systems with integer unknowns', Proc. IEEE Int. Symp. on Information Theory, June–July 2004, Chicago, USA.
    17. 17)
    18. 18)
    19. 19)
      • Wang, P., Le-Ngoc, T.: `A low complexity generalized sphere decoding approach for underdetermined MIMO systems', Proc. IEEE Int. Conf. on Communications, June 2006, p. 4266–4271.
    20. 20)
    21. 21)
    22. 22)
      • G.H. Golub , C.F. Van Loan . (1989) Matrix computations.

Related content

This is a required field
Please enter a valid email address