Direct proof of polynomial complexity optimum multiuser detection algorithm

Electronics Letters

Volumn 37, Issue 19, 2001, Pages 1203-1204

  Reid, A B ^a   Grant, A J ^a   Alexander, P D ^b  

^a UNIVERSITY OF SOUTH AUSTRALIA   (Australia)

^b Southern Poro Communications   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CHANNEL CAPACITY; COMPUTATIONAL COMPLEXITY; MATRIX ALGEBRA; POLYNOMIALS; PROBABILITY; SIGNAL PROCESSING; VECTORS;

MULTIUSER DETECTION ALGORITHM;

SYSTEMS ANALYSIS;

EID: 0035855754     PISSN: 00135194     EISSN: None     Source Type: Journal    
DOI: 10.1049/el:20010804     Document Type: Article

References (5)

1. Polynomial complexity optimal detection of certain multiple access systems
2. Optimum multiuser detection is tractable for synchronous CDMA systems using m-sequences
3. Solving a class of optimum multiuser detection problems with polynomial complexity