• DocumentCode
    2480051
  • Title

    Optimum multiuser detection with polynomial complexity

  • Author

    Sankaran, Chandrasekar ; Enhremides, A.

  • Author_Institution
    Dept. of Electr. Eng., Maryland Univ., College Park, MD, USA
  • fYear
    1998
  • fDate
    16-21 Aug 1998
  • Firstpage
    343
  • Abstract
    In this paper, we identify a class of optimum multiuser detection problems which can be solved with polynomial complexity in the number of users; and apply the result to a DS-CDMA system
  • Keywords
    code division multiple access; computational complexity; quadratic programming; signal detection; spread spectrum communication; DS-CDMA system; optimum multiuser detection; polynomial complexity; Bridges; Computational complexity; Educational institutions; Gold; Multiuser detection; Polynomials; Spread spectrum communication;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
  • Conference_Location
    Cambridge, MA
  • Print_ISBN
    0-7803-5000-6
  • Type

    conf

  • DOI
    10.1109/ISIT.1998.708948
  • Filename
    708948
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2480051