• DocumentCode
    1536671
  • Title

    Direct proof of polynomial complexity optimum multiuser detection algorithm

  • Author

    Reid, A.B. ; Grant, A.J. ; Alexander, P.D.

  • Author_Institution
    Inst. for Telecommun. Res., Univ. of South Australia, SA, Australia
  • Volume
    37
  • Issue
    19
  • fYear
    2001
  • fDate
    9/13/2001 12:00:00 AM
  • Firstpage
    1203
  • Lastpage
    1204
  • Abstract
    A direct proof of a polynomial complexity algorithm for a certain class of multiple user detection problems is given. The properties of signature signal matrices leading to the polynomial complexity algorithm are identified
  • Keywords
    communication complexity; matrix algebra; multi-access systems; multiuser channels; polynomials; signal detection; optimum multiuser detection algorithm; polynomial complexity algorithm; signature signal matrices;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el:20010804
  • Filename
    953349
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1536671