Partial regularisation approach for detection problems in underdetermined linear systems

Partial regularisation approach for detection problems in underdetermined linear 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.

The maximum likelihood detection problem in many underdetermined linear communications systems can be described as an underdetermined integer least squares (ILS) problem. To solve it efficiently, a partial regularisation approach is proposed. The original underdetermined ILS problem is first transformed to an equivalent overdetermined ILS problem by using part of the transmit vector to do the regularisation. Then the overdetermined ILS problem is solved by conventional sphere decoding algorithms. Simulation results indicate that this approach can be much more efficient than other approaches for any square constellation higher than 4QAM.


    1. 1)
    2. 2)
    3. 3)
    4. 4)
    5. 5)
      • A.D. Murguan , H. El Gamal , M. Damen , G. Caire . A unified framework for tree search decoding: rediscovering the sequential decoder. IEEE Trans. Inf. Theory , 3 , 933 - 953
    6. 6)
    7. 7)
    8. 8)
    9. 9)
      • M. Damen , K. Abed-Meraim , J. Belfiore . Generalized sphere decoder for asymmetrical space-time communication architecture. Electron. Lett. , 166 - 167
    10. 10)
      • Dayal, P., Varanasi, M.: `A fast generalized sphere decoder for optimum decoding of under-determined MIMO systems', Proc. 41st Annu. Allerton Conf. Communication, Control, and Computing, October 2003, Monticello, IL, p. 1216–1225.
    11. 11)
    12. 12)
      • Chang, X.-W., Yang, X.: `A new fast generalized sphere decoding algorithm for underdetermined MIMO systems', Proc. 23rd Queen's Biennial Symp. Communications, 2006, Kingston, CA, p. 18–21.
    13. 13)
    14. 14)
      • Damen, M., El Gamel, H., Caire, G.: `MMSE-GDFE lattice decoding for solving under-determined linear systems with integer unknowns', Proc. IEEE Int. Symp. Inform. Theory, June–July 2004, Chicago, USA.
    15. 15)
      • Wang, P., Le-Ngoc, T.: `A low complexity generalized sphere decoding approach for underdetermined MIMO systems', Proc. IEEE Int. Conf. Communications, June 2006, p. 4266–4271.
    16. 16)
      • T.H. Cormen , C.E. Leiserson , R.L. Rivest , C. Stein . (2009) Introduction to algorithms.
    17. 17)
    18. 18)
      • Wang, P., Le-Ngoc, T.: `An efficient multi-user detection scheme for overloaded group-orthogonal MC-CDMA systems', IEEE ISWPC07, February 2007, p. 280–284.
    19. 19)
      • Erceg, V., Hari, K., Smith, M.S.: `Channel models for fixed wireless applications', IEEE 802.16.3c-01/29r4, July 2001.
    20. 20)
    21. 21)
      • G.H. Golub , C.F. Van Loan . (1989) Matrix computations.

Related content

This is a required field
Please enter a valid email address