Direct proof of polynomial complexity optimum multiuser detection algorithm
A new approach to the polynomial complexity optimal detection algorithm for certain synchronous multiple access systems was presented. Identification of properties of signature signal matrices leading to polynomial complexity algorithm was performed. It was observed that optimum detector makes a dec...
Saved in:
| Published in: | Electronics letters Vol. 37; no. 19; pp. 1203 - 1204 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
13.09.2001
|
| ISSN: | 0013-5194 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | A new approach to the polynomial complexity optimal detection algorithm for certain synchronous multiple access systems was presented. Identification of properties of signature signal matrices leading to polynomial complexity algorithm was performed. It was observed that optimum detector makes a decision on the transmitted signal in each symbol interval such that the probability of a correct decision is maximized. |
|---|---|
| Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| ISSN: | 0013-5194 |
| DOI: | 10.1049/el:20010804 |