Computational complexity of optimum multiuser detection (Q1825661): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Minimum probability of error for asynchronous Gaussian multiple-access channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Multiuser Asymptotic Efficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple-access channels with point-process observations: Optimum demodulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear multiuser detectors for synchronous code-division multiple-access channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3959868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4177448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational savings and implementation of maximum likelihood detectors (Corresp.) / rank
 
Normal rank

Revision as of 10:19, 20 June 2024

scientific article
Language Label Description Also known as
English
Computational complexity of optimum multiuser detection
scientific article

    Statements

    Computational complexity of optimum multiuser detection (English)
    0 references
    0 references
    0 references
    1989
    0 references
    NP-complete
    0 references
    hypothesis testing
    0 references
    Gaussian communication channels
    0 references
    maximum-likelihood sequence detection
    0 references
    code division multiple-access
    0 references

    Identifiers